| /oneTBB/test/conformance/ |
| H A D | conformance_concurrent_priority_queue.cpp | 352 q2.emplace(15, 3); in test_move_support_in_push_pop()
353 q2.emplace(2, 35); in test_move_support_in_push_pop()
354 q2.emplace(8, 8); in test_move_support_in_push_pop()
367 q3.emplace(ForwardInEmplaceTester{5}, 2); in test_move_support_in_push_pop()
624 c1.emplace(1); in TestComparisonsBasic()
627 c2.emplace(1); in TestComparisonsBasic()
634 c1.emplace(1); in TestTwoWayComparableCPQ()
635 c2.emplace(1); in TestTwoWayComparableCPQ()
|
| H A D | conformance_concurrent_queue.cpp | 50 case 2: q.emplace( v); break; in push()
1378 … static void emplace( CQ& queue, Args&&... val ) { queue.emplace( std::forward<Args>( val )... ); } in emplace() function
1384 static void emplace( CQ& queue, Args&&... val ) { in emplace() function
1395 emplacer<emplace_op>::emplace( cq, 5 ); in TestEmplaceInQueue()
1408 emplacer<emplace_op>::emplace( cq, std::string(test_str) ); in TestEmplaceInQueue()
1481 q.emplace(1); in TestQueueIteratorComparisons()
1482 q.emplace(2); in TestQueueIteratorComparisons()
1483 q.emplace(3); in TestQueueIteratorComparisons()
1644 default_container.emplace(MinimalisticObject::flag{}); in test_with_minimalistic_objects()
1653 default_container.emplace(MinimalisticObject::flag{}); in test_with_minimalistic_objects()
[all …]
|
| H A D | conformance_concurrent_hash_map.cpp | 623 CHECK_FAST_MESSAGE((table.emplace( a, MyKey::make(i), (i + 1))), in apply_impl()
1157 c1.emplace(1, 1); in test_comparisons_basic()
1160 c2.emplace(1, 1); in test_comparisons_basic()
1167 c1.emplace(1, 1); in test_two_way_comparable_chmap()
1168 c2.emplace(1, 1); in test_two_way_comparable_chmap()
1310 bool tmp_result = chmap.emplace(cacc, std::piecewise_construct, in test_heterogeneous_find()
1349 …chmap.emplace(std::piecewise_construct, std::forward_as_tuple(key_type::construct_flag{}, 1), std:… in test_heterogeneous_count()
1392 …chmap.emplace(std::piecewise_construct, std::forward_as_tuple(key_type::construct_flag{}, 1), std:… in test_heterogeneous_equal_range()
1462 …chmap.emplace(std::piecewise_construct, std::forward_as_tuple(key_type::construct_flag{}, 1), std:… in test_heterogeneous_erase()
1463 …chmap.emplace(std::piecewise_construct, std::forward_as_tuple(key_type::construct_flag{}, 2), std:… in test_heterogeneous_erase()
|
| /oneTBB/test/tbb/ |
| H A D | test_concurrent_queue.cpp | 141 source.emplace(); in CopyWithThrowElement()
214 bool res = object_addresses.emplace(this).second; in TrackableItem()
233 q.emplace(); in fill_and_catch()
|
| H A D | test_concurrent_hash_map.cpp | 408 map1.emplace(key1, data1); in TestScopedAllocator()
409 map2.emplace(key2, std::move(data2)); in TestScopedAllocator()
606 bool result = chmap.emplace(i, i); in test_with_minimalistic_mutex()
612 bool result = chmap.emplace(i, i); in test_with_minimalistic_mutex()
623 chmap.emplace(acc, i, i); in test_with_minimalistic_mutex()
632 bool result = chmap.emplace(acc, i, i * 10000); in test_with_minimalistic_mutex()
|
| H A D | test_concurrent_set.cpp | 97 mset.emplace(i); in test_cycles_absense()
|
| H A D | test_concurrent_map.cpp | 115 mmap.emplace(i, i); in test_cycles_absense()
|
| H A D | test_task_arena.cpp | 1650 arenas_pool.emplace(new tbb::task_arena()); in StressTestMixFunctionality()
1656 arenas_pool.emplace(new tbb::task_arena()); in StressTestMixFunctionality()
1684 curr_arena->observers.emplace(*curr_arena->arena, thread_number, 1); in StressTestMixFunctionality()
|
| /oneTBB/include/oneapi/tbb/ |
| H A D | concurrent_map.h | 129 … it = this->emplace(std::piecewise_construct, std::forward_as_tuple(key), std::tuple<>()).first;
138 …it = this->emplace(std::piecewise_construct, std::forward_as_tuple(std::move(key)), std::tuple<>()…
149 return this->emplace(std::forward<P>(value)); in insert()
266 return this->emplace(std::forward<P>(value)); in insert()
|
| H A D | concurrent_unordered_map.h | 94 … where = this->emplace(std::piecewise_construct, std::forward_as_tuple(key), std::tuple<>()).first;
103 …where = this->emplace(std::piecewise_construct, std::forward_as_tuple(std::move(key)), std::tuple<…
131 return this->emplace(std::forward<P>(value)); in insert()
292 return this->emplace(std::forward<P>(value)); in insert()
|
| H A D | concurrent_queue.h | 196 void emplace( Args&&... args ) { in emplace() function
486 void emplace( Args&&... args ) { in emplace() function
|
| H A D | concurrent_priority_queue.h | 190 void emplace( Args&&... args ) { in emplace() function
|
| H A D | concurrent_hash_map.h | 1206 bool emplace( const_accessor &result, Args&&... args ) { in __TBB_requires()
1213 bool emplace( accessor &result, Args&&... args ) { in __TBB_requires()
1220 bool emplace( Args&&... args ) { in __TBB_requires()
|
| /oneTBB/test/common/ |
| H A D | concurrent_priority_queue_common.h | 224 q1.emplace(new T(item)); in type_tester_unique_ptr()
239 case 2: q.emplace(e); break; in push_selector()
|
| H A D | concurrent_associative_common.h | 262 return c.emplace(std::forward<Arg>(k));
268 return c.emplace(k, std::forward<Arg>(k));
1551 c1.emplace(Value<Container>::make(ThrowOnCopy{}));
|
| H A D | graph_utils.h | 328 (*my_multiset).emplace( t );
|
| /oneTBB/examples/concurrent_priority_queue/shortpath/ |
| H A D | shortpath.cpp | 114 open_set.emplace(src, f_distance[src]); // emplace src into open_set in shortpath()
|
| /oneTBB/include/oneapi/tbb/detail/ |
| H A D | _concurrent_skip_list.h | 434 std::pair<iterator, bool> emplace( Args&&... args ) { in emplace() function
441 return emplace(std::forward<Args>(args)...).first; in emplace_hint()
|
| H A D | _concurrent_unordered_base.h | 467 std::pair<iterator, bool> emplace( Args&&... args ) { in emplace() function
491 return emplace(std::forward<Args>(args)...).first; in emplace_hint()
|