| /oneTBB/test/common/ |
| H A D | test_comparisons.h | 111 return lhs.n == rhs.n; 116 return lhs.n != rhs.n; 121 return lhs.n < rhs.n; 126 return lhs.n > rhs.n; 131 return lhs.n <= rhs.n; 136 return lhs.n >= rhs.n; 196 return lhs.n <=> rhs.n; 222 return lhs.n <=> rhs.n; 225 return lhs.n == rhs.n; 238 return lhs.n < rhs.n; [all …]
|
| H A D | range_based_for_support.h | 48 T operator()( const T& lhs, const T& rhs ) { in operator() 49 return lhs + rhs; in operator() 53 U operator()( const U& lhs, const std::pair<T, U>& rhs ) { in operator() 54 return lhs + rhs.second; in operator() 60 …second_type operator() (second_type const& lhs, std::pair<first_type, second_type> const& rhs) con… in operator() 62 return lhs + rhs.second; in operator()
|
| H A D | custom_allocators.h | 66 swap(lhs.my_data, rhs.my_data); in swap() 95 return lhs.my_data == rhs.my_data; 100 return !(lhs == rhs); 231 return lhs.items_allocated == rhs.items_allocated && 232 lhs.items_freed == rhs.items_freed && 235 lhs.allocations == rhs.allocations && 236 lhs.frees == rhs.frees; 486 return lhs.value() == rhs.value(); 491 return lhs.value() < rhs.value(); 574 if (lhs.propagated_on_swap) [all …]
|
| H A D | doctest.h | 1317 …ST_APPROX_PREFIX operator<=(const T& lhs, const Approx& rhs) { return static_cast<double>(lhs) < r… 3852 bool operator<=(const String& lhs, const String& rhs) { return (lhs != rhs) ? lhs.compare(rhs) < 0 … 3853 bool operator>=(const String& lhs, const String& rhs) { return (lhs != rhs) ? lhs.compare(rhs) > 0 … 4044 bool operator<=(double lhs, const Approx& rhs) { return lhs < rhs.m_value || lhs == rhs; } 4045 bool operator<=(const Approx& lhs, double rhs) { return lhs.m_value < rhs || lhs == rhs; } 4046 bool operator>=(double lhs, const Approx& rhs) { return lhs > rhs.m_value || lhs == rhs; } 4047 bool operator>=(const Approx& lhs, double rhs) { return lhs.m_value > rhs || lhs == rhs; } 4048 bool operator<(double lhs, const Approx& rhs) { return lhs < rhs.m_value && lhs != rhs; } 4049 bool operator<(const Approx& lhs, double rhs) { return lhs.m_value < rhs && lhs != rhs; } 4050 bool operator>(double lhs, const Approx& rhs) { return lhs > rhs.m_value && lhs != rhs; } [all …]
|
| H A D | container_move_support.h | 222 friend bool operator==( const int& lhs, const Foo& rhs ) { 224 return lhs == rhs.my_bar; 227 friend bool operator==( const Foo& lhs, const int& rhs ) { 228 CHECK_FAST_MESSAGE(lhs.is_valid_or_zero(), "Comparing invalid objects"); 229 return lhs.my_bar == rhs; 232 friend bool operator==( const Foo& lhs, const Foo& rhs ) { 235 return lhs.my_bar == rhs.my_bar; 238 friend bool operator<( const Foo& lhs, const Foo& rhs ) { 241 return lhs.my_bar < rhs.my_bar; 287 return lhs.x_bar == rhs.x_bar; [all …]
|
| H A D | concurrent_ordered_common.h | 47 …bool operator()(const typename Container::value_type& lhs, const typename Container::value_type& r… in operator() 50 … return !val_comp(rhs, lhs) && !key_comp(Value<Container>::key(rhs), Value<Container>::key(lhs)); in operator() 51 … return val_comp(lhs, rhs) && key_comp(Value<Container>::key(lhs), Value<Container>::key(rhs)); in operator() 197 bool operator()( const std::weak_ptr<int>& lhs, const std::weak_ptr<int>& rhs ) const { 198 return *lhs.lock() < *rhs.lock(); 280 auto operator()( T&& lhs, U&& rhs ) const 281 -> decltype(std::forward<T>(lhs) < std::forward<U>(rhs)) { 282 return lhs < rhs;
|
| H A D | containers_common.h | 180 std::size_t operator()( const std::weak_ptr<T>& rhs, const std::weak_ptr<T>& lhs ) const { 181 return *rhs.lock().get() == *lhs.lock().get();
|
| /oneTBB/include/oneapi/tbb/detail/ |
| H A D | _allocator_traits.h | 59 lhs = rhs; 67 void copy_assign_allocators( Allocator& lhs, const Allocator& rhs ) { 69 copy_assign_allocators_impl(lhs, rhs, pocca_type()); 73 void move_assign_allocators_impl( Allocator& lhs, Allocator& rhs, /*pocma = */ std::true_type ) { 74 lhs = std::move(rhs); 82 void move_assign_allocators( Allocator& lhs, Allocator& rhs ) { 84 move_assign_allocators_impl(lhs, rhs, pocma_type()); 88 void swap_allocators_impl( Allocator& lhs, Allocator& rhs, /*pocs = */ std::true_type ) { 90 swap(lhs, rhs); 98 void swap_allocators( Allocator& lhs, Allocator& rhs ) { [all …]
|
| H A D | _range_common.h | 88 … requires( const std::remove_reference_t<Value>& lhs, const std::remove_reference_t<Value>& rhs ) { 89 { lhs < rhs } -> relaxed_convertible_to<bool>; 90 { lhs - rhs } -> std::convertible_to<std::size_t>; 91 { lhs + (rhs - lhs) } -> std::convertible_to<Value>;
|
| H A D | _utils.h | 245 void swap_atomics_relaxed(std::atomic<T>& lhs, std::atomic<T>& rhs){ in swap_atomics_relaxed() argument 246 T tmp = lhs.load(std::memory_order_relaxed); in swap_atomics_relaxed() 247 lhs.store(rhs.load(std::memory_order_relaxed), std::memory_order_relaxed); in swap_atomics_relaxed() 311 auto operator()( const T1& lhs, const T2& rhs ) const in atomic_do_once() 313 { lhs < rhs } -> boolean_testable; in atomic_do_once() 314 { rhs < lhs } -> boolean_testable; in atomic_do_once() 318 return lhs <=> rhs; in atomic_do_once() 320 if (lhs < rhs) { in atomic_do_once() 323 if (rhs < lhs) { in atomic_do_once()
|
| H A D | _concurrent_skip_list.h | 236 return lhs.my_node_ptr == rhs.my_node_ptr; 240 return lhs.my_node_ptr != rhs.my_node_ptr; 1210 if (lhs.size() != rhs.size()) return false; 1216 return std::equal(lhs.begin(), lhs.end(), rhs.begin(), rhs.end()); 1218 return std::equal(lhs.begin(), lhs.end(), rhs.begin()); 1225 return !(lhs == rhs); 1233 return std::lexicographical_compare_three_way(lhs.begin(), lhs.end(), 1240 return std::lexicographical_compare(lhs.begin(), lhs.end(), rhs.begin(), rhs.end()); 1245 return rhs < lhs; 1250 return !(rhs < lhs); [all …]
|
| H A D | _node_handle.h | 153 void swap( node_handle<Key, Value, Node, Allocator>& lhs, in swap() argument 155 return lhs.swap(rhs); in swap()
|
| /oneTBB/include/oneapi/tbb/ |
| H A D | concurrent_queue.h | 270 friend void swap( concurrent_queue& lhs, concurrent_queue& rhs ) { in swap() argument 271 lhs.swap(rhs); in swap() 274 friend bool operator==( const concurrent_queue& lhs, const concurrent_queue& rhs ) { 275 …return lhs.unsafe_size() == rhs.unsafe_size() && std::equal(lhs.unsafe_begin(), lhs.unsafe_end(), … 279 friend bool operator!=( const concurrent_queue& lhs, const concurrent_queue& rhs ) { 280 return !(lhs == rhs); 664 friend void swap( concurrent_bounded_queue& lhs, concurrent_bounded_queue& rhs ) { in swap() argument 665 lhs.swap(rhs); in swap() 668 …friend bool operator==( const concurrent_bounded_queue& lhs, const concurrent_bounded_queue& rhs )… 669 …return lhs.size() == rhs.size() && std::equal(lhs.unsafe_begin(), lhs.unsafe_end(), rhs.unsafe_beg… [all …]
|
| H A D | concurrent_vector.h | 1056 void swap(concurrent_vector<T, Allocator> &lhs, in swap() argument 1059 lhs.swap(rhs); in swap() 1066 return lhs.size() == rhs.size() && std::equal(lhs.begin(), lhs.end(), rhs.begin()); 1074 return !(lhs == rhs); 1081 operator<=>(const concurrent_vector<T, Allocator> &lhs, 1084 return std::lexicographical_compare_three_way(lhs.begin(), lhs.end(), 1092 bool operator<(const concurrent_vector<T, Allocator> &lhs, 1095 return std::lexicographical_compare(lhs.begin(), lhs.end(), rhs.begin(), rhs.end()); 1102 return !(rhs < lhs); 1109 return rhs < lhs; [all …]
|
| H A D | concurrent_priority_queue.h | 429 friend bool operator==( const concurrent_priority_queue& lhs, 432 return lhs.data == rhs.data; 436 friend bool operator!=( const concurrent_priority_queue& lhs, 439 return !(lhs == rhs); 476 void swap( concurrent_priority_queue<T, Compare, Allocator>& lhs, in swap() argument 479 lhs.swap(rhs); in swap()
|
| H A D | concurrent_map.h | 48 bool operator()(const value_type& lhs, const value_type& rhs) const { in operator() 49 return comp(lhs.first, rhs.first); in operator() 214 void swap( concurrent_map<Key, Value, Compare, Allocator>& lhs, in swap() argument 217 lhs.swap(rhs); in swap() 332 void swap( concurrent_multimap<Key, Value, Compare, Allocator>& lhs, in swap() argument 335 lhs.swap(rhs); in swap()
|
| H A D | concurrent_set.h | 149 void swap( concurrent_set<Key, Compare, Allocator>& lhs, in swap() argument 152 lhs.swap(rhs); in swap() 249 void swap( concurrent_multiset<Key, Compare, Allocator>& lhs, in swap() argument 252 lhs.swap(rhs); in swap()
|
| H A D | parallel_for.h | 45 … requires( const std::remove_reference_t<Index>& lhs, const std::remove_reference_t<Index>& rhs ) { in requires() argument 46 { lhs < rhs } -> adaptive_same_as<bool>; in requires() 47 { lhs - rhs } -> std::convertible_to<std::size_t>; in requires() 48 { lhs + (rhs - lhs) } -> std::convertible_to<Index>; in requires()
|
| H A D | concurrent_unordered_set.h | 178 void swap( concurrent_unordered_set<Key, Hash, KeyEqual, Allocator>& lhs, in swap() argument 180 lhs.swap(rhs); in swap() 316 void swap( concurrent_unordered_multiset<Key, Hash, KeyEqual, Allocator>& lhs, in swap() argument 318 lhs.swap(rhs); in swap()
|
| H A D | parallel_sort.h | 45 concept less_than_comparable = requires( const std::remove_reference_t<T>& lhs, in requires() argument 47 { lhs < rhs } -> boolean_testable; in requires()
|
| /oneTBB/src/tbb/ |
| H A D | global_control.cpp | 38 bool operator()(const d1::global_control* lhs, const d1::global_control* rhs) const; 167 inline bool control_storage_comparator::operator()(const d1::global_control* lhs, const d1::global_… in operator ()() argument 168 __TBB_ASSERT_RELEASE(lhs->my_param < d1::global_control::parameter_max , nullptr); in operator ()() 169 return lhs->my_value < rhs->my_value || (lhs->my_value == rhs->my_value && lhs < rhs); in operator ()()
|
| /oneTBB/test/tbb/ |
| H A D | test_parallel_sort.cpp | 62 bool compare(const Value& lhs, const Value& rhs) { in compare() argument 63 return lhs == rhs; in compare() 66 bool compare(const Minimal& lhs, const Minimal& rhs) { in compare() argument 67 return Minimal::AreEqual(lhs, rhs); in compare() 405 tbb::parallel_sort(std::move(test_vector), [&](std::size_t lhs, std::size_t rhs) { in __anon54e49e5e0502() argument 407 return lhs < rhs; in __anon54e49e5e0502()
|
| /oneTBB/test/conformance/ |
| H A D | conformance_concurrent_priority_queue.cpp | 68 bool operator==( const SpecialMemberCalls& lhs, const SpecialMemberCalls& rhs ) { in operator ==() argument 69 return lhs.copy_ctor_called_times == rhs.copy_ctor_called_times && in operator ==() 70 lhs.move_ctor_called_times == rhs.move_ctor_called_times && in operator ==() 71 lhs.copy_assign_called_times == rhs.copy_assign_called_times && in operator ==() 72 lhs.move_assign_called_times == rhs.move_assign_called_times; in operator ==() 126 bool operator==( const MoveOperationTrackerBase<CounterType>& lhs, const MoveOperationTrackerBase<C… in operator ==() argument 127 return !(lhs < rhs) && !(rhs < lhs); in operator ==()
|
| H A D | conformance_parallel_reduce.cpp | 167 auto regular_join = [](const test_invoke::SmartValue& lhs, const test_invoke::SmartValue& rhs) { in __anon105f294c0402() argument 168 return lhs + rhs; in __anon105f294c0402()
|
| /oneTBB/doc/GSG/ |
| H A D | next_steps.rst | 51 [](int lhs, int rhs) -> int { 52 return lhs + rhs; 102 [](int lhs, int rhs) -> int { 103 return lhs + rhs;
|