uint32_t key, uint32_t value: Total time to insert N nonexisting elements
std
tsl
martinus
CC
stb_ds
STC
khash
M*LIB
uthash
Linear time from zero ⟶
N elements
4000000
8000000
12000000
16000000
uint64_t key, 256-bit struct value: Total time to insert N nonexisting elements
std
tsl
martinus
CC
stb_ds
STC
khash
M*LIB
uthash
Linear time from zero ⟶
N elements
4000000
8000000
12000000
16000000
NULL-terminated string key, uint64_t value: Total time to insert N nonexisting elements
std
tsl
martinus
CC
stb_ds
STC
khash
M*LIB
uthash
Linear time from zero ⟶
N elements
4000000
8000000
12000000
16000000
uint32_t key, uint32_t value: Total time to erase 1000 existing elements with N elements in map
std
tsl
martinus
CC
stb_ds
STC
khash
M*LIB
uthash
Linear time from zero ⟶
N elements
4000000
8000000
12000000
16000000
uint64_t key, 256-bit struct value: Total time to erase 1000 existing elements with N elements in map
std
tsl
martinus
CC
stb_ds
STC
khash
M*LIB
uthash
Linear time from zero ⟶
N elements
4000000
8000000
12000000
16000000
NULL-terminated string key, uint64_t value: Total time to erase 1000 existing elements with N elements in map
std
tsl
martinus
CC
stb_ds
STC
khash
M*LIB
uthash
Linear time from zero ⟶
N elements
4000000
8000000
12000000
16000000
uint32_t key, uint32_t value: Time to replace 1000 existing elements with N elements in map
std
tsl
martinus
CC
stb_ds
STC
khash
M*LIB
uthash
Linear time from zero ⟶
N elements
4000000
8000000
12000000
16000000
uint64_t key, 256-bit struct value: Time to replace 1000 existing elements with N elements in map
std
tsl
martinus
CC
stb_ds
STC
khash
M*LIB
uthash
Linear time from zero ⟶
N elements
4000000
8000000
12000000
16000000
NULL-terminated string key, uint64_t value: Time to replace 1000 existing elements with N elements in map
std
tsl
martinus
CC
stb_ds
STC
khash
M*LIB
uthash
Linear time from zero ⟶
N elements
4000000
8000000
12000000
16000000
uint32_t key, uint32_t value: Time to erase 1000 nonexisting elements with N elements in map
std
tsl
martinus
CC
stb_ds
STC
khash
M*LIB
uthash
Linear time from zero ⟶
N elements
4000000
8000000
12000000
16000000
uint64_t key, 256-bit struct value: Time to erase 1000 nonexisting elements with N elements in map
std
tsl
martinus
CC
stb_ds
STC
khash
M*LIB
uthash
Linear time from zero ⟶
N elements
4000000
8000000
12000000
16000000
NULL-terminated string key, uint64_t value: Time to erase 1000 nonexisting elements with N elements in map
std
tsl
martinus
CC
stb_ds
STC
khash
M*LIB
uthash
Linear time from zero ⟶
N elements
4000000
8000000
12000000
16000000
uint32_t key, uint32_t value: Time to lookup 1000 existing elements with N elements in map
std
tsl
martinus
CC
stb_ds
STC
khash
M*LIB
uthash
Linear time from zero ⟶
N elements
4000000
8000000
12000000
16000000
uint64_t key, 256-bit struct value: Time to lookup 1000 existing elements with N elements in map
std
tsl
martinus
CC
stb_ds
STC
khash
M*LIB
uthash
Linear time from zero ⟶
N elements
4000000
8000000
12000000
16000000
NULL-terminated string key, uint64_t value: Time to lookup 1000 existing elements with N elements in map
std
tsl
martinus
CC
stb_ds
STC
khash
M*LIB
uthash
Linear time from zero ⟶
N elements
4000000
8000000
12000000
16000000
uint32_t key, uint32_t value: Time to lookup 1000 nonexisting elements with N elements in map
std
tsl
martinus
CC
stb_ds
STC
khash
M*LIB
uthash
Linear time from zero ⟶
N elements
4000000
8000000
12000000
16000000
uint64_t key, 256-bit struct value: Time to lookup 1000 nonexisting elements with N elements in map
std
tsl
martinus
CC
stb_ds
STC
khash
M*LIB
uthash
Linear time from zero ⟶
N elements
4000000
8000000
12000000
16000000
NULL-terminated string key, uint64_t value: Time to lookup 1000 nonexisting elements with N elements in map
std
tsl
martinus
CC
stb_ds
STC
khash
M*LIB
uthash
Linear time from zero ⟶
N elements
4000000
8000000
12000000
16000000