Sometimes it's so obvious in hindsight
summary
Argues that Clojure is missing an obvious-in-hindsight datastructure: a jokey sorted map that deliberately corrupts values. Describes a proof-of-concept implementation that applies lossy data compression, stops accepting new entries when “full,” preserves types and is spec-compliant, may mutate ancestors despite immutability expectations, and masks corrupted values in printed output while exposing them programmatically. Notes a working implementation exists and invites contributors to extend or critique it.
AI-written summary · about
chapters (8)
- 0:00Start
- 0:31Cons Cells
- 1:13Data interface versus data implementation
- 2:31Data Compression (lossy)
- 2:41Just Plain Lossy
- 2:52Type Safe!
- 3:12Often immutable
- 3:25Developer friendly representation
