MCPcopy Create free account

hub / github.com/Tessil/robin-map / types & classes

Types & classes38 in github.com/Tessil/robin-map

⨍ Functions 223◇ Types & classes 38
↓ 23 callersClassmove_only_test
tests/utils.h:128
↓ 10 callersClassserializer
* serializer helper to test serialize(...) and deserialize(...) functions */
tests/utils.h:349
↓ 9 callersClassKeySelect
include/tsl/robin_set.h:95
↓ 2 callersClasscopy_only_test
tests/utils.h:182
↓ 2 callersClassself_reference_member_test
tests/utils.h:70
ClassKeySelect
include/tsl/robin_map.h:96
ClassValueSelect
include/tsl/robin_map.h:110
Classbucket_entry
include/tsl/robin_hash.h:164
Classbucket_entry_hash
include/tsl/robin_hash.h:117
Classbucket_entry_hash<true>
include/tsl/robin_hash.h:128
Classcustom_allocator
tests/custom_allocator_tests.cpp:40
Classdeserializer
tests/utils.h:387
Classequal_to_ptr
tests/robin_map_tests.cpp:1275
Classhas_is_transparent
include/tsl/robin_hash.h:55
Classhas_is_transparent<T, typename make_void<typename T::is_transparent>::type>
include/tsl/robin_hash.h:58
Classhash
Use a KeyEqual and Hash where any odd unsigned number 'x' is equal to 'x-1'. Make sure that KeyEqual is called (and not ==).
tests/robin_map_tests.cpp:1223
Classhash<copy_only_test>
tests/utils.h:238
Classhash<move_only_test>
tests/utils.h:231
Classhash<self_reference_member_test>
tests/utils.h:224
Classhash_ptr
tests/robin_map_tests.cpp:1260
Classhash_str_diff
insert x values; serialize map; deserialize in new map which has a different hash; check equal
tests/robin_map_tests.cpp:1188
Classidentity_hash
tests/utils.h:54
Classis_pair
tests/utils.h:341
Classis_pair<std::pair<T1, T2>>
tests/utils.h:344
Classis_power_of_two_policy
include/tsl/robin_hash.h:63
Classis_power_of_two_policy<tsl::rh::power_of_two_growth_policy<GrowthFactor>>
include/tsl/robin_hash.h:66
Classkey_equal
tests/robin_map_tests.cpp:1233
Classmake_void
include/tsl/robin_hash.h:50
Classmod_growth_policy
include/tsl/robin_growth_policy.h:190
Classmod_hash
tests/utils.h:62
Classpower_of_two_growth_policy
include/tsl/robin_growth_policy.h:95
Classprime_growth_policy
* Grow the hash table by using prime numbers as bucket count. Slower than * tsl::rh::power_of_two_growth_policy in general but will probably distribu
include/tsl/robin_growth_policy.h:368
Classrebind
tests/custom_allocator_tests.cpp:52
Classrobin_hash
include/tsl/robin_hash.h:348
Classrobin_iterator
include/tsl/robin_hash.h:362
Classrobin_map
include/tsl/robin_map.h:91
Classrobin_set
include/tsl/robin_set.h:90
Classutils
tests/utils.h:245