A Cache that is keyed by a long.
This implementation uses linear probing plus "Robin-Hood Hashing" to
ensure that insert and lookup performance are both efficient, even with
a very high load factor (around 0.9). For details about Robin-hood hashing,
for an overview, or
This blog entry
for a nice tutorial covering the essential elements. For details
on the technical nature of the strategy,
contains a good overview of worst-case performance.
This implementation does not resize arrays--instead, it pre-computes an array
, which means that when the cache is completely full,
it will have a load factor of ~ 0.9 (with Robin-Hood hashing, this is an effective size).
This class is not
thread-safe unless setting threadSafe = true on the builder.