Home
last modified time | relevance | path

Searched refs:equal (Results 1 – 25 of 30) sorted by relevance

12

/oneTBB/doc/main/tbb_userguide/
H A DMore_on_HashCompare.rst42 - A method ``equal`` that determines if two keys are equal
46 equal, then they must hash to the same value*, otherwise the hash table
76 // True if strings are equal
77 bool equal(const string& x, const string& y) const {
H A Dconcurrent_hash_map.rst39 //! True if strings are equal
40 static bool equal( const string& x, const string& y ) {
H A DPartitioner_Summary.rst44 iterations in nearly equal chunks between computing resources.
H A DGuiding_Task_Scheduler_Execution.rst110 Similarly to the previous example, the number of threads inside the arena is equal to the
H A DParallelizing_Flow_Graph.rst27 completely processed, sum is equal to the sum of the sequence of squares
H A DDependence_Graph.rst33 task to execute their body when this count is equal to the total number
H A DData_Flow_Graph.rst20 will be equal to the sum of the sequence of squares and cubes from 1 to
H A DPredefined_Node_Types.rst31 … user body when it receives N continue_msg objects at its input. N is equal to the number of p…
/oneTBB/include/oneapi/tbb/detail/
H A D_hash_compare.h36 hash_compare( hasher hash, key_equal equal ) : my_hasher(hash), my_equal(equal) {} in hash_compare() argument
80 bool equal( const Key& a, const Key& b ) const { return my_key_equal(a, b); } in equal() function
97 { hc.equal(key1, key2) } -> std::convertible_to<bool>; in requires()
H A D_flow_graph_tagged_buffer_impl.h220 if(this->equal(tbb::detail::invoke(*my_key, *pv), k)) { in find_ref_with_key()
244 if(this->equal(tbb::detail::invoke(*my_key, *vp), k)) { in delete_with_key()
H A D_concurrent_unordered_base.h243 … const key_equal& equal = key_equal(), const allocator_type& alloc = allocator_type() )
247 my_hash_compare(hash, equal),
265 … const key_equal& equal = key_equal(), const allocator_type& alloc = allocator_type() )
266 : concurrent_unordered_base(bucket_count, hash, equal, alloc) in concurrent_unordered_base() argument
336 const hasher& hash = hasher(), const key_equal& equal = key_equal(),
338 : concurrent_unordered_base(init.begin(), init.end(), bucket_count, hash, equal, alloc) {}
/oneTBB/test/common/
H A Dconcurrent_associative_common.h1015 utils::IsEqual equal;
1016 REQUIRE(equal(my_c[my_value.first], my_value.second));
1018 REQUIRE(equal(my_c[std::move(temp_key)], my_value.second));
1030 utils::IsEqual equal;
1031 REQUIRE(equal(c.at(value.first), value.second));
1034 REQUIRE(equal(constC.at(value.first), value.second));
1059 utils::IsEqual equal;
1060 REQUIRE(equal(*my_c.find(Value<Table>::key(value)), value));
1061 REQUIRE(equal(*constC.find(Value<Table>::key(value)), value));
1067 REQUIRE(equal(*res.first, value));
[all …]
H A Dcontainer_move_support.h345 return std::equal(dst.begin(), dst.end(), locations.begin(), is_same_location); in content_location_unchanged()
353 return std::equal(dst.begin(), dst.end(), locations.begin(), is_not_same_location); in content_location_changed()
479 … REQUIRE(ContainerTraits::equal(dst, init_iterator_type(0), init_iterator_type(container_size))); in verify_content_equal_to_source()
484 …REQUIRE(std::equal(dst.begin(), dst.begin() + number_of_constructed_items, init_iterator_type(0))); in verify_content_equal_to_source()
H A Dconcepts_common.h433 …bool equal( const Key&, const Key& ) const requires (EnableEqual == State::correct) { return true;… in equal() function
434 …bool equal( const Key&, const Key& ) requires (EnableEqual == State::incorrect_constness) { return… in equal() function
435 …bool equal( Dummy, const Key& ) const requires (EnableEqual == State::incorrect_first_input) { ret… in equal() function
436 …bool equal( const Key&, Dummy ) const requires (EnableEqual == State::incorrect_second_input) { re… in equal() function
437 …Dummy equal( const Key&, const Key& ) const requires (EnableEqual == State::incorrect_return_type)… in equal() function
H A Dconcurrent_unordered_common.h138 static bool equal( const UnorderedType& c, Iterator begin, Iterator end ) { in equal() function
/oneTBB/test/tbb/
H A Dtest_join_node_preview.cpp48 bool equal(msg_t, msg_t) const { return true; } in jn_follows_and_precedes() function in jn_follows_and_precedes::hash_compare
H A Dtest_concurrent_hash_map.cpp384 …bool equal(const AllocatorAwareData<Allocator>& key1, const AllocatorAwareData<Allocator>& key2) c… in equal() function
385 return my_hash_compare.equal(key1.value(), key2.value()); in equal()
493 bool equal( const T& lhs, const T& rhs ) const { in equal() function
515 static bool equal(hash_map_type const& c, iterator begin, iterator end){ in equal() function
691 bool equal(const T& key1, const U& key2) const { return key1 == key2; } in equal() function
H A Dtest_concurrent_vector.cpp99 …static bool equal(tbb::concurrent_vector<element_type, allocator_type > const& c, iterator begin, … in equal() function
101 return equal_sizes && std::equal(c.begin(), c.end(), begin); in equal()
395 …REQUIRE_MESSAGE( std::equal( v.begin(), v.end(), init_range ), "grow_by(I,I) did not properly copi… in TestSerialGrowByRange()
H A Dtest_parallel_sort.cpp74 std::equal(std::begin(test_range), std::end(test_range), std::begin(sorted_range), in validate()
/oneTBB/test/conformance/
H A Dconformance_concurrent_hash_map.cpp159 bool equal( const MyKey& j, const MyKey& k ) const { in equal() function in MyHashCompare
170 bool equal( const MyKey& j, const MyKey& k ) const { in equal() function in YourHashCompare
570 bool equal( const T& lhs, const T& rhs ) const { in equal() function
592 static bool equal(hash_map_type const& c, iterator begin, iterator end){ in equal() function
1247 bool equal( const int& key1, const int& key2 ) const { in equal() function
1252 bool equal( const int& key1, const HeterogeneousKey<IsConstructible>& key2 ) const { in equal() function
1257 bool equal( const HeterogeneousKey<IsConstructible>& key1, const int& key2 ) const { in equal() function
1262 …bool equal( const HeterogeneousKey<IsConstructible>& key1, const HeterogeneousKey<IsConstructible>… in equal() function
H A Dconformance_join_node.cpp206 bool equal(const KeyType &k1, const KeyType &k2) const{ in equal() function
H A Dconformance_concurrent_queue.cpp492 REQUIRE_MESSAGE(std::equal(dqb, dqe, iter), "unexpected element"); in TestConstructors()
570 …std::equal(locations.begin(), locations.end(), dst_queue.unsafe_begin(), [](const T* t1, const T& … in TestConstructors()
1240 CHECK(std::equal(q.unsafe_begin(), q.unsafe_end(), vec.begin())); in AssertEquality()
1817 …REQUIRE_MESSAGE(std::equal(dst.unsafe_begin(), dst.unsafe_end(), cpy.unsafe_begin()), "Elements ar… in test_check_move_allocator()
/oneTBB/cmake/compilers/
H A DMSVC.cmake57 message(FATAL_ERROR "CMAKE_SYSTEM_VERSION must be equal to 10.0")
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_queue.h275 …return lhs.unsafe_size() == rhs.unsafe_size() && std::equal(lhs.unsafe_begin(), lhs.unsafe_end(), …
669 …return lhs.size() == rhs.size() && std::equal(lhs.unsafe_begin(), lhs.unsafe_end(), rhs.unsafe_beg…
/oneTBB/examples/test_all/fibonacci/
H A Dfibonacci.cpp211 bool equal(const int j, const int k) const { in equal() function

12