Skip to content

Commit

Permalink
formatting
Browse files Browse the repository at this point in the history
  • Loading branch information
@khizmax
khizmax committed Aug 29, 2017
1 parent c127b17 commit 9bcb218
Show file tree
Hide file tree
Showing 25 changed files with 54 additions and 54 deletions.
56 changes: 28 additions & 28 deletions cds/algo/bit_reversal.h
View file
Original file line number Diff line number Diff line change
Expand Up @@ -54,8 +54,8 @@ namespace cds { namespace algo {
/// 64bit
uint64_t operator()( uint64_t x ) const
{
return ( static_cast<uint64_t>( operator()( static_cast<uint32_t>( x )) ) << 32 ) // low 32bit
| ( static_cast<uint64_t>( operator()( static_cast<uint32_t>( x >> 32 )) )); // high 32bit
return ( static_cast<uint64_t>( operator()( static_cast<uint32_t>( x ))) << 32 ) // low 32bit
| ( static_cast<uint64_t>( operator()( static_cast<uint32_t>( x >> 32 )))); // high 32bit
}
};

Expand Down Expand Up @@ -93,8 +93,8 @@ namespace cds { namespace algo {
/// 64bit
uint64_t operator()( uint64_t x ) const
{
return ( static_cast<uint64_t>( operator()( static_cast<uint32_t>( x )) ) << 32 ) |
static_cast<uint64_t>( operator()( static_cast<uint32_t>( x >> 32 )) );
return ( static_cast<uint64_t>( operator()( static_cast<uint32_t>( x ))) << 32 ) |
static_cast<uint64_t>( operator()( static_cast<uint32_t>( x >> 32 )));
}
};

Expand All @@ -117,43 +117,43 @@ namespace cds { namespace algo {
// for 32bit architecture
static uint32_t muldiv32( uint32_t x )
{
return static_cast<uint32_t>( muldiv32_byte( static_cast<uint8_t>( x >> 24 )) )
| ( static_cast<uint32_t>( muldiv32_byte( static_cast<uint8_t>( x >> 16 )) ) << 8 )
| ( static_cast<uint32_t>( muldiv32_byte( static_cast<uint8_t>( x >> 8 )) ) << 16 )
| ( static_cast<uint32_t>( muldiv32_byte( static_cast<uint8_t>( x )) ) << 24 );
return static_cast<uint32_t>( muldiv32_byte( static_cast<uint8_t>( x >> 24 )))
| ( static_cast<uint32_t>( muldiv32_byte( static_cast<uint8_t>( x >> 16 ))) << 8 )
| ( static_cast<uint32_t>( muldiv32_byte( static_cast<uint8_t>( x >> 8 ))) << 16 )
| ( static_cast<uint32_t>( muldiv32_byte( static_cast<uint8_t>( x ))) << 24 );
}

static uint64_t muldiv32( uint64_t x )
{
return static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x >> 56 )) )
| ( static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x >> 48 )) ) << 8 )
| ( static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x >> 40 )) ) << 16 )
| ( static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x >> 32 )) ) << 24 )
| ( static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x >> 24 )) ) << 32 )
| ( static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x >> 16 )) ) << 40 )
| ( static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x >> 8 )) ) << 48 )
| ( static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x )) ) << 56 );
return static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x >> 56 )))
| ( static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x >> 48 ))) << 8 )
| ( static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x >> 40 ))) << 16 )
| ( static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x >> 32 ))) << 24 )
| ( static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x >> 24 ))) << 32 )
| ( static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x >> 16 ))) << 40 )
| ( static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x >> 8 ))) << 48 )
| ( static_cast<uint64_t>( muldiv32_byte( static_cast<uint8_t>( x ))) << 56 );
}

/// for 64bit architectire
static uint32_t muldiv64( uint32_t x )
{
return static_cast<uint32_t>( muldiv64_byte( static_cast<uint8_t>( x >> 24 )) )
| ( static_cast<uint32_t>( muldiv64_byte( static_cast<uint8_t>( x >> 16 )) ) << 8 )
| ( static_cast<uint32_t>( muldiv64_byte( static_cast<uint8_t>( x >> 8 )) ) << 16 )
| ( static_cast<uint32_t>( muldiv64_byte( static_cast<uint8_t>( x )) ) << 24 );
return static_cast<uint32_t>( muldiv64_byte( static_cast<uint8_t>( x >> 24 )))
| ( static_cast<uint32_t>( muldiv64_byte( static_cast<uint8_t>( x >> 16 ))) << 8 )
| ( static_cast<uint32_t>( muldiv64_byte( static_cast<uint8_t>( x >> 8 ))) << 16 )
| ( static_cast<uint32_t>( muldiv64_byte( static_cast<uint8_t>( x ))) << 24 );
}

static uint64_t muldiv64( uint64_t x )
{
return static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x >> 56 )) )
| ( static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x >> 48 )) ) << 8 )
| ( static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x >> 40 )) ) << 16 )
| ( static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x >> 32 )) ) << 24 )
| ( static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x >> 24 )) ) << 32 )
| ( static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x >> 16 )) ) << 40 )
| ( static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x >> 8 )) ) << 48 )
| ( static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x )) ) << 56 );
return static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x >> 56 )))
| ( static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x >> 48 ))) << 8 )
| ( static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x >> 40 ))) << 16 )
| ( static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x >> 32 ))) << 24 )
| ( static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x >> 24 ))) << 32 )
| ( static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x >> 16 ))) << 40 )
| ( static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x >> 8 ))) << 48 )
| ( static_cast<uint64_t>( muldiv64_byte( static_cast<uint8_t>( x ))) << 56 );
}
//@endcond

Expand Down
4 changes: 2 additions & 2 deletions cds/container/impl/bronson_avltree_map_rcu.h
View file
Original file line number Diff line number Diff line change
Expand Up @@ -1785,7 +1785,7 @@ namespace cds { namespace container {

int hLRL = height_null( child( pLRight, left_child, memory_model::memory_order_relaxed ), memory_model::memory_order_acquire );
int balance = hLL - hLRL;
if ( balance >= -1 && balance <= 1 && !( ( hLL == 0 || hLRL == 0 ) && !pLeft->is_valued( memory_model::memory_order_relaxed )) ) {
if ( balance >= -1 && balance <= 1 && !( ( hLL == 0 || hLRL == 0 ) && !pLeft->is_valued( memory_model::memory_order_relaxed ))) {
// nParent.child.left won't be damaged after a double rotation
return rotate_right_over_left_locked( pParent, pNode, pLeft, hR, hLL, pLRight, hLRL );
}
Expand Down Expand Up @@ -1840,7 +1840,7 @@ namespace cds { namespace container {
node_type * pRLRight = child( pRLeft, right_child, memory_model::memory_order_relaxed );
int hRLR = height_null( pRLRight, memory_model::memory_order_acquire );
int balance = hRR - hRLR;
if ( balance >= -1 && balance <= 1 && !( ( hRR == 0 || hRLR == 0 ) && !pRight->is_valued( memory_model::memory_order_relaxed )) )
if ( balance >= -1 && balance <= 1 && !( ( hRR == 0 || hRLR == 0 ) && !pRight->is_valued( memory_model::memory_order_relaxed )))
return rotate_left_over_right_locked( pParent, pNode, hL, pRight, pRLeft, hRR, hRLR );
}

Expand Down
4 changes: 2 additions & 2 deletions cds/gc/dhp.h
View file
Original file line number Diff line number Diff line change
Expand Up @@ -687,7 +687,7 @@ namespace cds { namespace gc {
@note Internally, %DHP depends on free-list implementation. There are
DCAS-based free-list \p cds::intrusive::TaggedFreeList and more complicated CAS-based free-list
\p cds::intrusive::FreeList. For x86 architecture and GCC/clang, libcds selects appropriate free-list
\p cds::intrusive::FreeList. For x86 architecture and GCC/clang, libcds selects appropriate free-list
based on \p -mcx16 compiler flag. You may manually disable DCAS support specifying
\p -DCDS_DISABLE_128BIT_ATOMIC for 64bit build or \p -DCDS_DISABLE_64BIT_ATOMIC for 32bit build
in compiler command line. All your projects and libcds MUST be compiled with the same flags -
Expand Down Expand Up @@ -1393,7 +1393,7 @@ namespace cds { namespace gc {
static void retire( T * p, void (* func)(void *))
{
dhp::thread_data* rec = dhp::smr::tls();
if ( !rec->retired_.push( dhp::retired_ptr( p, func )) )
if ( !rec->retired_.push( dhp::retired_ptr( p, func )))
dhp::smr::instance().scan( rec );
}

Expand Down
2 changes: 1 addition & 1 deletion src/dhp.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -118,7 +118,7 @@ namespace cds { namespace gc { namespace dhp {

CDS_EXPORT_API retired_allocator::~retired_allocator()
{
while ( retired_block* rb = static_cast<retired_block*>( free_list_.get()) ) {
while ( retired_block* rb = static_cast<retired_block*>( free_list_.get())) {
rb->~retired_block();
s_free_memory( rb );
}
Expand Down
2 changes: 1 addition & 1 deletion test/stress/map/del3/map_del3.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -125,6 +125,6 @@ namespace map {
}
INSTANTIATE_TEST_CASE_P( a, Map_Del3_LF, ::testing::ValuesIn( Map_Del3_LF::get_load_factors()), get_test_parameter_name );
#else
INSTANTIATE_TEST_CASE_P( a, Map_Del3_LF, ::testing::ValuesIn( Map_Del3_LF::get_load_factors()) );
INSTANTIATE_TEST_CASE_P( a, Map_Del3_LF, ::testing::ValuesIn( Map_Del3_LF::get_load_factors()));
#endif
} // namespace map
2 changes: 1 addition & 1 deletion test/stress/map/delodd/map_delodd.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -125,7 +125,7 @@ namespace map {
}
INSTANTIATE_TEST_CASE_P( a, Map_DelOdd_LF, ::testing::ValuesIn( Map_DelOdd_LF::get_load_factors()), get_test_parameter_name );
#else
INSTANTIATE_TEST_CASE_P( a, Map_DelOdd_LF, ::testing::ValuesIn( Map_DelOdd_LF::get_load_factors()) );
INSTANTIATE_TEST_CASE_P( a, Map_DelOdd_LF, ::testing::ValuesIn( Map_DelOdd_LF::get_load_factors()));
#endif

} // namespace map
2 changes: 1 addition & 1 deletion test/stress/map/find_string/map_find_string.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -202,7 +202,7 @@ namespace map {
}
INSTANTIATE_TEST_CASE_P( a, Map_find_string_LF, ::testing::ValuesIn( Map_find_string::get_load_factors()), get_test_parameter_name );
#else
INSTANTIATE_TEST_CASE_P( a, Map_find_string_LF, ::testing::ValuesIn( Map_find_string::get_load_factors()) );
INSTANTIATE_TEST_CASE_P( a, Map_find_string_LF, ::testing::ValuesIn( Map_find_string::get_load_factors()));
#endif


Expand Down
2 changes: 1 addition & 1 deletion test/stress/map/insdel_func/map_insdel_func.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -129,7 +129,7 @@ namespace map {
}
INSTANTIATE_TEST_CASE_P( a, Map_InsDel_func_LF, ::testing::ValuesIn( Map_InsDel_func_LF::get_load_factors()), get_test_parameter_name );
#else
INSTANTIATE_TEST_CASE_P( a, Map_InsDel_func_LF, ::testing::ValuesIn( Map_InsDel_func_LF::get_load_factors()) );
INSTANTIATE_TEST_CASE_P( a, Map_InsDel_func_LF, ::testing::ValuesIn( Map_InsDel_func_LF::get_load_factors()));
#endif

} // namespace map
2 changes: 1 addition & 1 deletion test/stress/map/insdel_item_int/map_insdel_item_int.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -114,7 +114,7 @@ namespace map {
}
INSTANTIATE_TEST_CASE_P( a, Map_InsDel_item_int_LF, ::testing::ValuesIn( Map_InsDel_item_int_LF::get_load_factors()), get_test_parameter_name );
#else
INSTANTIATE_TEST_CASE_P( a, Map_InsDel_item_int_LF, ::testing::ValuesIn( Map_InsDel_item_int_LF::get_load_factors()) );
INSTANTIATE_TEST_CASE_P( a, Map_InsDel_item_int_LF, ::testing::ValuesIn( Map_InsDel_item_int_LF::get_load_factors()));
#endif

} // namespace map
2 changes: 1 addition & 1 deletion test/stress/map/insdel_string/map_insdel_string.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -185,7 +185,7 @@ namespace map {
}
INSTANTIATE_TEST_CASE_P( a, Map_InsDel_string_LF, ::testing::ValuesIn( Map_InsDel_string::get_load_factors()), get_test_parameter_name );
#else
INSTANTIATE_TEST_CASE_P( a, Map_InsDel_string_LF, ::testing::ValuesIn( Map_InsDel_string::get_load_factors()) );
INSTANTIATE_TEST_CASE_P( a, Map_InsDel_string_LF, ::testing::ValuesIn( Map_InsDel_string::get_load_factors()));
#endif

} // namespace map
2 changes: 1 addition & 1 deletion test/stress/map/insdelfind/map_insdelfind.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -137,7 +137,7 @@ namespace map {
}
INSTANTIATE_TEST_CASE_P( a, Map_InsDelFind_LF, ::testing::ValuesIn( Map_InsDelFind_LF::get_load_factors()), get_test_parameter_name );
#else
INSTANTIATE_TEST_CASE_P( a, Map_InsDelFind_LF, ::testing::ValuesIn( Map_InsDelFind_LF::get_load_factors()) );
INSTANTIATE_TEST_CASE_P( a, Map_InsDelFind_LF, ::testing::ValuesIn( Map_InsDelFind_LF::get_load_factors()));
#endif

} // namespace map
2 changes: 1 addition & 1 deletion test/stress/map/iter_erase/map_iter_erase.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -111,7 +111,7 @@ namespace map {
}
INSTANTIATE_TEST_CASE_P( a, Map_Iter_Del3_LF, ::testing::ValuesIn( Map_Iter_Del3_LF::get_load_factors()), get_test_parameter_name );
#else
INSTANTIATE_TEST_CASE_P( a, Map_Iter_Del3_LF, ::testing::ValuesIn( Map_Iter_Del3_LF::get_load_factors()) );
INSTANTIATE_TEST_CASE_P( a, Map_Iter_Del3_LF, ::testing::ValuesIn( Map_Iter_Del3_LF::get_load_factors()));
#endif

} // namespace map
2 changes: 1 addition & 1 deletion test/stress/queue/intrusive_push_pop.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -522,7 +522,7 @@ namespace {
#else
INSTANTIATE_TEST_CASE_P( SQ,
intrusive_segmented_queue_push_pop,
::testing::ValuesIn( intrusive_segmented_queue_push_pop::get_test_parameters()) );
::testing::ValuesIn( intrusive_segmented_queue_push_pop::get_test_parameters()));
#endif


Expand Down
2 changes: 1 addition & 1 deletion test/stress/queue/pop.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -252,7 +252,7 @@ namespace {
#else
INSTANTIATE_TEST_CASE_P( SQ,
segmented_queue_pop,
::testing::ValuesIn( segmented_queue_pop::get_test_parameters()) );
::testing::ValuesIn( segmented_queue_pop::get_test_parameters()));
#endif


Expand Down
2 changes: 1 addition & 1 deletion test/stress/queue/push.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -255,7 +255,7 @@ namespace {
#else
INSTANTIATE_TEST_CASE_P( SQ,
segmented_queue_push,
::testing::ValuesIn( segmented_queue_push::get_test_parameters()) );
::testing::ValuesIn( segmented_queue_push::get_test_parameters()));
#endif


Expand Down
2 changes: 1 addition & 1 deletion test/stress/queue/push_pop.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -434,7 +434,7 @@ namespace {
#else
INSTANTIATE_TEST_CASE_P( SQ,
segmented_queue_push_pop,
::testing::ValuesIn( segmented_queue_push_pop::get_test_parameters()) );
::testing::ValuesIn( segmented_queue_push_pop::get_test_parameters()));
#endif

} // namespace
2 changes: 1 addition & 1 deletion test/stress/set/del3/set_del3.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -127,7 +127,7 @@ namespace set {
}
INSTANTIATE_TEST_CASE_P( a, Set_Del3_LF, ::testing::ValuesIn( Set_Del3_LF::get_load_factors()), get_test_parameter_name );
#else
INSTANTIATE_TEST_CASE_P( a, Set_Del3_LF, ::testing::ValuesIn( Set_Del3_LF::get_load_factors()) );
INSTANTIATE_TEST_CASE_P( a, Set_Del3_LF, ::testing::ValuesIn( Set_Del3_LF::get_load_factors()));
#endif

} // namespace set
2 changes: 1 addition & 1 deletion test/stress/set/delodd/set_delodd.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -126,6 +126,6 @@ namespace set {
}
INSTANTIATE_TEST_CASE_P( a, Set_DelOdd_LF, ::testing::ValuesIn( Set_DelOdd_LF::get_load_factors()), get_test_parameter_name );
#else
INSTANTIATE_TEST_CASE_P( a, Set_DelOdd_LF, ::testing::ValuesIn( Set_DelOdd_LF::get_load_factors()) );
INSTANTIATE_TEST_CASE_P( a, Set_DelOdd_LF, ::testing::ValuesIn( Set_DelOdd_LF::get_load_factors()));
#endif
} // namespace set
2 changes: 1 addition & 1 deletion test/stress/set/insdel_find/set_insdelfind.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -130,7 +130,7 @@ namespace set {
}
INSTANTIATE_TEST_CASE_P( a, Set_InsDelFind_LF, ::testing::ValuesIn( Set_InsDelFind_LF::get_load_factors()), get_test_parameter_name );
#else
INSTANTIATE_TEST_CASE_P( a, Set_InsDelFind_LF, ::testing::ValuesIn( Set_InsDelFind_LF::get_load_factors()) );
INSTANTIATE_TEST_CASE_P( a, Set_InsDelFind_LF, ::testing::ValuesIn( Set_InsDelFind_LF::get_load_factors()));
#endif

} // namespace set
2 changes: 1 addition & 1 deletion test/stress/set/insdel_func/set_insdel_func.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -117,6 +117,6 @@ namespace set {
}
INSTANTIATE_TEST_CASE_P( a, Set_InsDel_func_LF, ::testing::ValuesIn( Set_InsDel_func_LF::get_load_factors()), get_test_parameter_name );
#else
INSTANTIATE_TEST_CASE_P( a, Set_InsDel_func_LF, ::testing::ValuesIn( Set_InsDel_func_LF::get_load_factors()) );
INSTANTIATE_TEST_CASE_P( a, Set_InsDel_func_LF, ::testing::ValuesIn( Set_InsDel_func_LF::get_load_factors()));
#endif
} // namespace set
2 changes: 1 addition & 1 deletion test/stress/set/insdel_string/set_insdel_string.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -121,7 +121,7 @@ namespace set {
}
INSTANTIATE_TEST_CASE_P( a, Set_InsDel_string_LF, ::testing::ValuesIn( Set_InsDel_string_LF::get_load_factors()), get_test_parameter_name );
#else
INSTANTIATE_TEST_CASE_P( a, Set_InsDel_string_LF, ::testing::ValuesIn( Set_InsDel_string_LF::get_load_factors()) );
INSTANTIATE_TEST_CASE_P( a, Set_InsDel_string_LF, ::testing::ValuesIn( Set_InsDel_string_LF::get_load_factors()));
#endif


Expand Down
2 changes: 1 addition & 1 deletion test/stress/set/iter_erase/set_iter_erase.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -111,6 +111,6 @@ namespace set {
}
INSTANTIATE_TEST_CASE_P( a, Set_Iter_Del3_LF, ::testing::ValuesIn( Set_Iter_Del3_LF::get_load_factors()), get_test_parameter_name );
#else
INSTANTIATE_TEST_CASE_P( a, Set_Iter_Del3_LF, ::testing::ValuesIn( Set_Iter_Del3_LF::get_load_factors()) );
INSTANTIATE_TEST_CASE_P( a, Set_Iter_Del3_LF, ::testing::ValuesIn( Set_Iter_Del3_LF::get_load_factors()));
#endif
} // namespace set
2 changes: 1 addition & 1 deletion test/stress/set/iteration/set_iteration.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -121,6 +121,6 @@ namespace set {
}
INSTANTIATE_TEST_CASE_P( a, Set_Iteration_LF, ::testing::ValuesIn( Set_Iteration_LF::get_load_factors()), get_test_parameter_name );
#else
INSTANTIATE_TEST_CASE_P( a, Set_Iteration_LF, ::testing::ValuesIn( Set_Iteration_LF::get_load_factors()) );
INSTANTIATE_TEST_CASE_P( a, Set_Iteration_LF, ::testing::ValuesIn( Set_Iteration_LF::get_load_factors()));
#endif
} // namespace set
2 changes: 1 addition & 1 deletion test/unit/queue/vyukov_mpmc_queue.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -51,7 +51,7 @@ namespace {
// enqueue/dequeue
for ( unsigned pass = 0; pass < 3; ++pass ) {
for ( size_t i = 0; i < nSize; ++i ) {
ASSERT_TRUE( q.enqueue( static_cast<value_type>( i )) );
ASSERT_TRUE( q.enqueue( static_cast<value_type>( i )));
ASSERT_CONTAINER_SIZE( q, i + 1 );
}
ASSERT_FALSE( q.empty());
Expand Down
2 changes: 1 addition & 1 deletion test/unit/queue/weak_ringbuffer.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -70,7 +70,7 @@ namespace {
ASSERT_FALSE( q.full());
ASSERT_CONTAINER_SIZE( q, nArrCount * nArrSize );
for ( size_t i = nArrCount * nArrSize; i < nSize; ++i ) {
ASSERT_TRUE( q.enqueue( static_cast<value_type>( i )) );
ASSERT_TRUE( q.enqueue( static_cast<value_type>( i )));
}
}
ASSERT_TRUE( q.full());
Expand Down

0 comments on commit 9bcb218

Please sign in to comment.