Home
last modified time | relevance | path

Searched defs:hash (Results 1 – 10 of 10) sorted by relevance

/oneTBB/include/oneapi/tbb/detail/
H A D_hash_compare.h36 hash_compare( hasher hash, key_equal equal ) : my_hasher(hash), my_equal(equal) {} in hash_compare()
74 std::size_t hash( const Key& a ) const { return my_hash_func(a); } in hash() function
H A D_concurrent_unordered_base.h256 …concurrent_unordered_base( size_type bucket_count, const hasher& hash, const allocator_type& alloc… in concurrent_unordered_base()
266 : concurrent_unordered_base(bucket_count, hash, equal, alloc) in concurrent_unordered_base() argument
278 … size_type bucket_count, const hasher& hash, const allocator_type& alloc ) in concurrent_unordered_base()
345 … size_type bucket_count, const hasher& hash, const allocator_type& alloc ) in concurrent_unordered_base()
1444 static constexpr sokey_type split_order_key_regular( sokey_type hash ) { in split_order_key_regular()
1449 static constexpr sokey_type split_order_key_dummy( sokey_type hash ) { in split_order_key_dummy()
/oneTBB/test/tbb/
H A Dtest_join_node_preview.cpp47 std::size_t hash(msg_t) const { return 0; } in jn_follows_and_precedes() function in jn_follows_and_precedes::hash_compare
H A Dtest_concurrent_hash_map.cpp379 size_t hash(const AllocatorAwareData<Allocator>& key) const { in hash() function
496 size_t hash( const T& k ) const { in hash() function
688 std::size_t hash(const T&) const { return 0; } in hash() function
/oneTBB/test/conformance/
H A Dconformance_join_node.cpp202 std::size_t hash(const KeyType &k) const { in hash() function
H A Dconformance_concurrent_hash_map.cpp163 std::size_t hash( const MyKey& k ) const { in hash() function in MyHashCompare
174 std::size_t hash( const MyKey& ) const { in hash() function in YourHashCompare
573 size_t hash( const T& k ) const { in hash() function
1239 std::size_t hash( const HeterogeneousKey<IsConstructible>& key ) const { in hash() function
1243 std::size_t hash( const int& key ) const { in hash() function
/oneTBB/examples/concurrent_hash_map/count_strings/
H A Dcount_strings.cpp30 class hash<std::basic_string<CharT, Traits, Allocator>> { class
/oneTBB/test/common/
H A Dconcepts_common.h428 std::size_t hash( const Key& ) const requires (EnableHash == State::correct) { return 0; } in hash() function
429 std::size_t hash( const Key& ) requires (EnableHash == State::incorrect_constness) { return 0; } in hash() function
430 …std::size_t hash( Dummy ) const requires (EnableHash == State::incorrect_first_input) { return 0; } in hash() function
431 …Dummy hash( const Key& ) const requires (EnableHash == State::incorrect_return_type) { return Dumm… in hash() function
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_hash_map.h1384 hashcode_type const hash = item_accessor.my_hash; in __TBB_requires() local
1426 hashcode_type const hash = my_hash_compare.hash(key); in __TBB_requires() local
/oneTBB/examples/test_all/fibonacci/
H A Dfibonacci.cpp214 std::size_t hash(const int k) const { in hash() function