Understanding Clojure's Persistent Vectors, pt. 1 (2013)
Summary
hyPiRion explains Clojure’s persistent vectors, a data structure based on balanced trees that provides near-constant-time updates, appends, lookups, and subvecs while preserving immutability through path copying. The post describes the basic structure (balanced trees with shallow depth due to 32-way branching), and walks through updates, appends, and popping, noting that optimizations like transients and tails will be covered in later parts.