Home
last modified time | relevance | path

Searched refs:key (Results 1 – 25 of 48) sorted by relevance

12

/oneTBB/include/oneapi/tbb/detail/
H A D_concurrent_skip_list.h466 return internal_erase(key); in unsafe_erase()
475 return internal_erase(key); in unsafe_erase()
488 return unsafe_extract(find(key)); in unsafe_extract()
497 return unsafe_extract(find(key)); in unsafe_extract()
555 return internal_count(key); in count()
560 return internal_count(key); in count()
564 return find(key) != end(); in contains()
569 return find(key) != end(); in contains()
644 return internal_equal_range(key); in equal_range()
781 return allow_multimapping ? internal_find_multi(key) : internal_find_unique(key); in internal_find()
[all …]
H A D_concurrent_unordered_base.h131 list_node(sokey_type key) : my_next(nullptr), my_order_key(key) {} in list_node() argument
133 void init( sokey_type key ) { in init() argument
134 my_order_key = key; in init()
510 return internal_erase_by_key(key); in unsafe_erase()
519 return internal_erase_by_key(key); in unsafe_erase()
533 iterator item = find(key); in unsafe_extract()
543 iterator item = find(key); in unsafe_extract()
593 return internal_count(key); in count()
598 return internal_count(key); in count()
602 return find(key) != end(); in contains()
[all …]
H A D_hash_compare.h38 std::size_t operator()( const Key& key ) const { in operator()
39 return std::size_t(my_hasher(key)); in operator()
47 std::size_t operator()( const K& key ) const { in operator()
48 return std::size_t(my_hasher(key)); in operator()
/oneTBB/examples/parallel_for/seismic/
H A Dseismic_video.cpp24 void SeismicVideo::on_mouse(int x, int y, int key) { in on_mouse() argument
25 if (key == 1) { in on_mouse()
30 void SeismicVideo::on_key(int key) { in on_key() argument
31 key &= 0xff; in on_key()
32 if (char(key) == ' ') in on_key() local
34 else if (char(key) == 'p') in on_key() local
36 else if (char(key) == 's') in on_key() local
38 else if (char(key) == 'e') in on_key() local
40 else if (char(key) == 'd') in on_key() local
42 else if (key == 27) in on_key()
H A Dseismic_video.hpp39 void on_mouse(int x, int y, int key);
45 void on_key(int key);
/oneTBB/test/common/
H A Dnode_handling_support.h33 return node.key() == value.first && node.mapped() == value.second; in compare_handle_getters()
43 node.key() = value.first; in set_node_handle_value()
255 auto key = Value<Container>::key(expected_value); in test_extract() local
256 auto count = table_for_extract.count(key); in test_extract()
258 nh = table_for_extract.unsafe_extract(key); in test_extract()
265 auto key2 = Value<Container>::key(expected_value2); in test_extract()
278 test_extract(container, Value<Container>::key(new_value)); in test_node_handling()
312 table1.unsafe_extract(Value<Container1>::key(it)); in test_merge_basic()
380 if (!table.contains(Value<SrcTableType>::key(it))) { in check_concurrent_merge()
392 if (dst_table.contains(Value<SrcTableType>::key(it)) && in check_concurrent_merge()
[all …]
H A Dconcurrent_ordered_common.h50 … return !val_comp(rhs, lhs) && !key_comp(Value<Container>::key(rhs), Value<Container>::key(lhs)); in operator()
51 … return val_comp(lhs, rhs) && key_comp(Value<Container>::key(lhs), Value<Container>::key(rhs)); in operator()
86 for (int key = -1; key < random_threshold + 1; ++key) { in test_ordered_methods() local
87 auto eq_range = cont.equal_range(key); in test_ordered_methods()
99 if (val_comp(Value<Container>::make(key), *it) && u_bound_check == cont.end()) { in test_ordered_methods()
110 typename Container::iterator l_bound = cont.lower_bound(key); in test_ordered_methods()
111 typename Container::iterator u_bound = cont.upper_bound(key); in test_ordered_methods()
117 const_iterator cl_bound = ccont.lower_bound(key); in test_ordered_methods()
118 const_iterator cu_bound = ccont.upper_bound(key); in test_ordered_methods()
188 if (!c.contains(Value<OrderedType>::key((*it)))) return false; in equal()
[all …]
H A Dconcurrent_associative_common.h59 static Value make( const Key& key ) { return Value(key, key); } in make()
60 static Value make( const Key& key, const Key& mapped ) { return Value(key, mapped); } in make()
75 static Key make( const Key& key ) { return key; }
76 static Key make( const Key& key, const Key& ) { return key; }
1293 size_t operator()(const T& key) const { return hash(key); }
1305 for (auto it = key.begin(); it != key.end(); ++it) {
1340 int key = i;
1408 std::string key = *it;
1446 std::string key = *it;
1481 int key;
[all …]
H A Dconcurrent_lru_cache_common.h181 static std::string callback(std::string key) { return key; } in callback()
238 bool is_evicted(std::size_t key) { in is_evicted()
239 objects_map_type::iterator it = objects_map.find(key); in is_evicted()
/oneTBB/examples/parallel_for/tachyon/src/
H A Dtachyon_video.cpp88 void tachyon_video::on_key(int key) { in on_key() argument
89 key &= 0xff; in on_key()
91 if (key == esc_key) in on_key()
93 else if (key == ' ') { in on_key()
101 else if (key == 'p') { in on_key()
/oneTBB/doc/main/tbb_userguide/
H A DUpgradeDowngrade.rst19 void AddKeyIfMissing( const string& key ) {
24 if( MyVector[i]==key ) return;
26 // Check if key was added while lock was temporarily released
28 if(MyVector[i]==key ) return;
29 vector.push_back(key);
40 check that the key was not inserted by another writer. The example
44 originally searched. The key point to remember is that when
H A Dconcurrent_hash_map.rst8 permits concurrent accesses. The table is a map from a key to a type
9 ``T``. The traits type HashCompare defines how to hash a key and how to
93 up that key in the table block until the ``accessor`` is done. A
124 The method ``remove(key)`` can also operate concurrently. It implicitly
125 requests write access. Therefore before removing the key, it waits on
126 any other extant accesses on ``key``.
/oneTBB/examples/task_arena/fractal/
H A Dfractal_video.hpp31 void on_mouse(int x, int y, int key) { in on_mouse() argument
32 if (key == 1) { in on_mouse()
40 void on_key(int key) { in on_key() argument
41 switch (key & 0xff) { in on_key()
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_hash_map.h677 return create_node(allocator, key, *t); in __TBB_requires()
1052 …std::pair<iterator, iterator> equal_range( const Key& key ) { return internal_equal_range( key, en… in __TBB_requires()
1058 return internal_equal_range(key, end()); in __TBB_requires()
1097 size_type count( const Key &key ) const { in __TBB_requires()
1238 bool erase( const Key &key ) { in __TBB_requires()
1239 return internal_erase(key); in __TBB_requires()
1245 return internal_erase(key); in __TBB_requires()
1289 n = search_bucket( key, b() ); in __TBB_requires()
1424 bool internal_erase( const K& key ) { in __TBB_requires()
1478 node *n = search_bucket( key, b ); in __TBB_requires()
[all …]
H A Dconcurrent_lru_cache.h98 handle operator[](key_type key) {
99 retrieve_aggregator_operation op(key);
103 op.result().second.my_value = my_value_function(key);
168 storage_map_reference_type retrieve_serial(key_type key, bool& is_new_value_needed) { in retrieve_serial() argument
169 storage_map_iterator_type map_it = my_storage_map.find(key); in retrieve_serial()
173 …map_it, std::piecewise_construct, std::make_tuple(key), std::make_tuple(value_type(), 0, my_histor… in retrieve_serial()
326 retrieve_aggregator_operation(key_type key)
328 my_key(key), my_map_record_ptr(nullptr), my_is_new_value_needed(false) {}
H A Dprofiling.h82 string_resource_index key, const char* value);
84 string_resource_index key, void* value);
158 string_resource_index key, const char *value ) { in itt_metadata_str_add() argument
159 r1::itt_metadata_str_add( domain, addr, addr_extra, key, value ); in itt_metadata_str_add()
163 string_resource_index key, void *value) { in register_node_addr() argument
164 r1::itt_metadata_ptr_add(domain, addr, addr_extra, key, value); in register_node_addr()
H A Dconcurrent_map.h112 mapped_type& at(const key_type& key) { in at() argument
113 iterator it = this->find(key); in at()
121 const mapped_type& at(const key_type& key) const { in at() argument
122 return const_cast<concurrent_map*>(this)->at(key); in at()
125 mapped_type& operator[](const key_type& key) {
126 iterator it = this->find(key);
129 … it = this->emplace(std::piecewise_construct, std::forward_as_tuple(key), std::tuple<>()).first;
134 mapped_type& operator[](key_type&& key) {
135 iterator it = this->find(key);
138 …it = this->emplace(std::piecewise_construct, std::forward_as_tuple(std::move(key)), std::tuple<>()…
H A Dconcurrent_unordered_map.h90 mapped_type& operator[]( const key_type& key ) {
91 iterator where = this->find(key);
94 … where = this->emplace(std::piecewise_construct, std::forward_as_tuple(key), std::tuple<>()).first;
99 mapped_type& operator[]( key_type&& key ) {
100 iterator where = this->find(key);
103 …where = this->emplace(std::piecewise_construct, std::forward_as_tuple(std::move(key)), std::tuple<…
108 mapped_type& at( const key_type& key ) { in at() argument
109 iterator where = this->find(key); in at()
117 const mapped_type& at( const key_type& key ) const { in at() argument
118 const_iterator where = this->find(key); in at()
/oneTBB/test/conformance/
H A Dconformance_concurrent_hash_map.cpp46 int key; member in MyKey
55 result.key = i; in make()
160 return j.key==k.key; in equal()
164 return k.key; in hash()
171 return j.key==k.key; in equal()
225 bool b = x.insert(a,key); in FillTable()
239 bool b = x.find(a,key); in CheckTable()
407 CHECK(t2.erase(key)); in TestIteratorsAndRanges()
409 CHECK(t2.insert(a, key)); in TestIteratorsAndRanges()
1217 HeterogeneousKey(int key) : my_key(key) { ++heterogeneous_keys_count; } in HeterogeneousKey() argument
[all …]
H A Dconformance_concurrent_lru_cache.cpp38 auto callback = [](int key) -> int { return key; }; in __anon425d1b900102() argument
/oneTBB/doc/main/reference/
H A Dtype_specified_message_keys.rst16 The extension allows a key matching ``join_node`` to obtain keys via functions associated with
42 ``key_from_message`` function for each incoming message to obtain the key associated
52 return t.key();
59 used to construct the ``join_node``, and ``K`` is the key type
61 By default, the ``key()`` method defined in the message class will be called.
H A Dconcurrent_lru_cache_cls.rst19 to limit the number of stored unused values. For each key, there is at most one item
32 When no item is found for a given key, the container calls the user-specified
33 ``value_function_type`` object to construct a value for the key, and stores that value.
81 handle operator[]( key_type key );
107 **Effects**: Searches the container for an item that corresponds to the given key.
/oneTBB/test/tbbmalloc/
H A Dtest_malloc_init_shutdown.cpp137 pthread_key_t key; in operator ()() local
144 pthread_key_create( &key, &threadDtor ); in operator ()()
145 pthread_setspecific(key, (const void*)this); in operator ()()
/oneTBB/src/tbb/tools_api/
H A Dittnotify_static.h220 …__itt_id id, __itt_string_handle *key, __itt_metadata_type type, size_t count, void *data), (ITT_F…
222 …domain, __itt_id id, __itt_string_handle *key, const char* data, size_t length), (ITT_FORMAT do…
223 …domain, __itt_id id, __itt_string_handle *key, const wchar_t* data, size_t length), (ITT_FORMAT do…
225 …domain, __itt_id id, __itt_string_handle *key, const char* data, size_t length), (ITT_FORMAT do…
340 …ope scope, __itt_string_handle *key, __itt_metadata_type type, size_t count, void *data), (ITT_FOR…
342 …__itt_scope scope, __itt_string_handle *key, const char *data, size_t length), (ITT_FORMAT doma…
343 …__itt_scope scope, __itt_string_handle *key, const wchar_t *data, size_t length), (ITT_FORMAT doma…
345 …__itt_scope scope, __itt_string_handle *key, const char *data, size_t length), (ITT_FORMAT doma…
/oneTBB/src/tbb/
H A Dprofiling.cpp155 string_resource_index key, const char *value ) { in itt_metadata_str_add() argument
159 __itt_string_handle *k = ITT_get_string_handle(key); in itt_metadata_str_add()
170 string_resource_index key, void *value ) { in itt_metadata_ptr_add() argument
174 __itt_string_handle *k = ITT_get_string_handle(key); in itt_metadata_ptr_add()

12