op_push_back_move, ///< Push back (move semantics)
op_pop_front, ///< Pop front
op_pop_back, ///< Pop back
- op_clear ///< Clear
+ op_clear, ///< Clear
+ op_empty ///< Empty
};
/// Flat combining publication list record
/**
If the combining is in process the function waits while combining done.
*/
- bool empty() const
+ bool empty()
{
- m_FlatCombining.wait_while_combining();
- return m_Deque.empty();
+ fc_record * pRec = m_FlatCombining.acquire_record();
+
+ if ( c_bEliminationEnabled )
+ m_FlatCombining.batch_combine( op_empty, pRec, *this );
+ else
+ m_FlatCombining.combine( op_empty, pRec, *this );
+
+ assert( pRec->is_done() );
+ m_FlatCombining.release_record( pRec );
+ return pRec->bEmpty;
}
/// Internal statistics
while ( !m_Deque.empty() )
m_Deque.pop_front();
break;
+ case op_empty:
+ pRec->bEmpty = m_Deque.empty();
+ break;
default:
assert(false);
break;
op_push = cds::algo::flat_combining::req_Operation,
op_push_move,
op_pop,
- op_clear
+ op_clear,
+ op_empty
};
// Flat combining publication list record
/**
If the combining is in process the function waits while combining done.
*/
- bool empty() const
+ bool empty()
{
- m_FlatCombining.wait_while_combining();
- return m_PQueue.empty();
+ fc_record * pRec = m_FlatCombining.acquire_record();
+
+ m_FlatCombining.combine( op_empty, pRec, *this );
+ assert( pRec->is_done() );
+ m_FlatCombining.release_record( pRec );
+ return pRec->bEmpty;
}
/// Internal statistics
while ( !m_PQueue.empty() )
m_PQueue.pop();
break;
+ case op_empty:
+ pRec->bEmpty = m_PQueue.empty();
+ break;
default:
assert(false);
break;
/// Queue operation IDs
enum fc_operation {
op_enq = cds::algo::flat_combining::req_Operation, ///< Enqueue
- op_enq_move, ///< Enqueue (move semantics)
+ op_enq_move, ///< Enqueue (move semantics)
op_deq, ///< Dequeue
- op_clear ///< Clear
+ op_clear, ///< Clear
+ op_empty ///< Empty
};
/// Flat combining publication list record
/**
If the combining is in process the function waits while combining done.
*/
- bool empty() const
+ bool empty()
{
- m_FlatCombining.wait_while_combining();
- return m_Queue.empty();
+ fc_record * pRec = m_FlatCombining.acquire_record();
+
+ if ( c_bEliminationEnabled )
+ m_FlatCombining.batch_combine( op_empty, pRec, *this );
+ else
+ m_FlatCombining.combine( op_empty, pRec, *this );
+
+ assert( pRec->is_done() );
+ m_FlatCombining.release_record( pRec );
+ return pRec->bEmpty;
}
/// Internal statistics
while ( !m_Queue.empty() )
m_Queue.pop();
break;
+ case op_empty:
+ pRec->bEmpty = m_Queue.empty();
+ break;
default:
assert(false);
break;
op_push = cds::algo::flat_combining::req_Operation, ///< Push
op_push_move, ///< Push (move semantics)
op_pop, ///< Pop
- op_clear ///< Clear
+ op_clear, ///< Clear
+ op_empty ///< Empty
};
/// Flat combining publication list record
/**
If the combining is in process the function waits while combining done.
*/
- bool empty() const
+ bool empty()
{
- m_FlatCombining.wait_while_combining();
- return m_Stack.empty();
+ fc_record * pRec = m_FlatCombining.acquire_record();
+
+ if ( c_bEliminationEnabled )
+ m_FlatCombining.batch_combine( op_empty, pRec, *this );
+ else
+ m_FlatCombining.combine( op_empty, pRec, *this );
+
+ assert( pRec->is_done() );
+ m_FlatCombining.release_record( pRec );
+ return pRec->bEmpty;
}
/// Internal statistics
while ( !m_Stack.empty() )
m_Stack.pop();
break;
+ case op_empty:
+ pRec->bEmpty = m_Stack.empty();
+ break;
default:
assert(false);
break;