Maps and HashMap Internals
How a HashMap works: hashing to a bucket, collisions, resizing, the three map classes, and null keys.
How a hash map finds a value, and what that costs. A HashMap is the structure most Java code leans on, and its failure is silent: a key you can put in and never get back. It covers buckets and hashing, collisions, a bucket that turns into a tree, resizing at the load factor, HashMap, LinkedHashMap and TreeMap, and null keys. It names concurrent maps and leaves them alone.
Contents
9 cardsnot started