Settings
KEY_COUNT: 2000000
KEY_COUNT_MEASUREMENT_INTERVAL: 5000
RUN_COUNT: 12
DISCARDED_RUNS_COUNT: 2
MAX_LOAD_FACTOR: 0.875
APPROXIMATE_CACHE_SIZE: 20000000
MILLISECOND_COOLDOWN_BETWEEN_BENCHMARKS: 1000
32-bit integer key, 32-bit value: Total time to insert N nonexisting keys
Linear time from zero ⟶ N keys 400000 800000 1200000 1600000
64-bit integer key, 448-bit value: Total time to insert N nonexisting keys
Linear time from zero ⟶ N keys 400000 800000 1200000 1600000
16-char c-string key, 64-bit value: Total time to insert N nonexisting keys
Linear time from zero ⟶ N keys 400000 800000 1200000 1600000
32-bit integer key, 32-bit value: Total time to erase 1000 existing keys with N keys in the map
Linear time from zero ⟶ N keys 400000 800000 1200000 1600000
64-bit integer key, 448-bit value: Total time to erase 1000 existing keys with N keys in the map
Linear time from zero ⟶ N keys 400000 800000 1200000 1600000
16-char c-string key, 64-bit value: Total time to erase 1000 existing keys with N keys in the map
Linear time from zero ⟶ N keys 400000 800000 1200000 1600000
32-bit integer key, 32-bit value: Time to replace 1000 existing keys with N keys in the map
Linear time from zero ⟶ N keys 400000 800000 1200000 1600000
64-bit integer key, 448-bit value: Time to replace 1000 existing keys with N keys in the map
Linear time from zero ⟶ N keys 400000 800000 1200000 1600000
16-char c-string key, 64-bit value: Time to replace 1000 existing keys with N keys in the map
Linear time from zero ⟶ N keys 400000 800000 1200000 1600000
32-bit integer key, 32-bit value: Time to erase 1000 nonexisting keys with N keys in the map
Linear time from zero ⟶ N keys 400000 800000 1200000 1600000
64-bit integer key, 448-bit value: Time to erase 1000 nonexisting keys with N keys in the map
Linear time from zero ⟶ N keys 400000 800000 1200000 1600000
16-char c-string key, 64-bit value: Time to erase 1000 nonexisting keys with N keys in the map
Linear time from zero ⟶ N keys 400000 800000 1200000 1600000
32-bit integer key, 32-bit value: Time to lookup 1000 existing keys with N keys in the map
Linear time from zero ⟶ N keys 400000 800000 1200000 1600000
64-bit integer key, 448-bit value: Time to lookup 1000 existing keys with N keys in the map
Linear time from zero ⟶ N keys 400000 800000 1200000 1600000
16-char c-string key, 64-bit value: Time to lookup 1000 existing keys with N keys in the map
Linear time from zero ⟶ N keys 400000 800000 1200000 1600000
32-bit integer key, 32-bit value: Time to lookup 1000 nonexisting keys with N keys in the map
Linear time from zero ⟶ N keys 400000 800000 1200000 1600000
64-bit integer key, 448-bit value: Time to lookup 1000 nonexisting keys with N keys in the map
Linear time from zero ⟶ N keys 400000 800000 1200000 1600000
16-char c-string key, 64-bit value: Time to lookup 1000 nonexisting keys with N keys in the map
Linear time from zero ⟶ N keys 400000 800000 1200000 1600000
32-bit integer key, 32-bit value: Time to iterate over 5000 keys with N keys in the map
Linear time from zero ⟶ N keys 400000 800000 1200000 1600000
64-bit integer key, 448-bit value: Time to iterate over 5000 keys with N keys in the map
Linear time from zero ⟶ N keys 400000 800000 1200000 1600000
16-char c-string key, 64-bit value: Time to iterate over 5000 keys with N keys in the map
Linear time from zero ⟶ N keys 400000 800000 1200000 1600000