Immutable Data Structures and why You want them

on YouTube ↗31m

" summary

A small Rust library named immutable.rs implements persistent collections (HAMT-like maps, vectors inspired by Rich Hickey and Phil Bagwell, and RRB vectors planned) on crates io and the website, trading a modest memory overhead for structural sharing. Benchmarks show cloning Vec stays faster until a couple hundred elements, but using transient mutability via make_mut on Arc lets updates be mutated in-place when unshared so immutable APIs perform like mutable ones. Some advanced concatenation features remain unimplemented.

AI-written summary · about

" chapters (12)

1. 0:00Intro
2. 1:23What is a data structure
3. 6:56Motorisation
4. 8:45Lisp
5. 11:21Cons
6. 13:36Lookup Trees
7. 16:22Bee Trees
8. 18:16Search Trees
9. 19:59Data Structures
10. 22:39Relaxed Radix
11. 24:04Why are they useful
12. 25:48Why are they faster

" related talks

• 54mKEYNOTE: A journey through incremental computationRaph Levien · RustLab 2020
• 25mIntro and Overview to RustSara Moore · Scale By The Bay 2019
• 41mFunctional Rust - An ExplorationLisa Passing · Lambda Days 2018
• 01h 03mThe most valuable valuesJuanpe Bolívar · Meeting C++ 2017
• 33mRewrite, Optimize, RepeatLuca Palmieri · EuroRust 2025
• 19mSimple CRDT in RustMatteo Bertini · RustFest Rome 2018
• 07mThe Tragedy of the value based architectureJuanpe Bolívar · Meeting C++ 2016
• 33mRust and Haskell, sitting in a treeLisa Passing · Lambda World Cádiz 2018