EXPECT_EQ( cds::bitop::MSB( n ), 0 ) << "n=" << n;
EXPECT_EQ( cds::bitop::LSB( n ), 0 ) << "n=" << n;
EXPECT_EQ( cds::bitop::SBC( n ), 0 ) << "n=" << n;
- EXPECT_EQ( cds::bitop::ZBC( n ), sizeof( n ) * 8 ) << "n=" << n;
+ EXPECT_EQ( cds::bitop::ZBC( n ), static_cast<int>( sizeof( n ) * 8 )) << "n=" << n;
int nBit = 1;
for ( n = 1; n != 0; n *= 2 ) {
EXPECT_EQ( cds::bitop::MSBnz( n ), nBit - 1 ) << "n=" << n;
EXPECT_EQ( cds::bitop::LSBnz( n ), nBit - 1 ) << "n=" << n;
EXPECT_EQ( cds::bitop::SBC( n ), 1 ) << "n=" << n;
- EXPECT_EQ( cds::bitop::ZBC( n ), sizeof( n ) * 8 - 1 ) << "n=" << n;
+ EXPECT_EQ( cds::bitop::ZBC( n ), static_cast<int>( sizeof( n ) * 8 - 1 )) << "n=" << n;
++nBit;
}
ASSERT_TRUE( q.pop_with( f ));
else
ASSERT_TRUE( q.dequeue_with( f ));
- ASSERT_EQ( it, i );
+ ASSERT_EQ( it, static_cast<value_type>( i ));
ASSERT_CONTAINER_SIZE( q, nSize - i - 1 );
}
ASSERT_TRUE( q.empty() );
// pop from empty queue
it = nSize * 2;
ASSERT_FALSE( q.pop( it ) );
- ASSERT_EQ( it, nSize * 2 );
+ ASSERT_EQ( it, static_cast<value_type>( nSize * 2 ));
ASSERT_TRUE( q.empty() );
ASSERT_CONTAINER_SIZE( q, 0 );
gp = s.extract( i.key() );
ASSERT_FALSE( !gp );
EXPECT_EQ( gp->key(), i.key() );
- EXPECT_EQ( gp->nFindCount, static_cast<>size_t( i.key() * 4 ));
+ EXPECT_EQ( gp->nFindCount, static_cast<size_t>( i.key() * 4 ));
gp = s.extract( i.key() );
ASSERT_TRUE( !gp );