Home
last modified time | relevance | path

Searched refs:Key (Results 1 – 25 of 28) sorted by relevance

12

/oneTBB/include/oneapi/tbb/
H A Dconcurrent_unordered_map.h31 using value_type = std::pair<const Key, T>;
32 using key_type = Key;
45 template <typename Key, typename T, typename Hash = std::hash<Key>, typename KeyEqual = std::equal_…
175 template <typename Key, typename T,
206 template <typename Key, typename T, typename Alloc,
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>>,
244 template <typename Key, typename T, typename Hash = std::hash<Key>, typename KeyEqual = std::equal_…
336 template <typename Key, typename T,
368 -> concurrent_unordered_multimap<std::remove_const_t<Key>, T, std::hash<std::remove_const_t<Key>>,
[all …]
H A Dconcurrent_set.h34 using key_type = Key;
54 template <typename Key, typename Compare = std::less<Key>, typename Allocator = tbb::tbb_allocator<…
58 using key_type = Key;
126 template <typename Key,
132 -> concurrent_set<Key, Comp, Alloc>;
141 template <typename Key, typename Alloc,
144 -> concurrent_set<Key, std::less<Key>, Alloc>;
155 template <typename Key, typename Compare = std::less<Key>, typename Allocator = tbb::tbb_allocator<…
159 using key_type = Key;
227 template <typename Key,
[all …]
H A Dconcurrent_map.h36 using key_type = Key;
70 template <typename Key, typename Value, typename Compare = std::less<Key>, typename Allocator = tbb…
74 using key_type = Key;
191 template <typename Key, typename T,
206 template <typename Key, typename T, typename Alloc,
209 -> concurrent_map<std::remove_const_t<Key>, T, std::less<std::remove_const_t<Key>>, Alloc>;
220 template <typename Key, typename Value, typename Compare = std::less<Key>, typename Allocator = tbb…
224 using key_type = Key;
308 template <typename Key, typename T,
323 template <typename Key, typename T, typename Alloc,
[all …]
H A Dconcurrent_unordered_set.h30 using key_type = Key;
41 template <typename Key, typename Hash, typename KeyEqual, typename Allocator>
44 template <typename Key, typename Hash = std::hash<Key>, typename KeyEqual = std::equal_to<Key>,
45 typename Allocator = tbb::tbb_allocator<Key>>
177 template <typename Key, typename Hash, typename KeyEqual, typename Allocator>
178 void swap( concurrent_unordered_set<Key, Hash, KeyEqual, Allocator>& lhs, in swap() argument
179 concurrent_unordered_set<Key, Hash, KeyEqual, Allocator>& rhs ) { in swap()
183 template <typename Key, typename Hash = std::hash<Key>, typename KeyEqual = std::equal_to<Key>,
184 typename Allocator = tbb::tbb_allocator<Key>>
315 template <typename Key, typename Hash, typename KeyEqual, typename Allocator>
[all …]
H A Dconcurrent_hash_map.h572 template <typename Key, typename T,
604 using key_type = Key; in __TBB_requires()
610 using value_type = std::pair<const Key, T>; in __TBB_requires()
684 template <typename K = Key> in __TBB_requires()
1097 size_type count( const Key &key ) const { in __TBB_requires()
1116 bool find( accessor &result, const Key &key ) { in __TBB_requires()
1238 bool erase( const Key &key ) { in __TBB_requires()
1616 template <typename Key, typename T,
1624 template <typename Key, typename T, typename Alloc,
1627 -> concurrent_hash_map<std::remove_const_t<Key>, T, d1::tbb_hash_compare<std::remove_const_t<Key>>,…
[all …]
/oneTBB/include/oneapi/tbb/detail/
H A D_hash_compare.h28 template <typename Key, typename Hash, typename KeyEqual>
30 using is_transparent_hash = has_transparent_key_equal<Key, Hash, KeyEqual>;
38 std::size_t operator()( const Key& key ) const { in operator()
42 bool operator()( const Key& key1, const Key& key2 ) const { in operator()
71 template <typename Key>
74 std::size_t hash( const Key& a ) const { return my_hash_func(a); } in hash()
80 bool equal( const Key& a, const Key& b ) const { return my_key_equal(a, b); } in equal()
85 std::hash<Key> my_hash_func;
86 std::equal_to<Key> my_key_equal;
93 template <typename HashCompare, typename Key>
[all …]
H A D_node_handle.h105 template<typename Key, typename Value, typename Node, typename Allocator>
109 using key_type = Key;
132 template<typename Key, typename Node, typename Allocator>
133 class node_handle<Key, Key, Node, Allocator> : public node_handle_base<Key, Node, Allocator> {
134 using base_type = node_handle_base<Key, Node, Allocator>;
136 using value_type = Key;
152 template <typename Key, typename Value, typename Node, typename Allocator>
153 void swap( node_handle<Key, Value, Node, Allocator>& lhs, in swap() argument
154 node_handle<Key, Value, Node, Allocator>& rhs ) { in swap()
H A D_containers_helpers.h36 template <typename Key, typename Hasher, typename KeyEqual, typename = void >
39 template <typename Key, typename Hasher, typename KeyEqual>
40 struct has_transparent_key_equal<Key, Hasher, KeyEqual, tbb::detail::void_t<typename Hasher::transp…
43 static_assert((std::is_same<KeyEqual, std::equal_to<Key>>::value ||
H A D_flow_graph_nodes_deduction.h149 template <typename Key>
151 using type = Key;
159 template <typename Key>
160 using join_key_t = typename join_key<Key>::type;
H A D_flow_graph_tagged_buffer_impl.h42 typename Key, // type of key within ValueType
58 typedef typename std::decay<Key>::type Knoref;
/oneTBB/test/tbb/
H A Dtest_concurrent_unordered_map.cpp31 template <typename Key, typename Mapped>
32 using MyAllocator = LocalCountingAllocator<std::allocator<std::pair<const Key, Mapped>>>;
83 template <template <typename...> class GeneralTableType, typename Key, typename Mapped>
84 using table_type = GeneralTableType<Key, Mapped, std::hash<Key>, utils::IsEqual>;
H A Dtest_enumerable_thread_specific.cpp281 template <typename Key, typename Val>
283 typedef typename std::map<Key, Val> my_map; in flog_segmented_iterator_map()
296 my_vec.at(i).insert(std::make_pair<Key,Val>(maxval * i + j, 2*(maxval*i + j))); in flog_segmented_iterator_map()
300 tbb::detail::d1::segmented_iterator<nested_vec, std::pair<const Key, Val> > my_si(my_vec); in flog_segmented_iterator_map()
301 Key ii; in flog_segmented_iterator_map()
308 tbb::detail::d1::segmented_iterator<nested_vec, const std::pair<const Key, Val> > my_csi(my_vec); in flog_segmented_iterator_map()
H A Dtest_concurrent_set.cpp29 template <typename Key>
30 using MyAllocator = LocalCountingAllocator<std::allocator<Key>>;
H A Dtest_concurrent_map.cpp28 template <typename Key, typename Mapped>
29 using MyAllocator = LocalCountingAllocator<std::allocator<std::pair<const Key, Mapped>>>;
H A Dtest_concurrent_hash_map.cpp853 template <bool ExpectSatisfies, typename Key, typename Mapped, typename... HCTypes>
854 …requires (... && (utils::well_formed_instantiation<tbb::concurrent_hash_map, Key, Mapped, HCTypes>…
873 template <bool ExpectSatisfies, typename Key, typename Mapped, typename... RWMutexes>
874 requires (... && (utils::well_formed_instantiation<tbb::concurrent_hash_map, Key, Mapped,
875 …tbb::tbb_hash_compare<Key>, tbb::tbb_allocator<std::pair<const Key, Mapped>>, RWMutexes> == Expect…
/oneTBB/doc/main/tbb_userguide/
H A DMore_on_HashCompare.rst14 - Let the ``HashCompare`` default to ``tbb_hash_compare<Key>`` and do
18 - Define a specialization of template ``tbb_hash_compare<Key>``.
35 In general, the definition of ``tbb_hash_compare<Key>`` or
39 - A method ``hash`` that maps a ``Key`` to a ``size_t``
H A Dconcurrent_hash_map.rst7 A ``concurrent_hash_map<Key, T, HashCompare >`` is a hash table that
87 ``std::pair<const Key,T>``. Typically, when accessing a container
/oneTBB/test/common/
H A Dconcurrent_associative_common.h56 template <typename Key, typename Value = std::pair<const Key, Key>>
58 using strip_key = typename std::remove_const<Key>::type;
60 static Value make( const Key& key, const Key& mapped ) { return Value(key, mapped); } in make()
73 template <typename Key>
74 struct ValueFactoryBase<Key, Key> {
75 static Key make( const Key& key ) { return key; }
76 static Key make( const Key& key, const Key& ) { return key; }
77 static Key key( const Key& value ) { return value; }
78 static Key get( const Key& value ) { return value; }
243 void test_rvalue_insert( Key k1, Key k2 ) {
[all …]
H A Dconcurrent_lru_cache_common.h160 template<typename Key, typename Value>
161 struct preset_default : preset_base<Key, Value> {
162 using cache_type = typename preset_base<Key, Value>::cache_type;
H A Dconcepts_common.h421 template <typename Key, bool EnableCopyCtor, bool EnableDtor, State EnableHash, State EnableEqual>
428 std::size_t hash( const Key& ) const requires (EnableHash == State::correct) { return 0; } in hash()
429 std::size_t hash( const Key& ) requires (EnableHash == State::incorrect_constness) { return 0; } in hash()
431 …Dummy hash( const Key& ) const requires (EnableHash == State::incorrect_return_type) { return Dumm… in hash()
433 …bool equal( const Key&, const Key& ) const requires (EnableEqual == State::correct) { return true;… in equal()
434 …bool equal( const Key&, const Key& ) requires (EnableEqual == State::incorrect_constness) { return… in equal()
435 …bool equal( Dummy, const Key& ) const requires (EnableEqual == State::incorrect_first_input) { ret… in equal()
437 …Dummy equal( const Key&, const Key& ) const requires (EnableEqual == State::incorrect_return_type)… in equal()
677 template <typename Input, typename Key, bool EnableCopyCtor, bool EnableDtor, State EnableFunctionC…
684 …Key operator()( const Input& ) requires (EnableFunctionCallOperator == State::correct) { return Ke… in operator()
[all …]
/oneTBB/doc/main/reference/
H A Dcustom_mutex_chmap.rst38 template <typename Key, typename T,
39 typename HashCompare = tbb_hash_compare<Key>,
40 typename Allocator = tbb_allocator<std::pair<const Key, T>>,
H A Dconcurrent_lru_cache_cls.rst53 template <typename Key, typename Value, typename ValueFunctionType = Value (*)(Key)>
56 using key_type = Key;
/oneTBB/test/conformance/
H A Dconformance_concurrent_hash_map.cpp1049 template<typename Key>
1050 struct non_default_constructible_hash_compare : oneapi::tbb::detail::d1::tbb_hash_compare<Key> {
1085 using Key = int; in TestDeductionGuides() typedef
1088 using ComplexType = std::pair<Key, Value>; in TestDeductionGuides()
1089 using ComplexTypeConst = std::pair<const Key, Value>; in TestDeductionGuides()
1091 using DefaultCompare = oneapi::tbb::detail::d1::tbb_hash_compare<Key>; in TestDeductionGuides()
1092 using Compare = debug_hash_compare<Key>; in TestDeductionGuides()
1107 static_assert(std::is_same<decltype(m2), TMap<Key, Value, Compare>>::value); in TestDeductionGuides()
1111 static_assert(std::is_same<decltype(m3), TMap<Key, Value, Compare, Allocator>>::value); in TestDeductionGuides()
1115 static_assert(std::is_same<decltype(m4), TMap<Key, Value, DefaultCompare, Allocator>>::value); in TestDeductionGuides()
[all …]
H A Dconformance_concurrent_set.cpp33 template <typename Key>
34 using Allocator = LocalCountingAllocator<std::allocator<Key>>;
H A Dconformance_concurrent_map.cpp37 template <typename Key, typename Mapped>
38 using Allocator = LocalCountingAllocator<std::allocator<std::pair<const Key, Mapped>>>;

12