ASSERT_FALSE( s.insert( i, []( value_type& v ) { ++v.nFindCount; } ));
ASSERT_TRUE( s.find( i.nKey, []( value_type const& v )
{
- EXPECT_EQ( v.nFindCount, 1 );
+ EXPECT_EQ( v.nFindCount, 1u );
}));
break;
case 3:
ASSERT_FALSE( s.insert( i.key(), []( value_type& v ) { ++v.nFindCount; } ));
ASSERT_TRUE( s.find( i.nKey, []( value_type const& v )
{
- EXPECT_EQ( v.nFindCount, 1 );
+ EXPECT_EQ( v.nFindCount, 1u );
}));
break;
case 4:
updResult = s.update( i, []( value_type& v, value_type * prev )
{
ASSERT_TRUE( prev != nullptr );
- EXPECT_EQ( prev->nUpdateNewCount, 1 );
+ EXPECT_EQ( prev->nUpdateNewCount, 1u );
EXPECT_EQ( v.key(), prev->key() );
++v.nUpdateCount;
}, false );
ASSERT_TRUE( s.find( i.nKey, []( value_type const& v )
{
- EXPECT_EQ( v.nUpdateCount, 1 );
- EXPECT_EQ( v.nUpdateNewCount, 0 );
+ EXPECT_EQ( v.nUpdateCount, 1u );
+ EXPECT_EQ( v.nUpdateNewCount, 0u );
}));
break;
case 5:
{
ASSERT_TRUE( prev != nullptr );
EXPECT_EQ( v.key(), prev->key() );
- EXPECT_EQ( prev->nUpdateNewCount, 1 );
- EXPECT_EQ( v.nUpdateNewCount, 0 );
+ EXPECT_EQ( prev->nUpdateNewCount, 1u );
+ EXPECT_EQ( v.nUpdateNewCount, 0u );
++v.nUpdateNewCount;
}, false );
EXPECT_TRUE( updResult.first );
ASSERT_TRUE( s.find( i.key(), []( value_type const& v )
{
- EXPECT_EQ( v.nUpdateNewCount, 1 );
+ EXPECT_EQ( v.nUpdateNewCount, 1u );
} ) );
break;
case 6:
case 1:
ASSERT_TRUE( s.erase( i.key(), [&nKey]( value_type const& v )
{
- EXPECT_EQ( v.nFindCount, 1 );
+ EXPECT_EQ( v.nFindCount, 1u );
nKey = v.key();
} ) );
EXPECT_EQ( i.key(), nKey );
ASSERT_FALSE( s.find( i.nKey, []( value_type const& ) {} ) );
}
ASSERT_TRUE( s.empty() );
- ASSERT_CONTAINER_SIZE( s, 0 );
+ ASSERT_CONTAINER_SIZE( s, 0u );
// clear
s.clear();
ASSERT_TRUE( s.empty() );
- ASSERT_CONTAINER_SIZE( s, 0 );
+ ASSERT_CONTAINER_SIZE( s, 0u );
ASSERT_TRUE( s.begin() == s.end() );
ASSERT_TRUE( s.cbegin() == s.cend() );