Immutable Data Structures and Why You Want Them

Explore immutable data structures and their significance in Rust programming through this conference talk from RustFest Paris 2018. Dive into the discrepancy between Rust's focus on mutability control and the standard library's data structures. Discover various immutable data structures that offer efficient copying and updating, ranging from simple to complex implementations. Learn about Cons, Lookup Trees, Bee Trees, Search Trees, and Relaxed Radix, understanding their mechanics and advantages. Gain insights into why these structures are useful and how they can enhance performance in Rust applications. Follow along as Bodil Stokke explains the implementation of these structures in Rust and their practical applications in software development.

Intro
What is a data structure
Motorisation
Lisp
Cons
Lookup Trees
Bee Trees
Search Trees
Data Structures
Relaxed Radix
Why are they useful
Why are they faster