Home
last modified time | relevance | path

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

12

/oneTBB/test/conformance/
H A Dconformance_concurrent_hash_map.cpp239 bool b = x.find(a,key); in CheckTable()
682 bool b = table.find( a, MyKey::make(i) ); in apply()
704 bool b = table.find( a, MyKey::make(i) ); in apply()
1294 bool regular_result = chmap.find(cacc, key); in test_heterogeneous_find()
1302 regular_result = chmap.find(acc, key); in test_heterogeneous_find()
1303 heterogeneous_result = chmap.find(acc, int(1)); in test_heterogeneous_find()
1314 regular_result = chmap.find(cacc, key); in test_heterogeneous_find()
1323 regular_result = chmap.find(acc, key); in test_heterogeneous_find()
1324 heterogeneous_result = chmap.find(acc, int(1)); in test_heterogeneous_find()
1467 REQUIRE(chmap.find(cacc, int(1))); in test_heterogeneous_erase()
[all …]
/oneTBB/examples/common/utility/
H A Dutility.hpp255 const char* const assign_sign = std::find(begin, end, '='); in parse()
266 args_map_type::iterator it = args_map.find(name_found); in parse()
278 args_map_type::iterator it = args_map.find(argv[j]); in parse()
287 args_map.find(positional_arg_names.at(current_positional_index)); in parse()
324 args_map_type::const_iterator argument_it = args_map.find(*it); in usage_string()
496 std::size_t colon = s.find(':'); in operator >>()
502 std::size_t second_colon = s.find(':', colon + 1); in operator >>()
/oneTBB/test/common/
H A Dconcurrent_associative_common.h112 typename Map::iterator it = cont.find( 1 );
116 it = cont.find( 1 );
538 typename T::iterator it = cont.find(1);
566 typename T::iterator it4 = cont.unsafe_erase(cont.find(2));
732 typename Container::iterator it = my_table.find(i);
1060 REQUIRE(equal(*my_c.find(Value<Table>::key(value)), value));
1061 REQUIRE(equal(*constC.find(Value<Table>::key(value)), value));
1152 REQUIRE(std::find(marks.begin(), marks.end(), false) == marks.end());
1158 REQUIRE(std::find(marks.begin(), marks.end(), false) == marks.end());
1341 REQUIRE_MESSAGE(c.find(k) == c.find(key), "Incorrect heterogeneous find return value");
[all …]
H A Dstate_trackable.h93 … StateTrackableCounters::counters.find(s) != StateTrackableCounters::counters.end()), in assign_new_state()
96 … StateTrackableCounters::counters.find(state) != StateTrackableCounters::counters.end()), in assign_new_state()
H A Dconcurrent_lru_cache_common.h73 map_iter it = my_map_ref.find(k); in operator()
239 objects_map_type::iterator it = objects_map.find(key); in is_evicted()
/oneTBB/doc/main/tbb_userguide/
H A DWindows_OS_ug.rst54 Microsoft\* Visual C++\* or Intel® C++ Compiler Classic or Intel® oneAPI DPC++/C++ Compiler to find…
59 environment variables; otherwise the compiler might not find the
H A Davoid_dynamic_node_removal.rst25 idle may lead to intermittent failures and hard to find failures, so it
H A DAdvanced_Example.rst7 An example of a more advanced associative operation is to find the index
H A DLinux_C_Dynamic_Memory_Interface_Replacement.rst40 The OS program loader must be able to find the proxy library and the
H A DThroughput_of_pipeline.rst33 fits in cache. You may have to experiment a bit to find a good window
/oneTBB/test/tbb/
H A Dtest_concurrent_hash_map.cpp135 CHECK(my_c.find( ca, value.first )); in operator ()()
149 CHECK(my_c.find( a, value.first )); in operator ()()
212 CHECK(std::find( marks.begin(), marks.end(), false ) == marks.end()); in Examine()
215 CHECK(std::find( marks.begin(), marks.end(), false ) == marks.end()); in Examine()
219 CHECK(std::find( marks.begin(), marks.end(), false ) == marks.end()); in Examine()
642 bool result = chmap.find(acc, i); in test_with_minimalistic_mutex()
665 bool result = chmap.find(acc, i); in test_with_minimalistic_mutex()
674 bool result = chmap.find(acc, i); in test_with_minimalistic_mutex()
727 result = map.find(acc, 1); in test_chmap_access_mode()
732 result = map.find(acc, 2L); in test_chmap_access_mode()
H A Dtest_arena_priorities.cpp297 end_ptr != std::find(priorities, end_ptr, p) in test()
338 auto priorities_it = std::find( end_ptr, priorities + priorities_num, priority ); in test()
/oneTBB/examples/task_group/sudoku/
H A DREADME.md21 sudoku [n-of-threads=value] [filename=value] [verbose] [silent] [find-one] [-h] [n-of-threads [file…
28 * `find-one` - stops after finding first solution.
/oneTBB/examples/common/gui/
H A DCMakeLists.txt71 message(FATAL_ERROR "Cannot find the DirectX library (required by the 'd2d' UI mode)")
93 message(FATAL_ERROR "Cannot find the Foundation library (required by the 'mac' UI mode)")
98 message(FATAL_ERROR "Cannot find the Cocoa library (required by the 'mac' UI mode)")
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_lru_cache.h130 storage_map_iterator_type map_it = my_storage_map.find(map_record_ref.first); in signal_end_of_usage_serial()
136 …__TBB_ASSERT(std::find(my_history_list.begin(), my_history_list.end(), map_it) == my_history_list.… in signal_end_of_usage_serial()
169 storage_map_iterator_type map_it = my_storage_map.find(key); in retrieve_serial()
H A Dconcurrent_unordered_map.h91 iterator where = this->find(key);
100 iterator where = this->find(key);
109 iterator where = this->find(key); in at()
118 const_iterator where = this->find(key); in at()
H A Dconcurrent_map.h113 iterator it = this->find(key); in at()
126 iterator it = this->find(key);
135 iterator it = this->find(key);
/oneTBB/examples/test_all/fibonacci/
H A Dfibonacci.cpp232 if (!Fib.find(f1, i - 1) || !Fib.find(f2, i - 2)) { in operator ()()
261 okay = Fib.find(fresult, n); in ConcurrentHashSerialFib()
/oneTBB/src/tbb/
H A Dglobal_control.cpp179 auto it = c->my_list.find(&gc); in erase_if_present()
240 auto it = c->my_list.find(&gc); in is_present()
H A Dmarket.cpp61 auto it = std::find(clients.begin(), clients.end(), &c); in unregister_and_destroy_client()
/oneTBB/cmake/android/
H A Denvironment.cmake19 message(FATAL_ERROR "Could not find adb")
/oneTBB/cmake/python/
H A Dtest_launcher.cmake21 message(FATAL_ERROR "Cannot find oneTBB Python module")
/oneTBB/examples/graph/cholesky/
H A DCMakeLists.txt28 message(FATAL_ERROR "Cannot find Intel(R) Math Kernel Library (Intel(R) MKL).")
/oneTBB/include/oneapi/tbb/detail/
H A D_concurrent_skip_list.h488 return unsafe_extract(find(key)); in unsafe_extract()
497 return unsafe_extract(find(key)); in unsafe_extract()
536 iterator find( const key_type& key ) { in find() function
540 const_iterator find( const key_type& key ) const { in find() function
545 typename std::enable_if<is_transparent<K>::value, iterator>::type find( const K& key ) { in find() function
550 …typename std::enable_if<is_transparent<K>::value, const_iterator>::type find( const K& key ) const… in find() function
564 return find(key) != end(); in contains()
569 return find(key) != end(); in contains()
H A D_concurrent_unordered_base.h533 iterator item = find(key); in unsafe_extract()
543 iterator item = find(key); in unsafe_extract()
548 iterator find( const key_type& key ) { in find() function
553 const_iterator find( const key_type& key ) const { in find() function
559 typename std::enable_if<is_transparent<K>::value, iterator>::type find( const K& key ) { in find() function
565 …typename std::enable_if<is_transparent<K>::value, const_iterator>::type find( const K& key ) const… in find() function
602 return find(key) != end(); in contains()
607 return find(key) != end(); in contains()

12