Home
last modified time | relevance | path

Searched refs:rhs (Results 1 – 25 of 47) sorted by relevance

12

/oneTBB/test/common/
H A Dtest_comparisons.h111 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 Drange_based_for_support.h48 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 Dcustom_allocators.h66 swap(lhs.my_data, rhs.my_data); in swap()
95 return lhs.my_data == rhs.my_data;
100 return !(lhs == rhs);
232 lhs.items_freed == rhs.items_freed &&
235 lhs.allocations == rhs.allocations &&
236 lhs.frees == rhs.frees;
450 : my_allocator(rhs.my_allocator), my_value(rhs.my_value) in AllocatorAwareData()
455 AllocatorAwareData( AllocatorAwareData&& rhs) in AllocatorAwareData() argument
456 : my_allocator(rhs.my_allocator), my_value(rhs.my_value) in AllocatorAwareData()
486 return lhs.value() == rhs.value();
[all …]
H A Ddoctest.h3852 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 …
4039 rhs.m_epsilon * (rhs.m_scale + std::max<double>(std::fabs(lhs), std::fabs(rhs.m_value)));
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 Dcontainer_move_support.h222 friend bool operator==( const int& lhs, const Foo& rhs ) {
223 CHECK_FAST_MESSAGE(rhs.is_valid_or_zero(), "Comparing invalid objects");
224 return lhs == rhs.my_bar;
227 friend bool operator==( const Foo& lhs, const int& rhs ) {
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 Dconcurrent_ordered_common.h47 … operator()(const typename Container::value_type& lhs, const typename Container::value_type& rhs) { 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;
/oneTBB/include/oneapi/tbb/detail/
H A D_allocator_traits.h59 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_pipeline_filters.h386 inline filter_node_ptr::filter_node_ptr(const filter_node_ptr & rhs) : my_node(rhs.my_node) {
392 inline filter_node_ptr::filter_node_ptr(filter_node_ptr && rhs) : my_node(rhs.my_node) {
393 rhs.my_node = nullptr;
396 inline void filter_node_ptr::operator=(filter_node * rhs) {
400 my_node = rhs;
409 inline void filter_node_ptr::operator=(const filter_node_ptr & rhs) {
410 *this = rhs.my_node;
413 inline void filter_node_ptr::operator=(filter_node_ptr && rhs) {
415 my_node = rhs.my_node;
416 rhs.my_node = nullptr;
H A D_utils.h245 void swap_atomics_relaxed(std::atomic<T>& lhs, std::atomic<T>& rhs){ in swap_atomics_relaxed() argument
247 lhs.store(rhs.load(std::memory_order_relaxed), std::memory_order_relaxed); in swap_atomics_relaxed()
248 rhs.store(tmp, 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_range_common.h88 … 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_concurrent_skip_list.h236 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);
1234 rhs.begin(), rhs.end(),
1240 return std::lexicographical_compare(lhs.begin(), lhs.end(), rhs.begin(), rhs.end());
1245 return rhs < lhs;
1250 return !(rhs < lhs);
[all …]
/oneTBB/include/oneapi/tbb/
H A Dparallel_pipeline.h60 filter( const filter& rhs ) : my_root(rhs.my_root) {} in filter() argument
61 filter( filter&& rhs ) : my_root(std::move(rhs.my_root)) {} in filter() argument
63 void operator=(const filter& rhs) {
64 my_root = rhs.my_root;
66 void operator=( filter&& rhs ) {
67 my_root = std::move(rhs.my_root);
H A Dconcurrent_queue.h270 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 …riend 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 Dconcurrent_vector.h1057 concurrent_vector<T, Allocator> &rhs) 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);
1082 const concurrent_vector<T, Allocator> &rhs)
1085 rhs.begin(), rhs.end(),
1093 const concurrent_vector<T, Allocator> &rhs)
1095 return std::lexicographical_compare(lhs.begin(), lhs.end(), rhs.begin(), rhs.end());
1102 return !(rhs < lhs);
1109 return rhs < lhs;
[all …]
H A Dconcurrent_priority_queue.h430 const concurrent_priority_queue& rhs )
432 return lhs.data == rhs.data;
437 const concurrent_priority_queue& rhs )
439 return !(lhs == rhs);
477 concurrent_priority_queue<T, Compare, Allocator>& rhs ) in swap() argument
479 lhs.swap(rhs); in swap()
H A Dconcurrent_map.h48 bool operator()(const value_type& lhs, const value_type& rhs) const { in operator()
49 return comp(lhs.first, rhs.first); in operator()
215 concurrent_map<Key, Value, Compare, Allocator>& rhs ) in swap() argument
217 lhs.swap(rhs); in swap()
333 concurrent_multimap<Key, Value, Compare, Allocator>& rhs ) in swap() argument
335 lhs.swap(rhs); in swap()
H A Dconcurrent_set.h150 concurrent_set<Key, Compare, Allocator>& rhs ) in swap() argument
152 lhs.swap(rhs); in swap()
250 concurrent_multiset<Key, Compare, Allocator>& rhs ) in swap() argument
252 lhs.swap(rhs); in swap()
/oneTBB/examples/parallel_reduce/convex_hull/
H A Dconvex_hull_sample.cpp121 void join(const FindXExtremum &rhs) { in join() argument
122 if (closerToExtremum(rhs.extrXPoint)) { in join()
123 extrXPoint = rhs.extrXPoint; in join()
198 void join(const SplitByCP_buf &rhs) { in join() argument
199 if (rhs.howFar > howFar) { in join()
200 howFar = rhs.howFar; in join()
201 farPoint = rhs.farPoint; in join()
H A Dconvex_hull_bench.cpp341 void join(const FindXExtremum &rhs) { in join() argument
342 if (closerToExtremum(rhs.extrXPoint)) { in join()
343 extrXPoint = rhs.extrXPoint; in join()
424 void join(const SplitByCP &rhs) { in join() argument
425 if (rhs.howFar > howFar) { in join()
426 howFar = rhs.howFar; in join()
427 farPoint = rhs.farPoint; in join()
490 void join(const SplitByCP_buf &rhs) { in join() argument
491 if (rhs.howFar > howFar) { in join()
492 howFar = rhs.howFar; in join()
[all …]
/oneTBB/src/tbb/
H A Dglobal_control.cpp38 bool operator()(const d1::global_control* lhs, const d1::global_control* rhs) const;
167 …torage_comparator::operator()(const d1::global_control* lhs, const d1::global_control* rhs) const { in operator ()()
169 return lhs->my_value < rhs->my_value || (lhs->my_value == rhs->my_value && lhs < rhs); in operator ()()
H A Dintrusive_list.h81 bool operator==( const iterator_impl& rhs ) const {
82 return my_pos == rhs.my_pos;
85 bool operator!=( const iterator_impl& rhs ) const {
86 return my_pos != rhs.my_pos;
/oneTBB/test/tbb/
H A Dtest_parallel_sort.cpp62 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()
H A Dtest_join_node_msg_key_matching.cpp36 bool operator==(const message_key& rhs) { return my_value == rhs.my_value; } in operator ==()
/oneTBB/test/conformance/
H A Dconformance_concurrent_priority_queue.cpp68 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 …st MoveOperationTrackerBase<CounterType>& lhs, const MoveOperationTrackerBase<CounterType>& rhs ) { in operator ==() argument
127 return !(lhs < rhs) && !(rhs < lhs); in operator ==()
/oneTBB/doc/GSG/
H A Dnext_steps.rst51 [](int lhs, int rhs) -> int {
52 return lhs + rhs;
102 [](int lhs, int rhs) -> int {
103 return lhs + rhs;

12