Home
last modified time | relevance | path

Searched refs:hash (Results 1 – 25 of 29) sorted by relevance

12

/oneTBB/test/tbb/
H A Dtest_concurrent_unordered_set.cpp36 using set_type = tbb::concurrent_unordered_set<int, std::hash<int>, std::equal_to<int>, MyAllocator…
37 using multiset_type = tbb::concurrent_unordered_multiset<int, std::hash<int>, std::equal_to<int>, M…
42 using checked_multiset_type = tbb::concurrent_unordered_multiset<CheckType<int>, std::hash<CheckTyp…
44 using checked_state_set_type = tbb::concurrent_unordered_set<FooWithAssign, std::hash<FooWithAssign…
46 using checked_state_multiset_type = tbb::concurrent_unordered_multiset<FooWithAssign, std::hash<Foo…
51 …using container_type = tbb::concurrent_unordered_set<T, std::hash<T>, std::equal_to<T>, Allocator>;
61 …using container_type = tbb::concurrent_unordered_multiset<T, std::hash<T>, std::equal_to<T>, Alloc…
72 …TypeTester<DefCtorPresent, tbb::concurrent_unordered_set<ValueType, std::hash<ValueType>, utils::I… in check()
73 …TypeTester<DefCtorPresent, tbb::concurrent_unordered_multiset<ValueType, std::hash<ValueType>, uti… in check()
193 …using not_always_equal_alloc_set_type = tbb::concurrent_unordered_set<int, std::hash<int>, std::eq…
[all …]
H A Dtest_concurrent_unordered_map.cpp36 using map_type = tbb::concurrent_unordered_map<int, int, std::hash<int>, std::equal_to<int>, MyAllo…
37 using multimap_type = tbb::concurrent_unordered_multimap<int, int, std::hash<int>, std::equal_to<in…
41 using checked_map_type = tbb::concurrent_unordered_map<int, CheckType<int>, std::hash<int>, std::eq…
43 using checked_state_map_type = tbb::concurrent_unordered_map<intptr_t, FooWithAssign, std::hash<int…
45 …te_multimap_type = tbb::concurrent_unordered_multimap<intptr_t, FooWithAssign, std::hash<intptr_t>,
50 …using container_type = tbb::concurrent_unordered_map<T, T, std::hash<T>, std::equal_to<T>, Allocat…
60 …using container_type = tbb::concurrent_unordered_multimap<T, T, std::hash<T>, std::equal_to<T>, Al…
84 using table_type = GeneralTableType<Key, Mapped, std::hash<Key>, utils::IsEqual>;
202 …using not_always_equal_alloc_map_type = tbb::concurrent_unordered_map<int, int, std::hash<int>, st…
209 …using not_always_equal_alloc_mmap_type = tbb::concurrent_unordered_multimap<int, int, std::hash<in…
[all …]
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
380 return my_hash_compare.hash(key.value()); in hash()
496 size_t hash( const T& k ) const { in hash() function
499 std::hash<T> my_hash_func;
688 std::size_t hash(const T&) const { return 0; } in hash() function
/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() argument
74 std::size_t hash( const Key& a ) const { return my_hash_func(a); } in hash() function
85 std::hash<Key> my_hash_func;
96 { hc.hash(key1) } -> std::same_as<std::size_t>; in requires()
110 struct hash<std::pair<T, U>> {
117 std::hash<T> first_hash;
118 std::hash<U> second_hash;
125 struct hash<std::basic_string<CharT, Traits, Allocator>> {
138 std::hash<CharT> char_hash;
H A D_concurrent_unordered_base.h242 explicit concurrent_unordered_base( size_type bucket_count, const hasher& hash = hasher(),
247 my_hash_compare(hash, equal),
257 : concurrent_unordered_base(bucket_count, hash, key_equal(), alloc) {} in concurrent_unordered_base()
266 : concurrent_unordered_base(bucket_count, hash, equal, alloc) in concurrent_unordered_base() argument
279 : concurrent_unordered_base(first, last, bucket_count, hash, key_equal(), alloc) {} in concurrent_unordered_base()
338 : concurrent_unordered_base(init.begin(), init.end(), bucket_count, hash, equal, alloc) {}
346 : concurrent_unordered_base(init, bucket_count, hash, key_equal(), alloc) {} in concurrent_unordered_base()
1444 static constexpr sokey_type split_order_key_regular( sokey_type hash ) { in split_order_key_regular() argument
1445 return reverse_bits(hash) | 0x1; in split_order_key_regular()
1449 static constexpr sokey_type split_order_key_dummy( sokey_type hash ) { in split_order_key_dummy() argument
[all …]
H A D_flow_graph_tagged_buffer_impl.h133 size_t h = this->hash(tbb::detail::invoke(*my_key, v)) & l_mask; in internal_insert_with_key()
216 size_t i = this->hash(k) & mask(); in find_ref_with_key()
239 size_t h = this->hash(k) & mask(); in delete_with_key()
/oneTBB/doc/main/tbb_userguide/
H A DMore_on_HashCompare.rst30 size_t h = ...compute hash code for f...
39 - A method ``hash`` that maps a ``Key`` to a ``size_t``
46 equal, then they must hash to the same value*, otherwise the hash table
49 each key should hash to a different value, or at least the probability
70 size_t hash(const string& x) const {
H A Dconcurrent_hash_map.rst7 A ``concurrent_hash_map<Key, T, HashCompare >`` is a hash table that
9 ``T``. The traits type HashCompare defines how to hash a key and how to
33 static size_t hash( const string& x ) {
46 // A concurrent hash table that maps strings to ints.
/oneTBB/test/conformance/
H A Dconformance_concurrent_unordered_set.cpp38 using set_type = oneapi::tbb::concurrent_unordered_set<int, std::hash<int>, std::equal_to<int>, All…
39 using multiset_type = oneapi::tbb::concurrent_unordered_multiset<int, std::hash<int>, std::equal_to…
44 static_assert(std::is_same<typename default_container_type::hasher, std::hash<int>>::value, in test_member_types()
111 …using container_type = oneapi::tbb::concurrent_unordered_set<T, std::hash<T>, std::equal_to<T>, Al…
121 …using container_type = oneapi::tbb::concurrent_unordered_multiset<T, std::hash<T>, std::equal_to<T…
159 static_assert(std::is_same<decltype(s5), TSet<ComplexType, std::hash<ComplexType>, in test_deduction_guides()
187 static_assert(std::is_same<decltype(s11), TSet<ComplexType, std::hash<ComplexType>, in test_deduction_guides()
191 TSet s12(l, 5, std::hash<ComplexType>(), custom_allocator_type{}); in test_deduction_guides()
192 static_assert(std::is_same<decltype(s12), TSet<ComplexType, std::hash<ComplexType>, in test_deduction_guides()
H A Dconformance_concurrent_unordered_map.cpp37 using map_type = oneapi::tbb::concurrent_unordered_map<int, int, std::hash<int>, std::equal_to<int>…
38 using multimap_type = oneapi::tbb::concurrent_unordered_multimap<int, int, std::hash<int>, std::equ…
57 static_assert(std::is_same<typename default_container_type::hasher, std::hash<int>>::value, in test_member_types()
158 static_assert(std::is_same<decltype(m5), TMap<int, std::string, std::hash<int>, in test_deduction_guides()
189 static_assert(std::is_same<decltype(m12), TMap<int, std::string, std::hash<int>, in test_deduction_guides()
226 …using container_type = oneapi::tbb::concurrent_unordered_map<T, T, std::hash<T>, std::equal_to<T>,…
236 …using container_type = oneapi::tbb::concurrent_unordered_multimap<T, T, std::hash<T>, std::equal_t…
H A Dconformance_join_node.cpp202 std::size_t hash(const KeyType &k) const { in hash() function
207 return hash(k1) == hash(k2); in equal()
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
576 std::hash<T> my_hash_func;
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
1266 std::hash<int> my_hash_object;
/oneTBB/test/common/
H A Dcontainers_common.h68 struct hash<NonMovableObject> {
155 struct hash<std::reference_wrapper<T>> {
158 return std::hash<type>()(wr.get());
163 struct hash<std::weak_ptr<T>> {
165 return std::hash<T>()(*wr.lock().get());
171 struct hash<ThrowOnCopy> {
H A Dtest_comparisons.h142 friend struct std::hash<TwoWayComparable>;
253 struct hash<comparisons_testing::TwoWayComparable> {
255 return std::hash<std::size_t>{}(val.n);
H A Dcommon_arena_constraints.h493 …return (std::hash<int>{}(c.numa_id) ^ std::hash<int>{}(c.core_type) ^ std::hash<int>{}(c.max_threa… in operator()
H A Dchecktype.h117 struct hash<CheckType<Counter>> {
H A Dconcurrent_associative_common.h986 struct hash<test::unique_ptr<T>> {
988 return std::hash<std::unique_ptr<T>>{}(ptr);
1293 size_t operator()(const T& key) const { return hash(key); }
1299 size_t hash(const int& key) const { return (first_factor * key + second_factor) % prime; }
1301 …size_t hash(const int_key& key) const { return (first_factor * key.my_item + second_factor) % prim…
1303 size_t hash(const std::string& key) const {
1311 size_t hash(const char_key& key) const {
1470 struct hash<CountingKey> {
H A Ddoctest.h4214 unsigned long long hash(unsigned long long a, unsigned long long b) {
4220 unsigned long long hash(const char* str) {
4221 unsigned long long hash = 5381;
4224 hash = ((hash << 5) + hash) + c; // hash * 33 + c
4225 return hash;
4228 unsigned long long hash(const SubcaseSignature& sig) {
4229 return hash(hash(hash(sig.m_file), hash(sig.m_name.c_str())), sig.m_line);
4236 running = hash(running, hash(*it));
4241 unsigned long long hash(const std::vector<SubcaseSignature>& sigs) {
4244 running = hash(running, hash(sig));
[all …]
H A Dcontainer_move_support.h845 struct hash<move_support_tests::Foo> {
852 struct hash<move_support_tests::FooWithAssign> {
854 return std::hash<move_support_tests::Foo>{}(f);
H A Dcustom_allocators.h496 struct hash<AllocatorAwareData<Allocator>> {
498 return std::hash<int>()(obj.value());
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_unordered_set.h44 template <typename Key, typename Hash = std::hash<Key>, typename KeyEqual = std::equal_to<Key>,
111 typename Hash = std::hash<iterator_value_t<It>>,
123 typename Hash = std::hash<T>,
138 -> concurrent_unordered_set<iterator_value_t<It>, std::hash<iterator_value_t<It>>,
152 -> concurrent_unordered_set<T, std::hash<T>, std::equal_to<T>, Alloc>;
157 -> concurrent_unordered_set<T, std::hash<T>, std::equal_to<T>, Alloc>;
249 typename Hash = std::hash<iterator_value_t<It>>,
261 typename Hash = std::hash<T>,
276 -> concurrent_unordered_multiset<iterator_value_t<It>, std::hash<iterator_value_t<It>>,
290 -> concurrent_unordered_multiset<T, std::hash<T>, std::equal_to<T>, Alloc>;
[all …]
H A Dconcurrent_unordered_map.h45 template <typename Key, typename T, typename Hash = std::hash<Key>, typename KeyEqual = std::equal_…
163 typename Hash = std::hash<iterator_key_t<It>>,
176 typename Hash = std::hash<std::remove_const_t<Key>>,
192 std::hash<iterator_key_t<It>>,
209 -> concurrent_unordered_map<std::remove_const_t<Key>, T, std::hash<std::remove_const_t<Key>>,
215 -> concurrent_unordered_map<std::remove_const_t<Key>, T, std::hash<std::remove_const_t<Key>>,
325 typename Hash = std::hash<iterator_key_t<It>>,
337 typename Hash = std::hash<std::remove_const_t<Key>>,
353 std::hash<iterator_key_t<It>>,
368 -> concurrent_unordered_multimap<std::remove_const_t<Key>, T, std::hash<std::remove_const_t<Key>>,
[all …]
H A Dconcurrent_hash_map.h732 bucket_accessor b_old( this, hash & mask ); in __TBB_requires()
735 __TBB_ASSERT( (mask&(mask+1))==0 && (hash & mask) == hash, nullptr ); in __TBB_requires()
742 if ((curr_node_hash & mask) == hash) { in __TBB_requires()
1278 hashcode_type const h = my_hash_compare.hash( key ); in __TBB_requires()
1384 hashcode_type const hash = item_accessor.my_hash; in __TBB_requires() local
1398 if (this->check_mask_race(hash, mask)) in __TBB_requires()
1426 hashcode_type const hash = my_hash_compare.hash(key); in __TBB_requires() local
1431 bucket_accessor b( this, hash & mask ); in __TBB_requires()
1441 if (this->check_mask_race(hash, mask)) in __TBB_requires()
1469 hashcode_type h = my_hash_compare.hash( key ); in __TBB_requires()
[all …]
/oneTBB/examples/concurrent_hash_map/count_strings/
H A Dcount_strings.cpp30 class hash<std::basic_string<CharT, Traits, Allocator>> { class
44 std::hash<CharT> char_hash;
110 hashes[std::hash<MyString>()(i->first) & 0xFFFF]++; in CountOccurrences()

12