Searched refs:IsEqual (Results 1 – 8 of 8) sorted by relevance
| /oneTBB/test/tbb/ |
| H A D | test_concurrent_hash_map.cpp | 83 CHECK(utils::IsEqual()(a->first, my_value.first)); in operator ()()
137 CHECK(utils::IsEqual()(ca->first, value.first)); in operator ()()
144 CHECK(utils::IsEqual()(ca->first, value.first)); in operator ()()
151 CHECK(utils::IsEqual()(a->first, value.first)); in operator ()()
152 CHECK(utils::IsEqual()(a->second, value.second)); in operator ()()
158 CHECK(utils::IsEqual()(a->first, value.first)); in operator ()()
170 … CHECK((utils::IsEqual()( *r1_first_prev, value ) && utils::IsEqual()( r1.first, r1.second ))); in operator ()()
173 … CHECK((utils::IsEqual()( *r2_first_prev, value ) && utils::IsEqual()( r2.first, r2.second ))); in operator ()()
180 static bool IsEqual( const T& t1, const T& t2 ) { in IsEqual() function
188 static bool IsEqual( const T&, const T& ) { in IsEqual() function
[all …]
|
| H A D | test_concurrent_unordered_set.cpp | 72 …fCtorPresent, tbb::concurrent_unordered_set<ValueType, std::hash<ValueType>, utils::IsEqual>>(lst); in check()
73 …Present, tbb::concurrent_unordered_multiset<ValueType, std::hash<ValueType>, utils::IsEqual>>(lst); in check()
|
| H A D | test_concurrent_vector.cpp | 283 REQUIRE( utils::IsEqual()(c[i], vec[i]) ); in Examine()
294 REQUIRE( utils::IsEqual()(cvcr.front(), *(c2.rend()-1)) ); in Examine()
295 REQUIRE( utils::IsEqual()(cvcr.back(), *c2.rbegin())); in Examine()
296 REQUIRE( utils::IsEqual()(*c.cbegin(), *(c.crend()-1)) ); in Examine()
297 REQUIRE( utils::IsEqual()(*(c.cend()-1), *c.crbegin()) ); in Examine()
|
| H A D | test_concurrent_unordered_map.cpp | 84 using table_type = GeneralTableType<Key, Mapped, std::hash<Key>, utils::IsEqual>;
|
| /oneTBB/test/common/ |
| H A D | concurrent_priority_queue_common.h | 72 REQUIRE(utils::IsEqual{}(elem, *it1)); in examine()
87 REQUIRE(utils::IsEqual{}(elem, *it1)); in examine()
|
| H A D | concurrent_associative_common.h | 1015 utils::IsEqual equal;
1030 utils::IsEqual equal;
1059 utils::IsEqual equal;
1124 auto it2 = std::search(my_lst.begin(), my_lst.end(), prev_it, it, utils::IsEqual());
|
| H A D | concurrent_unordered_common.h | 177 …REQUIRE(std::search(c.unsafe_begin(index), c.unsafe_end(index), prev_it, it, utils::IsEqual()) != … in CustomExamine()
|
| H A D | utils.h | 375 struct IsEqual {
|