| /oneTBB/test/common/ |
| H A D | concurrent_ordered_common.h | 218 c1.insert(lst.begin(), lst.end());
229 c2.insert(it, lst.end());
234 c2_alloc.insert(it, lst.end());
239 c2_comp_alloc.insert(it, lst.end());
252 c4.insert(lst.begin(), lst.end());
257 c5.insert(lst.begin(), lst.end());
262 c6.insert(lst.begin(), lst.end());
308 c.insert(Value<Container>::make(i));
333 c1.insert(Value<Container>::make(1));
336 c2.insert(Value<Container>::make(1));
[all …]
|
| H A D | node_handling_support.h | 150 table.insert(value); in generate_node_handle()
286 cont.insert(Value<Container>::make(i)); in test_node_handling_support()
290 cont.insert(Value<Container>::make(4)); in test_node_handling_support()
429 table1_1.insert(Value<Container1>::make(i)); in test_merge()
430 table1_2.insert(Value<Container1>::make(i * i)); in test_merge()
433 table1_1.insert(Value<Container1>::make(i)); in test_merge()
434 table1_2.insert(Value<Container1>::make(i * i)); in test_merge()
441 table2_1.insert(Value<Container2>::make(i)); in test_merge()
445 table2_1.insert(Value<Container2>::make(i)); in test_merge()
454 table1_3.insert(Value<Container1>::make(i)); in test_merge()
[all …]
|
| H A D | concurrent_unordered_common.h | 51 cont.insert(Value<T>::make(1)); in test_unordered_methods()
52 cont.insert(Value<T>::make(2)); in test_unordered_methods()
211 c1.insert(lst.begin(), lst.end()); in TypeTester()
221 c2.insert(it, lst.end()); in TypeTester()
227 c2_alloc.insert(it, lst.end()); in TypeTester()
233 c2_hash_alloc.insert(it, lst.end()); in TypeTester()
246 c4.insert(lst.begin(), lst.end()); in TypeTester()
293 c8.insert(it, lst.end()); in TypeTester()
329 c1.insert(Value<Container>::make(1)); in test_comparisons_basic()
332 c2.insert(Value<Container>::make(1)); in test_comparisons_basic()
[all …]
|
| H A D | concurrent_associative_common.h | 401 cont.insert(Value<T>::make(1));
402 cont.insert(Value<T>::make(2));
411 cont4.insert(Value<T>::make(1));
412 cont4.insert(Value<T>::make(2));
416 cont5.insert(Value<T>::make(1));
424 cont6.insert(value2);
571 cont.insert(Value<T>::make(3));
1215 c1.insert(value1);
1216 c2.insert(std::move(value2));
1221 c1.insert(init_list);
[all …]
|
| H A D | common_arena_constraints.h | 350 instance().memory_handler.insert(result); in allocate_empty_affinity_mask()
356 instance().memory_handler.insert(result); in allocate_current_affinity_mask()
521 results.insert(constraints{}); in generate_constraints_variety()
523 results.insert(constraints{}.set_numa_id(numa_node)); in generate_constraints_variety()
526 results.insert(constraints{}.set_core_type(core_type)); in generate_constraints_variety()
528 results.insert( in generate_constraints_variety()
535 results.insert( in generate_constraints_variety()
540 results.insert( in generate_constraints_variety()
546 results.insert( in generate_constraints_variety()
552 results.insert( in generate_constraints_variety()
|
| H A D | allocator_stl_test_common.h | 45 s.insert(value_type(3 * i)); in TestSet()
56 m.insert(value_type(i,i*i)); in TestMap()
|
| H A D | initializer_list_support.h | 62 cont.insert(init); in test()
|
| H A D | utils.h | 446 alive_objects.insert(this);
450 alive_objects.insert(this);
454 alive_objects.insert(this);
|
| /oneTBB/test/tbb/ |
| H A D | test_concurrent_hash_map.cpp | 231 c2.insert( lst.begin(), begin5 ); in Examine()
264 c1.insert( lst.begin(), lst.end() ); in TypeTester()
271 c2.insert( it, lst.end() ); in TypeTester()
276 c3.insert( it, lst.end() ); in TypeTester()
281 c4.insert( it, lst.end()); in TypeTester()
414 map1.insert(v1); in TestScopedAllocator()
415 map2.insert(std::move(v2)); in TestScopedAllocator()
420 map1.insert(init_list); in TestScopedAllocator()
706 bool result = map.insert(acc, 1); in test_chmap_access_mode()
711 result = map.insert(acc, 2L); in test_chmap_access_mode()
[all …]
|
| H A D | test_concurrent_unordered_map.cpp | 234 map.insert(std::pair<const int, int>(i, 42));
|
| /oneTBB/examples/parallel_reduce/convex_hull/ |
| H A D | convex_hull_bench.cpp | 130 H.insert(H.end(), P_reduced.begin(), P_reduced.end()); in divide_and_conquer()
136 H.insert(H.end(), H1.begin(), H1.end()); in divide_and_conquer()
137 H.insert(H.end(), H2.begin(), H2.end()); in divide_and_conquer()
143 hull.insert(hull.end(), points.begin(), points.end()); in quickhull()
153 hull.insert(hull.end(), H.begin(), H.end()); in quickhull()
215 dest.insert(dest.end(), src.begin(), src.end()); in appendVector()
220 dest.insert(dest.end(), src, src + srcSize); in appendVector()
544 H.insert(H.end(), P_reduced.begin(), P_reduced.end()); in divide_and_conquer()
555 H.insert(H.end(), H1.begin(), H1.end()); in divide_and_conquer()
556 H.insert(H.end(), H2.begin(), H2.end()); in divide_and_conquer()
[all …]
|
| /oneTBB/include/oneapi/tbb/detail/ |
| H A D | _concurrent_skip_list.h | 382 insert(il.begin(),il.end());
396 return insert(value).first; in insert()
401 return insert(std::move(value)).first; in insert()
407 insert(*first); in insert()
413 insert(init.begin(), init.end()); in insert()
416 std::pair<iterator, bool> insert( node_type&& nh ) { in insert() function
428 iterator insert( const_iterator, node_type&& nh ) { in insert() function
430 return insert(std::move(nh)).first; in insert()
1070 if (!insert(std::move(handle)).second) { in internal_merge()
1073 source.insert(std::move(handle)); in internal_merge()
[all …]
|
| H A D | _concurrent_unordered_base.h | 268 insert(first, last); in concurrent_unordered_base()
383 insert(init);
423 return insert(value).first; in insert()
426 iterator insert( const_iterator, value_type&& value ) { in insert() function
428 return insert(std::move(value)).first; in insert()
434 insert(*first); in insert()
438 void insert( std::initializer_list<value_type> init ) { in insert() function
439 insert(init.begin(), init.end()); in insert()
442 std::pair<iterator, bool> insert( node_type&& nh ) { in insert() function
461 iterator insert( const_iterator, node_type&& nh ) { in insert() function
[all …]
|
| /oneTBB/test/conformance/ |
| H A D | conformance_concurrent_hash_map.cpp | 225 bool b = x.insert(a,key); in FillTable()
392 t.insert(v.begin(), v.end()); // do nothing in TestIteratorsAndRanges()
395 t.insert(v.begin(), v.end()); // restore in TestIteratorsAndRanges()
409 CHECK(t2.insert(a, key)); in TestIteratorsAndRanges()
420 vd.insert( il ); in test()
725 table.insert( il ); in apply()
824 table.insert( a1, MyKey::make(1) ); in apply()
1423 bool result = chmap.insert(cacc, int(1)); in test_heterogeneous_insert()
1430 result = chmap.insert(cacc, int(1)); in test_heterogeneous_insert()
1437 result = chmap.insert(acc, int(2)); in test_heterogeneous_insert()
[all …]
|
| /oneTBB/include/oneapi/tbb/ |
| H A D | concurrent_map.h | 143 using base_type::insert;
147 std::pair<iterator, bool>>::type insert( P&& value ) in insert() function
154 iterator>::type insert( const_iterator hint, P&& value ) in insert() function
245 using base_type::insert;
264 std::pair<iterator, bool>>::type insert( P&& value ) in insert() function
271 iterator>::type insert( const_iterator hint, P&& value ) in insert() function
|
| H A D | concurrent_unordered_map.h | 126 using base_type::insert;
130 std::pair<iterator, bool>>::type insert( P&& value ) { in insert() function
136 iterator>::type insert( const_iterator hint, P&& value ) { in insert() function
272 using base_type::insert;
291 std::pair<iterator, bool>>::type insert( P&& value ) { in insert() function
297 iterator>::type insert( const_iterator hint, P&& value ) { in insert() function
|
| H A D | concurrent_hash_map.h | 1137 bool insert( const_accessor &result, const Key &key ) { in __TBB_requires()
1144 bool insert( accessor &result, const Key &key ) { in __TBB_requires()
1174 bool insert( accessor &result, const value_type &value ) { in __TBB_requires()
1181 bool insert( const value_type &value ) { in __TBB_requires()
1187 bool insert( const_accessor &result, value_type && value ) { in __TBB_requires()
1193 bool insert( accessor &result, value_type && value ) { in __TBB_requires()
1199 bool insert( value_type && value ) { in __TBB_requires()
1226 void insert( I first, I last ) { in __TBB_requires()
1228 insert( *first ); in __TBB_requires()
1232 void insert( std::initializer_list<value_type> il ) { in __TBB_requires()
[all …]
|
| /oneTBB/test/tbbmalloc/ |
| H A D | test_malloc_overload.cpp | 365 functions.insert("free"); in FuncReplacementInfoCheck()
366 functions.insert("_msize"); in FuncReplacementInfoCheck()
367 functions.insert("_aligned_free"); in FuncReplacementInfoCheck()
368 functions.insert("_aligned_msize"); in FuncReplacementInfoCheck()
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | concurrent_hash_map.rst | 57 table.insert( a, *p );
100 The methods ``find`` and ``insert`` take an ``accessor`` or
118 table.insert( a, *p );
|
| /oneTBB/doc/main/reference/ |
| H A D | custom_mutex_chmap.rst | 17 to provide thread safety and avoid data races for insert, lookup, and erasure operations. This feat…
157 …map_type map; // This object will use SharedMutexWrapper for thread safety of insert/find/erase op…
|
| /oneTBB/examples/test_all/fibonacci/ |
| H A D | fibonacci.cpp | 239 Fib.insert(fsum, std::make_pair(i, sum)); // inserting in operator ()()
249 okay = Fib.insert(std::make_pair(0, 0)); in ConcurrentHashSerialFib()
251 okay = Fib.insert(std::make_pair(1, 1)); in ConcurrentHashSerialFib()
|
| /oneTBB/src/tbb/ |
| H A D | observer_proxy.h | 67 void insert ( observer_proxy* p );
|
| H A D | observer_proxy.cpp | 90 void observer_list::insert( observer_proxy* p ) { in insert() function in tbb::detail::r1::observer_list
286 p->my_list->insert(p); in observe()
|
| /oneTBB/examples/common/utility/ |
| H A D | utility.hpp | 207 args_map.insert(std::make_pair(a.name(), a)); in add_arg()
224 bool_args_names.insert(name); in arg()
239 bool_args_names.insert(name); in positional_arg()
|
| /oneTBB/examples/graph/cholesky/ |
| H A D | cholesky.cpp | 678 algmap.insert(std::pair<std::string, algorithm *>("dpotrf", new algorithm_dpotrf)); in main()
679 algmap.insert(std::pair<std::string, algorithm *>("crout", new algorithm_crout)); in main()
680 algmap.insert(std::pair<std::string, algorithm *>("depend", new algorithm_depend)); in main()
681 algmap.insert(std::pair<std::string, algorithm *>("join", new algorithm_join)); in main()
|