Maps and HashMap Internals
What a hash map does with a key, and what it costs when two keys collide.
A hash map is the data structure most Java code leans on and the one whose failure mode is silent: a key you can put in and never get back. Three of the nine cards go under the hood, because the failure only makes sense from there. Concurrent maps are named and left alone.
Contents
9 cardsnot started