Visualizing Persistent Data Structures

Explore the world of persistent data structures in this 37-minute conference talk from Strange Loop. Dive into interactive animations that provide deep intuition for complex structures and their evolution over time. Examine classic examples like red-black trees, queues, and finger trees, as well as modern structures such as persistent HAMTs and RRB-Trees. Learn about various data structure properties, including persistence types, catenability, amortization, and performance characteristics. Discover navigation techniques in functional languages, such as zippers and lenses, and compare recursive data structure definitions in lazy and eager languages. Gain valuable insights into simplifying complex structures through data visualization techniques, enhancing your understanding of persistent data structures and their applications.

Intro
Data structures are complicated
Data structure game
Abstract
Concrete
Array
Rules of Thumb
Priority Queue
Concrete Data Structures
Persistent Data Structures
Ephemeral
Confluence
Tree
Consequences
Newspaper Example
Baseball Cards
Original Implementation
Linked List
Batch Cue
Dequeue
Hashtag Map
Whats Next
JavaScript
Render
Muting
Magic Button
Tricky Q
Data Structures
Recap