--- /dev/null
+/*
+ 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.
+*/
+
+#include <gtest/gtest.h>
+#include <cds/container/fcdeque.h>
+#include <boost/container/deque.hpp>
+
+namespace {
+
+ class FCDeque: public ::testing::Test
+ {
+ protected:
+ template <class Deque>
+ void test( Deque& dq )
+ {
+ size_t const c_nSize = 100;
+
+ // push_front/pop_front
+ for ( int i = 0; i < static_cast<int>( c_nSize ); ++i )
+ EXPECT_TRUE( dq.push_front( i ) );
+ EXPECT_EQ( dq.size(), c_nSize );
+
+ size_t nCount = 0;
+ int val;
+ while ( !dq.empty() ) {
+ EXPECT_TRUE( dq.pop_front( val ) );
+ ++nCount;
+ EXPECT_EQ( static_cast<int>(c_nSize - nCount), val );
+ }
+ EXPECT_EQ( nCount, c_nSize );
+
+ // push_back/pop_back
+ for ( int i = 0; i < static_cast<int>( c_nSize ); ++i )
+ EXPECT_TRUE( dq.push_back( i ) );
+ EXPECT_EQ( dq.size(), c_nSize );
+
+ nCount = 0;
+ while ( !dq.empty() ) {
+ EXPECT_TRUE( dq.pop_back( val ) );
+ ++nCount;
+ EXPECT_EQ( static_cast<int>(c_nSize - nCount), val );
+ }
+ EXPECT_EQ( nCount, c_nSize );
+
+ // push_back/pop_front
+ for ( int i = 0; i < static_cast<int>( c_nSize ); ++i )
+ EXPECT_TRUE( dq.push_back( i ) );
+ EXPECT_EQ( dq.size(), c_nSize );
+
+ nCount = 0;
+ while ( !dq.empty() ) {
+ EXPECT_TRUE( dq.pop_front( val ) );
+ EXPECT_EQ( static_cast<int>( nCount ), val );
+ ++nCount;
+ }
+ EXPECT_EQ( nCount, c_nSize );
+
+ // push_front/pop_back
+ for ( int i = 0; i < static_cast<int>( c_nSize ); ++i )
+ EXPECT_TRUE( dq.push_front( i ) );
+ EXPECT_EQ( dq.size(), c_nSize );
+
+ nCount = 0;
+ while ( !dq.empty() ) {
+ EXPECT_TRUE( dq.pop_back( val ) );
+ EXPECT_EQ( static_cast<int>( nCount ), val );
+ ++nCount;
+ }
+ EXPECT_EQ( nCount, c_nSize );
+
+ // clear
+ for ( int i = 0; i < static_cast<int>( c_nSize ); ++i )
+ EXPECT_TRUE( dq.push_front( i ) );
+ EXPECT_EQ( dq.size(), c_nSize );
+
+ EXPECT_FALSE( dq.empty() );
+ dq.clear();
+ EXPECT_TRUE( dq.empty() );
+ }
+ };
+
+ TEST_F( FCDeque, std )
+ {
+ typedef cds::container::FCDeque<int> deque_type;
+
+ deque_type dq;
+ test( dq );
+ }
+
+ TEST_F( FCDeque, std_elimination )
+ {
+ typedef cds::container::FCDeque<int, std::deque<int>,
+ cds::container::fcdeque::make_traits<
+ cds::opt::enable_elimination< true >
+ >::type
+ > deque_type;
+
+ deque_type dq;
+ test( dq );
+ }
+
+ TEST_F( FCDeque, std_statistics )
+ {
+ typedef cds::container::FCDeque<int, std::deque<int>,
+ cds::container::fcdeque::make_traits<
+ cds::opt::stat< cds::container::fcdeque::stat<> >
+ >::type
+ > deque_type;
+
+ deque_type dq;
+ test( dq );
+ }
+
+ TEST_F( FCDeque, std_mutex )
+ {
+ struct deque_traits : public
+ cds::container::fcdeque::make_traits<
+ cds::opt::enable_elimination< true >
+ >::type
+ {
+ typedef std::mutex lock_type;
+ };
+ typedef cds::container::FCDeque<int, std::deque<int>, deque_traits > deque_type;
+
+ deque_type dq;
+ test( dq );
+ }
+
+ TEST_F( FCDeque, boost )
+ {
+ typedef cds::container::FCDeque<int, boost::container::deque<int> > deque_type;
+
+ deque_type dq;
+ test( dq );
+ }
+
+ TEST_F( FCDeque, boost_elimination )
+ {
+ typedef cds::container::FCDeque<int, boost::container::deque<int>,
+ cds::container::fcdeque::make_traits<
+ cds::opt::enable_elimination< true >
+ >::type
+ > deque_type;
+
+ deque_type dq;
+ test( dq );
+ }
+
+ TEST_F( FCDeque, boost_statistics )
+ {
+ typedef cds::container::FCDeque<int, boost::container::deque<int>,
+ cds::container::fcdeque::make_traits<
+ cds::opt::stat< cds::container::fcdeque::stat<> >
+ >::type
+ > deque_type;
+
+ deque_type dq;
+ test( dq );
+ }
+
+ TEST_F( FCDeque, boost_mutex )
+ {
+ typedef cds::container::FCDeque<int, boost::container::deque<int>,
+ cds::container::fcdeque::make_traits<
+ cds::opt::enable_elimination< true >
+ ,cds::opt::lock_type< std::mutex >
+ >::type
+ > deque_type;
+
+ deque_type dq;
+ test( dq );
+ }
+
+} // namespace