-//$$CDS-header$$
+/*
+ This file is a part of libcds - Concurrent Data Structures library
+
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+
+ Source code repo: http://github.com/khizmax/libcds/
+ Download: http://sourceforge.net/projects/libcds/files/
+
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice, this
+ list of conditions and the following disclaimer.
+
+ * Redistributions in binary form must reproduce the above copyright notice,
+ this list of conditions and the following disclaimer in the documentation
+ and/or other materials provided with the distribution.
+
+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+ OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
#ifndef CDSLIB_CONTAINER_FCDEQUE_H
#define CDSLIB_CONTAINER_FCDEQUE_H
assert( pRec->pValPop );
pRec->bEmpty = m_Deque.empty();
if ( !pRec->bEmpty ) {
- *(pRec->pValPop) = m_Deque.front();
+ *(pRec->pValPop) = std::move( m_Deque.front());
m_Deque.pop_front();
}
break;
assert( pRec->pValPop );
pRec->bEmpty = m_Deque.empty();
if ( !pRec->bEmpty ) {
- *(pRec->pValPop) = m_Deque.back();
+ *(pRec->pValPop) = std::move( m_Deque.back());
m_Deque.pop_back();
}
break;
for ( fc_iterator it = itBegin, itPrev = itEnd; it != itEnd; ++it ) {
switch ( it->op() ) {
case op_push_front:
+ if ( itPrev != itEnd
+ && (itPrev->op() == op_pop_front || (m_Deque.empty() && itPrev->op() == op_pop_back)) )
+ {
+ collide( *it, *itPrev );
+ itPrev = itEnd;
+ }
+ else
+ itPrev = it;
+ break;
case op_push_front_move:
if ( itPrev != itEnd
&& (itPrev->op() == op_pop_front || ( m_Deque.empty() && itPrev->op() == op_pop_back )))
{
- collide( *it, *itPrev );
+ collide_move( *it, *itPrev );
itPrev = itEnd;
}
else
itPrev = it;
break;
case op_push_back:
- case op_push_back_move:
if ( itPrev != itEnd
- && (itPrev->op() == op_pop_back || ( m_Deque.empty() && itPrev->op() == op_pop_front )))
+ && (itPrev->op() == op_pop_back || (m_Deque.empty() && itPrev->op() == op_pop_front)) )
{
collide( *it, *itPrev );
itPrev = itEnd;
else
itPrev = it;
break;
- case op_pop_front:
+ case op_push_back_move:
if ( itPrev != itEnd
- && ( itPrev->op() == op_push_front || itPrev->op() == op_push_front_move
- || ( m_Deque.empty() && ( itPrev->op() == op_push_back || itPrev->op() == op_push_back_move ))))
+ && (itPrev->op() == op_pop_back || ( m_Deque.empty() && itPrev->op() == op_pop_front )))
{
- collide( *itPrev, *it );
+ collide_move( *it, *itPrev );
itPrev = itEnd;
}
else
itPrev = it;
break;
+ case op_pop_front:
+ if ( itPrev != itEnd ) {
+ if ( m_Deque.empty() ) {
+ switch ( itPrev->op() ) {
+ case op_push_back:
+ collide( *itPrev, *it );
+ itPrev = itEnd;
+ break;
+ case op_push_back_move:
+ collide_move( *itPrev, *it );
+ itPrev = itEnd;
+ break;
+ default:
+ itPrev = it;
+ break;
+ }
+ }
+ else {
+ switch ( itPrev->op() ) {
+ case op_push_front:
+ collide( *itPrev, *it );
+ itPrev = itEnd;
+ break;
+ case op_push_front_move:
+ collide_move( *itPrev, *it );
+ itPrev = itEnd;
+ break;
+ default:
+ itPrev = it;
+ break;
+ }
+ }
+ }
+ else
+ itPrev = it;
+ break;
case op_pop_back:
- if ( itPrev != itEnd
- && ( itPrev->op() == op_push_back || itPrev->op() == op_push_back_move
- || ( m_Deque.empty() && ( itPrev->op() == op_push_front || itPrev->op() == op_push_front_move ))))
- {
- collide( *itPrev, *it );
- itPrev = itEnd;
+ if ( itPrev != itEnd ) {
+ if ( m_Deque.empty() ) {
+ switch ( itPrev->op() ) {
+ case op_push_front:
+ collide( *itPrev, *it );
+ itPrev = itEnd;
+ break;
+ case op_push_front_move:
+ collide_move( *itPrev, *it );
+ itPrev = itEnd;
+ break;
+ default:
+ itPrev = it;
+ break;
+ }
+ }
+ else {
+ switch ( itPrev->op() ) {
+ case op_push_back:
+ collide( *itPrev, *it );
+ itPrev = itEnd;
+ break;
+ case op_push_back_move:
+ collide_move( *itPrev, *it );
+ itPrev = itEnd;
+ break;
+ default:
+ itPrev = it;
+ break;
+ }
+ }
}
else
itPrev = it;
m_FlatCombining.operation_done( recPop );
m_FlatCombining.internal_statistics().onCollide();
}
+
+ void collide_move( fc_record& recPush, fc_record& recPop )
+ {
+ *(recPop.pValPop) = std::move( *(recPush.pValPush));
+ recPop.bEmpty = false;
+ m_FlatCombining.operation_done( recPush );
+ m_FlatCombining.operation_done( recPop );
+ m_FlatCombining.internal_statistics().onCollide();
+ }
//@endcond
};
projects / libcds.git / blobdiff