for ( size_t i = 0; i < nSize; ++i )
arr[i].nVal = static_cast<int>(i);
- ASSERT_TRUE( q.empty() );
+ ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0 );
// pop from empty queue
pv = q.pop();
ASSERT_TRUE( pv == nullptr );
- ASSERT_TRUE( q.empty() );
+ ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0 );
pv =q.dequeue();
ASSERT_TRUE( pv == nullptr );
- ASSERT_TRUE( q.empty() );
+ ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0 );
// push/pop test
}
for ( size_t i = 0; i < nSize; ++i ) {
- ASSERT_FALSE( q.empty() );
+ ASSERT_FALSE( q.empty());
ASSERT_CONTAINER_SIZE( q, nSize - i );
if ( i & 1 )
pv = q.pop();
ASSERT_FALSE( pv == nullptr );
ASSERT_EQ( pv->nVal, static_cast<int>(i));
}
- ASSERT_TRUE( q.empty() );
+ ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0 );
Queue::gc::scan();
for ( size_t i = 0; i < nSize; ++i )
q.push( arr[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 );
Queue::gc::scan();