The LookupTable represents an efficient hash table to Variations with
two properties that make a regular HashMap unsuitable:
- The LookupTable uses bounded memory, choosing to replace old
cells rather than expand.
- The LookupTable does not check for collisions in hashCode.
As a result, LookupTable is fast, space-efficient, and
occasionally wrong.
LookupTable is thread-safe.