Provides an implementation of {@link IdMap} based on a hash table. Usesdouble hashing. The table size is always a prime number.
You MUST NOT try to add {@link Long#MAX_VALUE} or {@link Long#MIN_VALUE}as keys to the map, because these value are reserved for unused table entries.
This set is a lot faster than Map<Long, Long>
and even a little bit faster than trove4j's implementation.
|
|
|
|
|
|