234     CHECK(x.empty()==(n==0));  in CheckTable()
235     CHECK(x.size()<=x.max_size());  in CheckTable()
249     CHECK(count==n);  in CheckTable()
250     CHECK(key_sum==n*(n+1)/2);  in CheckTable()
267         CHECK(!(t1 != t2));  in TestCopy()
293     CHECK(i == 1);  in TestRehash()
298             CHECK(int(v.size()) == i);  in TestRehash()
299             CHECK(int(v.bucket_count()) <= j);  in TestRehash()
301             CHECK(int(v.bucket_count()) >= j);  in TestRehash()
311     CHECK(!test_map.empty());  in TestAssignment()
319             CHECK((t1 == t2) == (i == j));  in TestAssignment()
323             CHECK(&tref==&t2);  in TestAssignment()
324             CHECK(t1 == t2);  in TestAssignment()
346     CHECK(&xr==xp);  in TestIteratorTraits()
352     CHECK(i==j);  in TestIteratorAssignment()
353     CHECK(!(i!=j));  in TestIteratorAssignment()
355     CHECK(k==j);  in TestIteratorAssignment()
356     CHECK(!(k!=j));  in TestIteratorAssignment()
370     CHECK(v.range().grainsize() == 1);  in TestIteratorsAndRanges()
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()
407     CHECK(t2.erase(key));  in TestIteratorsAndRanges()
409     CHECK(t2.insert(a, key));  in TestIteratorsAndRanges()
411     CHECK(t1 != t2);  in TestIteratorsAndRanges()
413     CHECK(t1 == t2);  in TestIteratorsAndRanges()
483     CHECK(MyDataCount==1000);  in TestExceptions()
522                     CHECK(size>=100);  in TestExceptions()
528                     CHECK(size==size_t(100-t));  in TestExceptions()
740     CHECK(actual_size==expected_size);  in TraverseTable()
768     CHECK(ci==const_table.end());  in TraverseTable()
839             CHECK(table.find(real_ca,MyKey::make(1)));  in operator ()()
847             CHECK(const_table.find(fake_ca,MyKey::make(1)));  in operator ()()
880                 CHECK(false);  in Check()
888     CHECK(table.size()==expected_size);  in ParallelTraverseTable()
915         CHECK(MyDataCount==0);  in TestInsertFindErase()
925             CHECK(MyDataCount == m);  in TestInsertFindErase()
930             CHECK(MyDataCount == m);  in TestInsertFindErase()
933             CHECK(MyDataCount == m);  in TestInsertFindErase()
937             CHECK(EraseCount == m);  in TestInsertFindErase()
938             CHECK(MyDataCount == 0);  in TestInsertFindErase()
950                 CHECK(InsertEraseCount[i]==ie_table.count(MyKey::make(i)));  in TestInsertFindErase()
1028         CHECK( MyDataCount==0);  in TestConcurrency()