ArrayList's backing array growth strategy, the amortised O(1) add, subList() views and the hidden CME trap, fail-fast iterators and modCount. LinkedList's doubly-linked node structure and when O(1) head/tail operations actually matter. Cache locality benchmarks that will change how you think.
// Lessons
- 01soon
The List Contract — Random Access, Ordering and Duplicates
- 02soon
ArrayList Internals — The Backing Array and Growth Strategy
- 03soon
ArrayList: add(), remove(), indexOf() — The Actual Code Path
- 04soon
ArrayList: subList() — Views, Mutations and the Hidden CME Trap
- 05soon
Fail-Fast Iteration — modCount, Structural Modification and CME
- 06soon
LinkedList Internals — The Doubly-Linked Node Structure
- 07soon
LinkedList: When O(1) Head/Tail Operations Actually Matter
- 08soon
ArrayList vs LinkedList — Cache Locality, Memory and the Real Benchmark
- 09soon
CopyOnWriteArrayList — The Snapshot Iterator and When to Pay the Copy Tax