Clojure Data Structures Part 2 - Rich Hickey
Why Stack Overflow recommends it
Stack Overflow users link it when explaining Clojure reader forms and how Clojure's persistent, immutable collections are built, straight from the language's author.
Recommended by 3 people across 3 different months, 2012 to 2024.
What it is
Part 2 of an informal introductory talk and screencast by Rich Hickey, the creator of Clojure, on the language's core data structures. It walks through numbers, symbols, keywords, lists, vectors and maps.
What people said
Recommends Jeff · 2012-03 · Stack Overflow · on “Clojure : loading dependencies at the REPL”
I'll go from high-level down to your particular problem: How Clojure (or LISPs) Generally Work REPLs, or Read-Eval-Print Loops are the core of how LISPs are designed: The reader converts a stream of characters into data structures (called Reader Forms). The evaluator takes collection of reader forms and evaluates them. The printer emits the results of the evaluator. So when you enter text into a REPL, it goes through each of these steps to process your input and return the output to your terminal. Reader Forms First some, clojure reader forms. This will be extremely brief, I encourage you to read [LINK] or watch ( part 1 [LINK] , part 2 [this video] ) about it. A symbol in clojure is form that ca
Recommends Shannon Severance · 2013-04 · Stack Overflow · on “What is the data structure behind Clojure's sets?”
Pedantic note: I just listened to Rich Hickey _Clojure Data Structures 2_ at [this video] Not sure where or when this was recorded. Collections have different storage implementations. (default?) vectors are shallow trees. Other collections may have other implementations.
Recommends Shmuel Greenberger · 2024-04 · Stack Overflow · on “Immutable / persistent list in Java”
I think that the implementation of immutability in Clojure would interest you very much. See Rich Hickey's videos, especially [this video]