public:
/// Creates empty set
/**
- @param head_bits: 2<sup>head_bits</sup> specifies the size of head array, minimum is 4.
- @param array_bits: 2<sup>array_bits</sup> specifies the size of array node, minimum is 2.
+ @param head_bits - 2<sup>head_bits</sup> specifies the size of head array, minimum is 4.
+ @param array_bits - 2<sup>array_bits</sup> specifies the size of array node, minimum is 2.
Equation for \p head_bits and \p array_bits:
\code
/// Clears the set
/**
The function unlinks all items from the set.
- For any item <tt> @ref disposer</tt> is called
+ For any item <tt> @ref disposer </tt> is called
*/
void clear()
{
};
\endcode
- The <tt> @ref disposer</tt> specified in \p Traits is not called.
+ The <tt> @ref disposer </tt> specified in \p Traits is not called.
*/
template <typename Disposer>
void clear_and_dispose( Disposer oDisposer )
static inline property_stream& operator <<( property_stream& o, cds::intrusive::ellen_bintree::stat<> const& s )
{
return o
- //<< "\t\t Internal node allocated: " << ellen_bintree_pool::internal_node_counter::m_nAlloc.get() << "\n"
- //<< "\t\t Internal node freed: " << ellen_bintree_pool::internal_node_counter::m_nFree.get() << "\n"
+ // << "\t\t Internal node allocated: " << ellen_bintree_pool::internal_node_counter::m_nAlloc.get() << "\n"
+ // << "\t\t Internal node freed: " << ellen_bintree_pool::internal_node_counter::m_nFree.get() << "\n"
<< CDSSTRESS_STAT_OUT( s, m_nInternalNodeCreated )
<< CDSSTRESS_STAT_OUT( s, m_nInternalNodeDeleted )
<< CDSSTRESS_STAT_OUT( s, m_nUpdateDescCreated )
// enqueue/dequeue
for ( int i = 0; i < nSize; ++i ) {
ASSERT_TRUE( q.enqueue( value_type(i)));
- ASSERT_EQ( q.size(), i + 1 );
+ ASSERT_EQ( q.size(), static_cast<size_t>(i + 1));
}
ASSERT_FALSE( q.empty());
ASSERT_EQ( q.size(), nSize );