Future of Collections
summary
Explains why persistent collections are being considered but not adopted yet: naive add would copy everything, real designs must share structure to avoid huge costs, and cache-locality and memory layout matter; discusses waiting for value objects (Project Valhalla) to avoid many heap allocations; demonstrates a concrete bug class where comparator vs equals mismatch makes TreeSet behave differently from HashSet; and shows practical tradeoffs around sequenced vs sorted interfaces and optional mutator methods throwing UnsupportedOperationException.
AI-written summary · about
chapters (9)
- 0:00Introduction
- 1:28Persistent collections
- 8:06Persistent collections research
- 9:53Set membership equals issues
- 16:42Kevin Bourrillon library insights
- 19:57Java collections compromises
- 24:16Java incremental development
- 26:19Sequenced collections
- 32:19Closing remarks
