Implementation of naive int -> any dictionaries with open or closed hashing and benchmarks.

1. Java >= 1.8, Java 11 recommended:

   ~ > brew install openjdk@11

2. SBT:

   ~ > brew install sbt

1. To run benchmarks:

   ~ > sbt dicts-benchmark/jmh:run

2. To run tests if necessary:

   ~ > sbt test

Note: These results use load factor of 1.0 (equals capacity - 1 in code), which is totally unreal and synthetic setting.

• get*(count) -- gets count of random existing keys from pre-generated dictionary of 2^20 entries;
• miss*(count) -- gets count of random missing keys from pre-generated dictionary of 2^20 entries;
• put*(count) -- put into empty dict count of key-value pair from pre-generated arrays of 2^20 elements;
• putAndGet*(count) -- selects count of keys from pregenerated array, shuffles them and puts 3/4 of them into empty dict, then shuffles again and gets 3/4 of keys;
• *Allocated* -- the same as put*|putAndGet* but with capacity set to count.

• CPU: 2,3 GHz 8-Core Intel Core i9
• RAM: 16 GB 2400 MHz DDR4
• OS: macOS Big Sur 11.2.3