void TestRehash() {
REMARK("testing rehashing\n");
MyTable w;
w.insert( std::make_pair(MyKey::make(-5), MyData()) );
w.rehash(); // without this, assertion will fail
MyTable::iterator it = w.begin();
int i = 0; // check for non-rehashed buckets
for( ; it != w.end(); i++ )
w.count( (it++)->first );
ASSERT( i == 1, NULL );
for( i=0; i<1000; i=(i<29 ? i+1 : i*2) ) {
for( int j=max(256+i, i*2); j<10000; j*=3 ) {
MyTable v;
FillTable( v, i );
ASSERT(int(v.size()) == i, NULL);
ASSERT(int(v.bucket_count()) <= j, NULL);
v.rehash( j );
ASSERT(int(v.bucket_count()) >= j, NULL);
CheckTable( v, i );
}
}
}
void TestIteratorsAndRanges() {
REMARK("testing iterators compliance\n");
TestIteratorTraits<MyTable::iterator,MyTable::value_type>();
TestIteratorTraits<MyTable::const_iterator,const MyTable::value_type>();
MyTable v;
MyTable const &u = v;
TestIteratorAssignment<MyTable::const_iterator>( u.begin() );
TestIteratorAssignment<MyTable::const_iterator>( v.begin() );
TestIteratorAssignment<MyTable::iterator>( v.begin() );
// doesn't compile as expected: TestIteratorAssignment<typename V::iterator>( u.begin() );
// check for non-existing
ASSERT(v.equal_range(MyKey::make(-1)) == std::make_pair(v.end(), v.end()), NULL);
ASSERT(u.equal_range(MyKey::make(-1)) == std::make_pair(u.end(), u.end()), NULL);
REMARK("testing ranges compliance\n");
TestRangeAssignment<MyTable::const_range_type>( u.range() );
TestRangeAssignment<MyTable::const_range_type>( v.range() );
TestRangeAssignment<MyTable::range_type>( v.range() );
// doesn't compile as expected: TestRangeAssignment<typename V::range_type>( u.range() );
REMARK("testing construction and insertion from iterators range\n");
FillTable( v, 1000 );
MyTable2 t(v.begin(), v.end());
v.rehash();
CheckTable(t, 1000);
t.insert(v.begin(), v.end()); // do nothing
CheckTable(t, 1000);
t.clear();
t.insert(v.begin(), v.end()); // restore
CheckTable(t, 1000);
REMARK("testing comparison\n");
typedef tbb::concurrent_hash_map<MyKey,MyData2,YourHashCompare,MyAllocator> YourTable1;
typedef tbb::concurrent_hash_map<MyKey,MyData2,YourHashCompare> YourTable2;
YourTable1 t1;
FillTable( t1, 10 );
CheckTable(t1, 10 );
YourTable2 t2(t1.begin(), t1.end());
MyKey key( MyKey::make(-5) ); MyData2 data;
ASSERT(t2.erase(key), NULL);
YourTable2::accessor a;
ASSERT(t2.insert(a, key), NULL);
data.set_value(0); a->second = data;
ASSERT( t1 != t2, NULL);
data.set_value(5*5); a->second = data;
ASSERT( t1 == t2, NULL);
}
