| /oneTBB/include/oneapi/tbb/ |
| H A D | parallel_sort.h | 61 …return comp(array[l], array[m]) ? ( comp(array[m], array[r]) ? m : ( comp(array[l], array[r]) ? r … in median_of_three()
62 … : ( comp(array[r], array[m]) ? m : ( comp(array[r], array[l]) ? r : l ) ); in median_of_three()
116 const Compare& comp; variable
121 comp(comp_), size(size_), begin(begin_) {} in quick_sort_range()
127 : comp(range.comp) in quick_sort_range()
138 const Compare& comp; variable
157 if( comp(*(k), *(k - 1)) ) { in operator()
193 if( comp(*(k + 1), *k) ) { in parallel_quick_sort()
206 do_parallel_quick_sort(begin, end, comp); in parallel_quick_sort()
242 std::sort(begin, end, comp); in __TBB_requires()
[all …]
|
| H A D | concurrent_map.h | 49 return comp(lhs.first, rhs.first); in operator()
53 value_compare(compare_type c) : comp(c) {} in value_compare()
57 compare_type comp; member
60 static value_compare value_comp(compare_type comp) { return value_compare(comp); } in value_comp()
|
| H A D | concurrent_set.h | 48 static value_compare value_comp(compare_type comp) { return comp; } in value_comp()
|
| H A D | flow_graph.h | 1668 __TBB_NOINLINE_SYM explicit priority_queue_node( graph &g, const Compare& comp = Compare() )
1669 : buffer_node<T>(g), compare(comp), mark(0) {
1677 priority_queue_node(const node_set<Args...>& nodes, const Compare& comp = Compare())
1678 : priority_queue_node(nodes.graph_reference(), comp) {
|
| /oneTBB/doc/main/reference/ |
| H A D | parallel_sort_ranges_extension.rst | 38 void parallel_sort( Container&& c, const Compare& comp );
48 …Equivalent to ``parallel_sort( std::begin(c), std::end(c), comp )``, where `comp` uses `operator<`…
50 …te <typename Container, typename Compare> void parallel_sort( Container&& c, const Compare& comp );
52 Equivalent to ``parallel_sort( std::begin(c), std::end(c), comp )``.
|
| H A D | constructors_for_nodes.rst | 75 explicit priority_queue_node(follows(...), const Compare& comp = Compare());
|
| /oneTBB/test/tbb/ |
| H A D | test_parallel_sort.cpp | 166 static void run(Comparator& comp) { in run()
170 while (fill_ranges(std::begin(range), std::begin(sorted_range), Size, comp)) { in run()
171 tbb::parallel_sort(range, comp); in run()
179 Comparator comp; in parallel_sort_test_suite() local
182 parallel_sort_test<ContainerType, /*Size*/0 >::run(comp); in parallel_sort_test_suite()
183 parallel_sort_test<ContainerType, /*Size*/1 >::run(comp); in parallel_sort_test_suite()
184 parallel_sort_test<ContainerType, /*Size*/10 >::run(comp); in parallel_sort_test_suite()
185 parallel_sort_test<ContainerType, /*Size*/9999 >::run(comp); in parallel_sort_test_suite()
186 parallel_sort_test<ContainerType, /*Size*/50000>::run(comp); in parallel_sort_test_suite()
|
| /oneTBB/test/common/ |
| H A D | concurrent_priority_queue_common.h | 99 void type_tester( const std::vector<ValueType>& vec, Compare comp ) { in type_tester() argument
104 std::sort(vec_sorted.begin(), vec_sorted.end(), comp); in type_tester()
143 queue_type q7(comp); in type_tester()
147 queue_type q8(comp, alloc); in type_tester()
156 queue_type q10(100, comp); in type_tester()
165 queue_type q12(vec.begin(), vec.end(), comp); in type_tester()
172 queue_type q14({vec[0], vec[1], vec[2]}, comp); in type_tester()
|
| H A D | spin_barrier.h | 59 void SpinWaitWhileCondition(const std::atomic<T>& location, C comp) { in SpinWaitWhileCondition() argument
60 SpinWaitWhile([&] { return comp(location.load(std::memory_order_acquire)); }); in SpinWaitWhileCondition()
|
| H A D | doctest.h | 2451 #define DOCTEST_BINARY_ASSERT(assert_type, comp, ...) \
2456 DOCTEST_RB.binary_assert<doctest::detail::binaryAssertComparison::comp>( \
|
| /oneTBB/include/oneapi/tbb/detail/ |
| H A D | _utils.h | 96 T spin_wait_while(const std::atomic<T>& location, C comp, std::memory_order order) { in spin_wait_while() argument
99 while (comp(snapshot)) { in spin_wait_while()
|
| H A D | _concurrent_skip_list.h | 290 …explicit concurrent_skip_list( const key_compare& comp, const allocator_type& alloc = allocator_ty…
291 …: my_node_allocator(alloc), my_compare(comp), my_head_ptr(nullptr), my_size(0), my_max_height(0) {} in my_node_allocator()
297 …concurrent_skip_list( InputIterator first, InputIterator last, const key_compare& comp = key_compa…
299 : concurrent_skip_list(comp, alloc) in concurrent_skip_list() argument
308 …concurrent_skip_list( std::initializer_list<value_type> init, const key_compare& comp = key_compar…
310 : concurrent_skip_list(init.begin(), init.end(), comp, alloc) {}
|