This map uses full 32bit hash from beginning, There is no initial load factor and rehash. Technically it is not hash table, but hash tree with nodes expanding when they become full.
This map is suitable for number of records 1e9 and over. Larger number of records will increase hash collisions and performance will degrade linearly with number of records (separate chaining).
Concurrent scalability is achieved by splitting HashMap into 16 segments, each with separate lock. Very similar to {@link java.util.concurrent.ConcurrentHashMap} @author Jan Kotek
|
|
|
|