// Precondition: set is empty
// Postcondition: set is empty
- ASSERT_TRUE( s.empty() );
+ ASSERT_TRUE( s.empty());
ASSERT_CONTAINER_SIZE( s, 0 );
base_class::test( s );
data.reserve( kSize );
indices.reserve( kSize );
for ( size_t key = 0; key < kSize; ++key ) {
- data.push_back( value_type( static_cast<int>(key) ) );
+ data.push_back( value_type( static_cast<int>(key)) );
indices.push_back( key );
}
- shuffle( indices.begin(), indices.end() );
+ shuffle( indices.begin(), indices.end());
for ( auto& i : data ) {
- ASSERT_TRUE( s.insert( i ) );
+ ASSERT_TRUE( s.insert( i ));
}
- ASSERT_FALSE( s.empty() );
+ ASSERT_FALSE( s.empty());
ASSERT_CONTAINER_SIZE( s, nSetSize );
// iterator test
ASSERT_TRUE( !gp );
switch ( idx % 3 ) {
case 0:
- gp = s.get( i.key() );
+ gp = s.get( i.key());
ASSERT_FALSE( !gp );
break;
case 1:
ASSERT_FALSE( !gp );
break;
case 2:
- gp = s.get_with( other_item( i.key() ), other_less() );
+ gp = s.get_with( other_item( i.key()), other_less());
ASSERT_FALSE( !gp );
}
- EXPECT_EQ( gp->key(), i.key() );
+ EXPECT_EQ( gp->key(), i.key());
EXPECT_EQ( gp->nFindCount, static_cast<size_t>( i.key() * 3 ));
gp->nFindCount *= 2;
ASSERT_TRUE( !gp );
switch ( idx % 3 ) {
case 0:
- gp = s.extract( i.key() );
+ gp = s.extract( i.key());
ASSERT_FALSE( !gp );
break;
case 1:
ASSERT_FALSE( !gp );
break;
case 2:
- gp = s.extract_with( other_item( i.key() ), other_less() );
+ gp = s.extract_with( other_item( i.key()), other_less());
ASSERT_FALSE( !gp );
break;
}
- EXPECT_EQ( gp->key(), i.key() );
+ EXPECT_EQ( gp->key(), i.key());
EXPECT_EQ( gp->nFindCount, static_cast<size_t>( i.key() * 6 ));
switch ( idx % 3 ) {
case 0:
- gp = s.extract( i.key() );
+ gp = s.extract( i.key());
break;
case 1:
gp = s.extract( i );
break;
case 2:
- gp = s.extract_with( other_item( i.key() ), other_less() );
+ gp = s.extract_with( other_item( i.key()), other_less());
break;
}
ASSERT_TRUE( !gp );
}
- ASSERT_TRUE( s.empty() );
+ ASSERT_TRUE( s.empty());
ASSERT_CONTAINER_SIZE( s, 0 );
}