Home
last modified time | relevance | path

Searched refs:compare (Results 1 – 22 of 22) sorted by relevance

/oneTBB/test/tbb/
H A Dtest_parallel_sort.cpp62 bool compare(const Value& lhs, const Value& rhs) { in compare() function
66 bool compare(const Minimal& lhs, const Minimal& rhs) { in compare() function
76 return compare(tested, reference); in validate()
107 std::size_t size, const Compare &compare) { in fill_ranges() argument
139 std::sort(sorted_range_begin, sorted_range_begin + size, compare); in fill_ranges()
210 tbb::parallel_sort(it, it, compare);
220 tbb::parallel_sort(cbs, compare);
224 using CorrectCompare = test_concepts::compare::Correct<T>;
248 using namespace test_concepts::compare; in test_psort_compare_constraints()
280 using CorrectCompare = test_concepts::compare::Correct<int>; in test_psort_cbs_constraints()
[all …]
H A Dtest_concurrent_hash_map.cpp261 debug_hash_compare<key_type> compare{}; in TypeTester() local
275 ch_map c3( il, compare); in TypeTester()
280 ch_map c4( il, compare, typename ch_map::allocator_type()); in TypeTester()
318 ch_map_debug_hash c12(c1.begin(), c1.end(), compare); in TypeTester()
321 ch_map_debug_hash c13(c1.begin(), c1.end(), compare, typename ch_map::allocator_type()); in TypeTester()
H A Dtest_composite_node.cpp78 struct compare { struct
81 compare<N-1, T1, T2>::compare_refs(tuple1, tuple2); in compare_refs()
86 struct compare<1, T1, T2> { struct
/oneTBB/test/conformance/
H A Dconformance_concurrent_set.cpp95 std::greater<int> compare; in test_deduction_guides() local
98 TSet set2(vc.begin(), vc.end(), compare); in test_deduction_guides()
99 static_assert(std::is_same_v<decltype(set2), TSet<int, decltype(compare)>>, "Wrong"); in test_deduction_guides()
104 TSet set4(vc.begin(), vc.end(), compare, allocator); in test_deduction_guides()
105 …static_assert(std::is_same_v<decltype(set4), TSet<int, decltype(compare), decltype(allocator)>>, "… in test_deduction_guides()
112 TSet set6(init_list, compare); in test_deduction_guides()
113 static_assert(std::is_same_v<decltype(set6), TSet<int, decltype(compare)>>, "Wrong"); in test_deduction_guides()
118 TSet set8(init_list, compare, allocator); in test_deduction_guides()
119 …static_assert(std::is_same_v<decltype(set8), TSet<int, decltype(compare), decltype(allocator)>>, "… in test_deduction_guides()
H A Dconformance_concurrent_map.cpp115 std::greater<int> compare; in test_deduction_guides() local
117 TMap map2(v.begin(), v.end(), compare); in test_deduction_guides()
118 static_assert(std::is_same_v<decltype(map2), TMap<int, int, decltype(compare)> >, "WRONG\n"); in test_deduction_guides()
123 TMap map4(v.begin(), v.end(), compare, allocator); in test_deduction_guides()
124 …static_assert(std::is_same_v<decltype(map4), TMap<int, int, decltype(compare), decltype(allocator)… in test_deduction_guides()
131 TMap map6(init, compare); in test_deduction_guides()
132 static_assert(std::is_same_v<decltype(map6), TMap<int, int, decltype(compare)> >, "WRONG\n"); in test_deduction_guides()
137 TMap map8(init, compare, allocator); in test_deduction_guides()
138 …static_assert(std::is_same_v<decltype(map8), TMap<int, int, decltype(compare), decltype(allocator)… in test_deduction_guides()
H A Dconformance_composite_node.cpp51 struct compare { struct
54 compare<N-1, T1, T2>::compare_refs(tuple1, tuple2); in compare_refs()
59 struct compare<1, T1, T2> { struct
123 …compare<NUM_INPUTS-1, decltype(a_node_input_ports_ptr), decltype(input_tuple)>::compare_refs(a_nod…
127 …compare<NUM_OUTPUTS-1, decltype(a_node_output_ports_ptr), decltype(output_tuple)>::compare_refs(a_…
138 …compare<NUM_INPUTS-1, decltype(b_node_input_ports_ptr), decltype(input_tuple)>::compare_refs(b_nod…
153 …compare<NUM_OUTPUTS-1, decltype(c_node_output_ports_ptr), decltype(output_tuple)>::compare_refs(c_…
H A Dconformance_concurrent_hash_map.cpp1065 map_type map1(compare); in TestHashCompareConstructors()
1066 map_type map2(compare, allocator); in TestHashCompareConstructors()
1068 map_type map3(1, compare); in TestHashCompareConstructors()
1069 map_type map4(1, compare, allocator); in TestHashCompareConstructors()
1075 map_type map7({}, compare); in TestHashCompareConstructors()
1076 map_type map8({}, compare, allocator); in TestHashCompareConstructors()
1098 Compare compare; in TestDeductionGuides() local
1106 TMap m2(v.begin(), v.end(), compare); in TestDeductionGuides()
1110 TMap m3(v.begin(), v.end(), compare, allocator); in TestDeductionGuides()
1122 TMap m6(l, compare); in TestDeductionGuides()
[all …]
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_priority_queue.h60 …explicit concurrent_priority_queue( const Compare& compare, const allocator_type& alloc = allocato…
61 : mark(0), my_size(0), my_compare(compare), data(alloc)
73 …explicit concurrent_priority_queue( size_type init_capacity, const Compare& compare, const allocat…
74 : mark(0), my_size(0), my_compare(compare), data(alloc)
81 …concurrent_priority_queue( InputIterator begin, InputIterator end, const Compare& compare, const a…
82 : mark(0), my_compare(compare), data(begin, end, alloc)
93 …concurrent_priority_queue( std::initializer_list<value_type> init, const Compare& compare, const a…
94 : concurrent_priority_queue(init.begin(), init.end(), compare, alloc) {}
H A Dparallel_sort.h37 concept compare = requires( const std::remove_reference_t<Compare>& comp, typename std::iterator_tr… in requires()
236 compare<Compare, RandomAccessIterator> && in __TBB_requires()
263 compare<Compare, range_iterator_type<Range>> && in __TBB_requires()
H A Dconcurrent_hash_map.h835 …explicit concurrent_hash_map( const hash_compare_type& compare, const allocator_type& a = allocato… in __TBB_requires()
837 , my_hash_compare(compare) in __TBB_requires()
853 …concurrent_hash_map( size_type n, const hash_compare_type& compare, const allocator_type& a = allo… in __TBB_requires()
854 : concurrent_hash_map(compare, a) in __TBB_requires()
908 …concurrent_hash_map( I first, I last, const hash_compare_type& compare, const allocator_type& a = … in __TBB_requires()
909 : concurrent_hash_map(compare, a) in __TBB_requires()
918 …concurrent_hash_map( std::initializer_list<value_type> il, const hash_compare_type& compare = hash… in __TBB_requires()
919 : concurrent_hash_map(compare, a) in __TBB_requires()
H A Dflow_graph.h1669 : buffer_node<T>(g), compare(comp), mark(0) {
1780 Compare compare;
1788 …return mark < this->my_tail && compare(this->get_my_item(0), this->get_my_item(this->my_tail - 1)); in prio_use_tail()
1842 if (!compare(this->get_my_item(parent), to_place)) in heapify()
1857 compare(this->get_my_item(child), in reheap()
1861 if (compare(this->get_my_item(target), in reheap()
/oneTBB/src/tbb/
H A Dmisc.h176 T1 atomic_update(std::atomic<T1>& dst, T1 newValue, Pred compare) { in atomic_update() argument
178 while ( compare(oldValue, newValue) ) { in atomic_update()
/oneTBB/test/common/
H A Dconcurrent_ordered_common.h221 typename Table::key_compare compare;
238 Table c2_comp_alloc(init, compare, allocator);
251 Table c4(compare);
261 Table c6(compare, allocator);
274 Table c9(c1.begin(), c1.end(), compare, allocator);
H A Dutils.h377 static bool compare( const std::weak_ptr<T> &t1, const std::weak_ptr<T> &t2 ) {
383 static bool compare( const std::unique_ptr<T> &t1, const std::unique_ptr<T> &t2 ) {
388 static bool compare( const std::pair< const std::weak_ptr<T1>, std::weak_ptr<T2> > &t1,
395 static bool compare( const T1 &t1, const T2 &t2 ) {
400 return compare( (const T1&)t1, (const T2&)t2 );
H A Ddoctest.h708 int compare(const char* other, bool no_case = false) const;
3836 int String::compare(const char* other, bool no_case) const {
3842 int String::compare(const String& other, bool no_case) const {
3843 return compare(other.c_str(), no_case);
3965 return m_name.compare(other.m_name) < 0;
4403 const int file_cmp = m_file.compare(other.m_file);
6934 if(p->order_by.compare("file", true) == 0) {
6936 } else if(p->order_by.compare("suite", true) == 0) {
6938 } else if(p->order_by.compare("name", true) == 0) {
6940 } else if(p->order_by.compare("rand", true) == 0) {
[all …]
H A Dconcurrent_associative_common.h86 static bool compare( const typename Container::iterator& it, U val ) {
307 REQUIRE_MESSAGE(Value<Container>::compare(ins.first, key1), "Element 1 has not been inserted");
317 REQUIRE_MESSAGE(Value<Container>::compare(it2, key2), "Element 2 has not been inserted");
H A Dconcepts_common.h402 namespace compare {
/oneTBB/doc/main/reference/
H A Dconstructors_for_nodes.rst76 explicit priority_queue_node(precedes(...), const Compare& compare = Compare());
/oneTBB/doc/main/tbb_userguide/
H A Dconcurrent_hash_map.rst10 compare two keys.
/oneTBB/include/oneapi/tbb/detail/
H A D_concurrent_skip_list.h955 auto compare = select_comparator(std::integral_constant<bool, allow_multimapping>{}); in internal_insert_node() local
960 … fill_prev_curr_arrays(prev_nodes, curr_nodes, new_node, get_key(new_node), compare, head_node); in internal_insert_node()
1004 … curr_nodes[lev] = internal_find_position(lev, prev_nodes[lev], new_node, compare); in internal_insert_node()
/oneTBB/test/tbbmalloc/
H A Dtest_malloc_whitebox.cpp1421 … REQUIRE_MESSAGE(last_line.compare("Log was truncated.") == 0, "Log overflow was not handled"); in TestLogOverload()
1438 … REQUIRE_MESSAGE(expected_line.compare(*func_replacement_log) == 0, "Wrong last string contnent"); in TestFalseSearchCase()
1451 … REQUIRE_MESSAGE(expected_line.compare(*func_replacement_log) == 0, "Wrong last string contnent"); in TestWrongFunctionInDll()
/oneTBB/doc/
H A DDoxyfile.in954 # basis. Doxygen will compare the file name with each pattern and apply the