const size_t nSize = 100;
- ASSERT_TRUE( q.empty() );
+ ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0 );
// enqueue/dequeue
ASSERT_TRUE( q.enqueue( it ));
ASSERT_CONTAINER_SIZE( q, i + 1 );
}
- ASSERT_FALSE( q.empty() );
+ ASSERT_FALSE( q.empty());
ASSERT_CONTAINER_SIZE( q, nSize );
for ( size_t i = 0; i < nSize; ++i ) {
it = -1;
- ASSERT_TRUE( q.dequeue( it ) );
+ ASSERT_TRUE( q.dequeue( it ));
ASSERT_CONTAINER_SIZE( q, nSize - i - 1 );
- int nSegment = int( i / q.quasi_factor() );
- int nMin = nSegment * int( q.quasi_factor() );
- int nMax = nMin + int( q.quasi_factor() ) - 1;
+ int nSegment = int( i / q.quasi_factor());
+ int nMin = nSegment * int( q.quasi_factor());
+ int nMax = nMin + int( q.quasi_factor()) - 1;
EXPECT_LE( nMin, it );
EXPECT_LE( it, nMax );
}
- ASSERT_TRUE( q.empty() );
+ ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0 );
// push/pop
ASSERT_TRUE( q.push( it ));
ASSERT_CONTAINER_SIZE( q, i + 1 );
}
- ASSERT_FALSE( q.empty() );
+ ASSERT_FALSE( q.empty());
ASSERT_CONTAINER_SIZE( q, nSize );
size_t nPushed = nSize;
size_t nOffset = nPushed % q.quasi_factor();
for ( size_t i = 0; i < nSize; ++i ) {
it = -1;
- ASSERT_TRUE( q.pop( it ) );
+ ASSERT_TRUE( q.pop( it ));
ASSERT_CONTAINER_SIZE( q, nSize - i - 1 );
int nSegment = static_cast<int>((i + nPushed) / q.quasi_factor() - nStartSegment );
EXPECT_LE( nMin, it );
EXPECT_LE( it, nMax );
}
- ASSERT_TRUE( q.empty() );
+ ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0 );
// push/pop with lambda
ASSERT_EQ( it, -1 );
ASSERT_CONTAINER_SIZE( q, i + 1 );
}
- ASSERT_FALSE( q.empty() );
+ ASSERT_FALSE( q.empty());
ASSERT_CONTAINER_SIZE( q, nSize );
nPushed += nSize;
EXPECT_LE( nMin, it );
EXPECT_LE( it, nMax );
}
- ASSERT_TRUE( q.empty() );
+ ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0 );
// clear
for ( size_t i = 0; i < nSize; ++i ) {
- ASSERT_TRUE( q.push( static_cast<value_type>(i) ) );
+ ASSERT_TRUE( q.push( static_cast<value_type>(i)) );
}
- ASSERT_FALSE( q.empty() );
+ ASSERT_FALSE( q.empty());
ASSERT_CONTAINER_SIZE( q, nSize );
q.clear();
- ASSERT_TRUE( q.empty() );
+ ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0 );
// pop from empty queue
it = nSize * 2;
- ASSERT_FALSE( q.pop( it ) );
+ ASSERT_FALSE( q.pop( it ));
ASSERT_EQ( it, static_cast<value_type>( nSize * 2 ));
- ASSERT_TRUE( q.empty() );
+ ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0 );
- ASSERT_FALSE( q.dequeue( it ) );
+ ASSERT_FALSE( q.dequeue( it ));
ASSERT_EQ( it, static_cast<value_type>( nSize * 2 ));
- ASSERT_TRUE( q.empty() );
+ ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0 );
}
ASSERT_TRUE( q.emplace( str[i].c_str()));
ASSERT_CONTAINER_SIZE( q, i + 1 );
}
- ASSERT_FALSE( q.empty() );
+ ASSERT_FALSE( q.empty());
ASSERT_CONTAINER_SIZE( q, nSize );
{
std::string s;
auto f = [&s]( std::string& src ) {
- ASSERT_FALSE( src.empty() );
+ ASSERT_FALSE( src.empty());
s = std::move( src );
ASSERT_NE( s, src );
};
ASSERT_TRUE( s == str[0] || s == str[1] || s == str[2] );
}
}
- ASSERT_TRUE( q.empty() );
+ ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0 );
// move push
for ( size_t i = 0; i < nSize; ++i ) {
std::string s = str[i];
- ASSERT_FALSE( s.empty() );
+ ASSERT_FALSE( s.empty());
if ( i & 1 )
ASSERT_TRUE( q.enqueue( std::move( s )));
else
ASSERT_TRUE( q.push( std::move( s )));
- ASSERT_TRUE( s.empty() );
+ ASSERT_TRUE( s.empty());
ASSERT_CONTAINER_SIZE( q, i + 1 );
}
- ASSERT_FALSE( q.empty() );
+ ASSERT_FALSE( q.empty());
ASSERT_CONTAINER_SIZE( q, nSize );
for ( size_t i = 0; i < nSize; ++i ) {
std::string s;
- ASSERT_TRUE( q.pop( s ) );
+ ASSERT_TRUE( q.pop( s ));
ASSERT_CONTAINER_SIZE( q, nSize - i - 1 );
ASSERT_TRUE( s == str[0] || s == str[1] || s == str[2] );
}
- ASSERT_TRUE( q.empty() );
+ ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0 );
}