Lines Matching refs:MyKey
44 class MyKey { class
50 MyKey() = default;
51 MyKey( const MyKey& ) = default;
52 void operator=( const MyKey& ) = delete;
53 static MyKey make( int i ) { in make()
54 MyKey result; in make()
159 bool equal( const MyKey& j, const MyKey& k ) const { in equal()
163 std::size_t hash( const MyKey& k ) const { in hash()
170 bool equal( const MyKey& j, const MyKey& k ) const { in equal()
174 std::size_t hash( const MyKey& ) const { in hash()
179 using test_allocator_type = StaticSharedCountingAllocator<std::allocator<std::pair<const MyKey, MyD…
180 using test_table_type = oneapi::tbb::concurrent_hash_map<MyKey, MyData, MyHashCompare, test_allocat…
181 using other_test_table_type = oneapi::tbb::concurrent_hash_map<MyKey, MyData2, MyHashCompare>;
223 MyKey key( MyKey::make(-i) ); // hash values must not be specified in direct order in FillTable()
237 MyKey key( MyKey::make(-i) ); in CheckTable()
287 w.insert( std::make_pair(MyKey::make(-5), MyData()) ); in TestRehash()
379 CHECK(v.equal_range(MyKey::make(-1)) == std::make_pair(v.end(), v.end())); in TestIteratorsAndRanges()
380 CHECK(u.equal_range(MyKey::make(-1)) == std::make_pair(u.end(), u.end())); in TestIteratorsAndRanges()
399 …using test_allocator_type2 = StaticSharedCountingAllocator<std::allocator<std::pair<const MyKey, M… in TestIteratorsAndRanges()
400 …using YourTable1 = oneapi::tbb::concurrent_hash_map<MyKey,MyData2,YourHashCompare, test_allocator_… in TestIteratorsAndRanges()
401 using YourTable2 = oneapi::tbb::concurrent_hash_map<MyKey,MyData2,YourHashCompare>; in TestIteratorsAndRanges()
406 MyKey key( MyKey::make(-5) ); MyData2 data; in TestIteratorsAndRanges()
472 …r_type = only_node_counting_allocator<oneapi::tbb::tbb_allocator<std::pair<const MyKey, MyData2>>>; in TestExceptions()
473 …using throwing_table = oneapi::tbb::concurrent_hash_map<MyKey, MyData2, MyHashCompare, allocator_t… in TestExceptions()
606 using DataStateTrackedTable = oneapi::tbb::concurrent_hash_map<MyKey, move_support_tests::Foo, MyHa…
612 …CHECK_FAST_MESSAGE((table.insert( a, std::make_pair(MyKey::make(i), move_support_tests::Foo(next))… in apply()
623 CHECK_FAST_MESSAGE((table.emplace( a, MyKey::make(i), (i + 1))), in apply_impl()
659 table.insert( a, MyKey::make(i) ); in apply()
667 table.insert( a, std::make_pair(MyKey::make(i), MyData(i*i)) ); in apply()
671 table.insert( ca, std::make_pair(MyKey::make(i), MyData(i*i)) ); in apply()
682 bool b = table.find( a, MyKey::make(i) ); in apply()
704 bool b = table.find( a, MyKey::make(i) ); in apply()
705 CHECK_FAST(b==(table.count(MyKey::make(i))>0)); in apply()
722 test_table_type::value_type( MyKey::make( i ), i*i ) in apply()
783 b = table.find( a, MyKey::make(i) ) && table.erase( a ); in apply()
786 b = table.find( a, MyKey::make(i) ) && table.erase( a ); in apply()
789 b = table.erase( MyKey::make(i) ); in apply()
791 CHECK_FAST(table.count(MyKey::make(i)) == 0); in apply()
795 using YourTable = oneapi::tbb::concurrent_hash_map<MyKey, MyData, YourHashCompare>;
803 if ( table.insert( std::make_pair(MyKey::make(key), MyData2()) ) ) in apply()
809 if(table.find( res, MyKey::make(key) ) && table.erase( res ) ) in apply()
813 if(table.find( res, MyKey::make(key) ) && table.erase( res ) ) in apply()
824 table.insert( a1, MyKey::make(1) ); in apply()
826 table.insert( a2, MyKey::make(1 + (1<<30)) ); // the same chain in apply()
839 CHECK(table.find(real_ca,MyKey::make(1))); in operator ()()
847 CHECK(const_table.find(fake_ca,MyKey::make(1))); in operator ()()
950 CHECK(InsertEraseCount[i]==ie_table.count(MyKey::make(i))); in TestInsertFindErase()
988 MyKey key = MyKey::make(i); in operator ()()
1012 b = my_table.find( a, MyKey::make(i) ) && my_table.erase( a ); in operator ()()
1015 b = my_table.find( a, MyKey::make(i) ) && my_table.erase( a ); in operator ()()
1018 b = my_table.erase( MyKey::make(i) ); in operator ()()