+++ /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.
-*/
-
-#ifndef CDSTEST_HDR_ELLENBINTREE_MAP_H
-#define CDSTEST_HDR_ELLENBINTREE_MAP_H
-
-#include "cppunit/cppunit_proxy.h"
-#include "size_check.h"
-#include <functional> // ref
-#include <algorithm>
-
-namespace tree {
- using misc::check_size;
-
- class EllenBinTreeMapHdrTest: public CppUnitMini::TestCase
- {
- public:
- typedef int key_type;
-
- struct stat_data {
- size_t nInsertFuncCall;
- size_t nEnsureExistFuncCall;
- size_t nEnsureNewFuncCall;
- size_t nEraseFuncCall;
- size_t nFindFuncCall;
- size_t nFindConstFuncCall;
-
- stat_data()
- : nInsertFuncCall(0)
- , nEnsureExistFuncCall(0)
- , nEnsureNewFuncCall(0)
- , nEraseFuncCall(0)
- , nFindFuncCall(0)
- , nFindConstFuncCall(0)
- {}
- };
-
- struct value_type: public stat_data
- {
- int nVal;
-
- value_type()
- : nVal(0)
- {}
-
- value_type( int v )
- : nVal( v )
- {}
-
- value_type( value_type const& v )
- : nVal( v.nVal )
- {}
-
- value_type( value_type&& v )
- : nVal( v.nVal )
- {}
-
- value_type& operator=( int n )
- {
- nVal = n;
- return *this;
- }
-
- value_type& operator=( value_type const& v )
- {
- nVal = v.nVal;
- return *this;
- }
- };
-
- typedef std::pair<key_type const, value_type> pair_type;
-
- struct less {
- bool operator()( int k1, int k2 ) const
- {
- return k1 < k2;
- }
- };
-
- struct compare {
- int cmp( int k1, int k2 ) const
- {
- return k1 < k2 ? -1 : (k1 > k2 ? 1 : 0);
- }
- int operator()( int k1, int k2 ) const
- {
- return cmp( k1, k2 );
- }
- };
-
- struct wrapped_int {
- int nKey;
-
- wrapped_int( int n )
- : nKey(n)
- {}
- };
-
- struct wrapped_less
- {
- bool operator()( wrapped_int const& w, int n ) const
- {
- return w.nKey < n;
- }
- bool operator()( int n, wrapped_int const& w ) const
- {
- return n < w.nKey;
- }
- /*
- template <typename T>
- bool operator()( wrapped_int const& w, T const& v ) const
- {
- return w.nKey < v.nKey;
- }
- template <typename T>
- bool operator()( T const& v, wrapped_int const& w ) const
- {
- return v.nKey < w.nKey;
- }
- */
- };
-
- protected:
- template <typename Map>
- struct insert_functor
- {
- typedef typename Map::value_type pair_type;
-
- // insert ftor
- void operator()( pair_type& item )
- {
- item.second.nVal = item.first * 3;
- }
-
- // update ftor
- void operator()( bool bNew, pair_type& item )
- {
- if ( bNew )
- item.second.nVal = item.first * 2;
- else
- item.second.nVal = item.first * 5;
- }
- };
-
- struct check_value {
- int m_nExpected;
-
- check_value( int nExpected )
- : m_nExpected( nExpected )
- {}
-
- template <typename T>
- void operator ()( T& pair )
- {
- CPPUNIT_ASSERT_CURRENT( pair.second.nVal == m_nExpected );
- }
- template <typename T, typename Q>
- void operator ()( T& pair, Q )
- {
- CPPUNIT_ASSERT_CURRENT( pair.second.nVal == m_nExpected );
- }
- };
-
- struct extract_functor
- {
- int * m_pVal;
- void operator()( pair_type const& val )
- {
- *m_pVal = val.second.nVal;
- }
- };
-
- protected:
- static const size_t c_nItemCount = 10000;
-
- class data_array
- {
- int * pFirst;
- int * pLast;
-
- public:
- data_array()
- : pFirst( new int[c_nItemCount] )
- , pLast( pFirst + c_nItemCount )
- {
- int i = 0;
- for ( int * p = pFirst; p != pLast; ++p, ++i )
- *p = i;
-
- shuffle( pFirst, pLast );
- }
-
- ~data_array()
- {
- delete [] pFirst;
- }
-
- int operator[]( size_t i ) const
- {
- assert( i < size_t(pLast - pFirst) );
- return pFirst[i];
- }
- };
-
- struct extract_functor2
- {
- int nKey;
-
- template <typename Q>
- void operator()( Q&, pair_type& v )
- {
- nKey = v.first;
- }
- };
-
-
- protected:
-
- template <class Map>
- void test_with( Map& m )
- {
- std::pair<bool, bool> updateResult;
-
- // insert
- CPPUNIT_ASSERT( m.empty() );
- CPPUNIT_ASSERT( check_size( m, 0 ));
- CPPUNIT_ASSERT( !m.contains(25) );
- CPPUNIT_ASSERT( m.insert( 25 ) ) ; // value = 0
- CPPUNIT_ASSERT( m.contains(25) );
- CPPUNIT_ASSERT( !m.empty() );
- CPPUNIT_ASSERT( check_size( m, 1 ));
- CPPUNIT_ASSERT( m.contains(25) );
-
- CPPUNIT_ASSERT( !m.insert( 25 ) );
- CPPUNIT_ASSERT( !m.empty() );
- CPPUNIT_ASSERT( check_size( m, 1 ));
-
- CPPUNIT_ASSERT( !m.contains(10, less()) );
- CPPUNIT_ASSERT( m.insert( 10, 10 ) );
- CPPUNIT_ASSERT( !m.empty() );
- CPPUNIT_ASSERT( check_size( m, 2 ));
- CPPUNIT_ASSERT( m.contains(10, less()) );
-
- CPPUNIT_ASSERT( !m.insert( 10, 20 ) );
- CPPUNIT_ASSERT( !m.empty() );
- CPPUNIT_ASSERT( check_size( m, 2 ));
-
- CPPUNIT_ASSERT( !m.contains(30) );
- CPPUNIT_ASSERT( m.insert_with( 30, insert_functor<Map>() ) ) ; // value = 90
- CPPUNIT_ASSERT( !m.empty() );
- CPPUNIT_ASSERT( check_size( m, 3 ));
- CPPUNIT_ASSERT( m.contains(30) );
-
- CPPUNIT_ASSERT( !m.insert_with( 10, insert_functor<Map>() ) );
- CPPUNIT_ASSERT( !m.insert_with( 25, insert_functor<Map>() ) );
- CPPUNIT_ASSERT( !m.insert_with( 30, insert_functor<Map>() ) );
-
- // update (new key)
- CPPUNIT_ASSERT( !m.contains(27) );
- updateResult = m.update( 27, insert_functor<Map>(), false ) ; // value = 54
- CPPUNIT_ASSERT( !updateResult.first );
- CPPUNIT_ASSERT( !updateResult.second );
- CPPUNIT_ASSERT( !m.contains(27) );
- updateResult = m.update( 27, insert_functor<Map>(), true ) ; // value = 54
- CPPUNIT_ASSERT( updateResult.first );
- CPPUNIT_ASSERT( updateResult.second );
- CPPUNIT_ASSERT( m.contains(27) );
-
- // find test
- check_value chk(10);
- CPPUNIT_ASSERT( m.find( 10, std::ref(chk) ));
- chk.m_nExpected = 0;
- CPPUNIT_ASSERT( m.find_with( 25, less(), std::ref( chk ) ) );
- chk.m_nExpected = 90;
- CPPUNIT_ASSERT( m.find( 30, std::ref( chk ) ) );
- chk.m_nExpected = 54;
- CPPUNIT_ASSERT( m.find( 27, std::ref( chk ) ) );
-
- updateResult = m.update( 10, insert_functor<Map>() ) ; // value = 50
- CPPUNIT_ASSERT( updateResult.first );
- CPPUNIT_ASSERT( !updateResult.second );
- chk.m_nExpected = 50;
- CPPUNIT_ASSERT( m.find( 10, std::ref( chk ) ) );
-
- // erase test
- CPPUNIT_ASSERT( !m.contains(100) );
- CPPUNIT_ASSERT( !m.erase( 100 )) ; // not found
-
- CPPUNIT_ASSERT( m.contains(25) );
- CPPUNIT_ASSERT( check_size( m, 4 ));
- CPPUNIT_ASSERT( m.erase( 25 ));
- CPPUNIT_ASSERT( !m.empty() );
- CPPUNIT_ASSERT( check_size( m, 3 ));
- CPPUNIT_ASSERT( !m.contains(25) );
- CPPUNIT_ASSERT( !m.erase( 25 ));
-
- CPPUNIT_ASSERT( !m.contains(258) );
- CPPUNIT_ASSERT( m.insert(258))
- CPPUNIT_ASSERT( check_size( m, 4 ));
- CPPUNIT_ASSERT( m.contains(258, less()) );
- CPPUNIT_ASSERT( m.erase_with( 258, less() ));
- CPPUNIT_ASSERT( !m.empty() );
- CPPUNIT_ASSERT( check_size( m, 3 ));
- CPPUNIT_ASSERT( !m.contains(258) );
- CPPUNIT_ASSERT( !m.erase_with( 258, less() ));
-
- int nVal;
- extract_functor ext;
- ext.m_pVal = &nVal;
-
- CPPUNIT_ASSERT( !m.contains(29) );
- CPPUNIT_ASSERT( m.insert(29, 290));
- CPPUNIT_ASSERT( check_size( m, 4 ));
- CPPUNIT_ASSERT( m.erase_with( 29, less(), std::ref( ext ) ) );
- CPPUNIT_ASSERT( !m.empty() );
- CPPUNIT_ASSERT( check_size( m, 3 ));
- CPPUNIT_ASSERT( nVal == 290 );
- nVal = -1;
- CPPUNIT_ASSERT( !m.erase_with( 29, less(), std::ref( ext ) ) );
- CPPUNIT_ASSERT( nVal == -1 );
-
- CPPUNIT_ASSERT( m.erase( 30, std::ref( ext ) ) );
- CPPUNIT_ASSERT( !m.empty() );
- CPPUNIT_ASSERT( check_size( m, 2 ));
- CPPUNIT_ASSERT( nVal == 90 );
- nVal = -1;
- CPPUNIT_ASSERT( !m.erase( 30, std::ref( ext ) ) );
- CPPUNIT_ASSERT( nVal == -1 );
-
- m.clear();
- CPPUNIT_ASSERT( m.empty() );
- CPPUNIT_ASSERT( check_size( m, 0 ));
-
- // emplace test
- CPPUNIT_ASSERT( m.emplace(126) ) ; // key = 126, val = 0
- CPPUNIT_ASSERT( m.emplace(137, 731)) ; // key = 137, val = 731
- CPPUNIT_ASSERT( m.emplace( 149, value_type(941) )) ; // key = 149, val = 941
-
- CPPUNIT_ASSERT( !m.empty() );
- CPPUNIT_ASSERT( check_size( m, 3 ));
-
- chk.m_nExpected = 0;
- CPPUNIT_ASSERT( m.find( 126, std::ref(chk) ));
- chk.m_nExpected = 731;
- CPPUNIT_ASSERT( m.find_with( 137, less(), std::ref(chk) ));
- chk.m_nExpected = 941;
- CPPUNIT_ASSERT( m.find( 149, std::ref(chk) ));
-
- CPPUNIT_ASSERT( !m.emplace(126, 621)) ; // already in map
- chk.m_nExpected = 0;
- CPPUNIT_ASSERT( m.find( 126, std::ref(chk) ));
- CPPUNIT_ASSERT( !m.empty() );
- CPPUNIT_ASSERT( check_size( m, 3 ));
-
- m.clear();
- CPPUNIT_ASSERT( m.empty() );
- CPPUNIT_ASSERT( check_size( m, 0 ));
- }
-
- template <typename Map>
- void fill_map( Map& s, data_array& a )
- {
- CPPUNIT_ASSERT( s.empty() );
- for ( size_t i = 0; i < c_nItemCount; ++i ) {
- CPPUNIT_ASSERT( s.insert( a[i] ));
- }
- CPPUNIT_ASSERT( !s.empty() );
- CPPUNIT_ASSERT( check_size( s, c_nItemCount ));
- }
-
- template <class Map, class PrintStat>
- void test()
- {
- typedef Map map_type;
-
- map_type m;
-
- test_with( m );
-
- m.clear();
- CPPUNIT_ASSERT( m.empty() );
- CPPUNIT_ASSERT( check_size( m, 0 ));
-
- // extract min/max
- {
- typename map_type::guarded_ptr gp;
-
- data_array arr;
- fill_map( m, arr );
-
- int i = 0;
- std::pair<key_type, value_type> v;
- while ( !m.empty() ) {
- gp = m.extract_min();
- CPPUNIT_ASSERT( gp );
- CPPUNIT_ASSERT( !gp.empty());
- CPPUNIT_ASSERT( gp->first == i );
- ++i;
- }
- CPPUNIT_ASSERT( m.empty() );
- CPPUNIT_ASSERT( check_size( m, 0 ));
-
-
- fill_map( m, arr );
- i = (int) c_nItemCount - 1;
- while ( !m.empty() ) {
- gp = m.extract_max();
- CPPUNIT_ASSERT( gp );
- CPPUNIT_ASSERT( !gp.empty());
- CPPUNIT_ASSERT( gp->first == i );
- --i;
- }
- CPPUNIT_ASSERT( m.empty() );
- CPPUNIT_ASSERT( check_size( m, 0 ));
-
- fill_map( m, arr );
- for ( int i = 0; i < static_cast<int>( c_nItemCount ); ++i ) {
- int nKey = arr[i];
- gp = m.get( nKey );
- CPPUNIT_ASSERT( gp );
- CPPUNIT_ASSERT( !gp.empty());
- CPPUNIT_CHECK( gp->first == nKey );
-
- gp = m.extract( nKey );
- CPPUNIT_ASSERT( gp );
- CPPUNIT_ASSERT( !gp.empty());
- CPPUNIT_CHECK( gp->first == nKey );
-
- gp = m.get( nKey );
- CPPUNIT_CHECK( !gp );
- CPPUNIT_CHECK( gp.empty());
- CPPUNIT_CHECK( !m.extract( nKey ));
- CPPUNIT_CHECK( gp.empty());
- }
- CPPUNIT_ASSERT( m.empty() );
- CPPUNIT_ASSERT( check_size( m, 0 ));
-
- fill_map( m, arr );
- for ( int i = 0; i < static_cast<int>( c_nItemCount ); ++i ) {
- int nKey = arr[i];
- gp = m.get_with( wrapped_int( nKey ), wrapped_less() );
- CPPUNIT_ASSERT( gp );
- CPPUNIT_ASSERT( !gp.empty());
- CPPUNIT_CHECK( gp->first == nKey );
-
- gp = m.extract_with( wrapped_int( nKey ), wrapped_less() );
- CPPUNIT_ASSERT( gp );
- CPPUNIT_ASSERT( !gp.empty());
- CPPUNIT_CHECK( gp->first == nKey );
-
- gp = m.get_with( wrapped_int( nKey ), wrapped_less() );
- CPPUNIT_CHECK( !gp );
- CPPUNIT_CHECK( gp.empty());
- CPPUNIT_CHECK( !m.extract_with( wrapped_int(nKey), wrapped_less() ));
- CPPUNIT_CHECK( gp.empty());
- }
-
- CPPUNIT_ASSERT( m.empty() );
- CPPUNIT_ASSERT( check_size( m, 0 ));
- }
-
- PrintStat()( m );
- }
-
- template <class Map, class PrintStat>
- void test_rcu()
- {
- typedef Map map_type;
-
- map_type m;
-
- test_with( m );
-
- m.clear();
- CPPUNIT_ASSERT( m.empty() );
- CPPUNIT_ASSERT( check_size( m, 0 ));
-
- // extract min/max
- {
- typename map_type::exempt_ptr ep;
- data_array arr;
- fill_map( m, arr );
-
- int i = 0;
- while ( !m.empty() ) {
- ep = m.extract_min();
- CPPUNIT_ASSERT( ep );
- CPPUNIT_ASSERT( !ep.empty());
- CPPUNIT_ASSERT(ep->first == i );
- ++i;
- //ep.release();
- }
- CPPUNIT_ASSERT( m.empty() );
- CPPUNIT_ASSERT( check_size( m, 0 ));
- ep = m.extract_min();
- CPPUNIT_ASSERT( !ep );
- CPPUNIT_ASSERT( ep.empty());
-
- fill_map( m, arr );
- i = (int) c_nItemCount - 1;
- while ( !m.empty() ) {
- ep = m.extract_max();
- CPPUNIT_ASSERT( ep );
- CPPUNIT_ASSERT( !ep.empty());
- CPPUNIT_ASSERT( ep->first == i );
- --i;
- //ep.release();
- }
- CPPUNIT_ASSERT( m.empty() );
- CPPUNIT_ASSERT( check_size( m, 0 ));
- ep = m.extract_max();
- CPPUNIT_ASSERT( !ep );
- CPPUNIT_ASSERT( ep.empty());
-
- fill_map( m, arr );
- for ( size_t i = 0; i < c_nItemCount; ++i ) {
- int nKey = arr[i];
- {
- typename map_type::rcu_lock l;
- typename map_type::value_type * pVal = m.get(nKey);
- CPPUNIT_ASSERT( pVal != nullptr );
- CPPUNIT_CHECK( pVal->first == nKey);
- }
- ep = m.extract( nKey );
- CPPUNIT_ASSERT( ep );
- CPPUNIT_ASSERT( !ep.empty());
- CPPUNIT_CHECK( ep->first == nKey);
- //ep.release();
-
- ep = m.extract( nKey );
- CPPUNIT_ASSERT( !ep );
- CPPUNIT_ASSERT( ep.empty());
- {
- typename map_type::rcu_lock l;
- CPPUNIT_CHECK( !m.get(nKey));
- }
- }
- CPPUNIT_ASSERT( m.empty() );
- CPPUNIT_ASSERT( check_size( m, 0 ));
-
- fill_map( m, arr );
- for ( size_t i = 0; i < c_nItemCount; ++i ) {
- int nKey = arr[i];
- {
- typename map_type::rcu_lock l;
- typename map_type::value_type * pVal = m.get_with(wrapped_int(nKey), wrapped_less());
- CPPUNIT_ASSERT( pVal != nullptr );
- CPPUNIT_CHECK( pVal->first == nKey);
- }
- ep = m.extract_with( wrapped_int( nKey ), wrapped_less() );
- CPPUNIT_ASSERT( ep );
- CPPUNIT_ASSERT( !ep.empty());
- CPPUNIT_CHECK( ep->first == nKey);
- //ep.release();
-
- ep = m.extract_with( wrapped_int( nKey ), wrapped_less() );
- CPPUNIT_ASSERT( !ep );
- CPPUNIT_ASSERT( ep.empty());
- {
- typename map_type::rcu_lock l;
- CPPUNIT_CHECK( !m.get_with(wrapped_int(nKey), wrapped_less()));
- }
- }
- CPPUNIT_ASSERT( m.empty() );
- CPPUNIT_ASSERT( check_size( m, 0 ));
- }
-
- PrintStat()( m );
- }
-
- void EllenBinTree_hp_less();
- void EllenBinTree_hp_cmp();
- void EllenBinTree_hp_cmpless();
- void EllenBinTree_hp_less_ic();
- void EllenBinTree_hp_cmp_ic();
- void EllenBinTree_hp_less_stat();
- void EllenBinTree_hp_cmp_ic_stat();
- void EllenBinTree_hp_cmp_ic_stat_yield();
- void EllenBinTree_hp_less_pool();
- void EllenBinTree_hp_less_pool_ic_stat();
-
- void EllenBinTree_dhp_less();
- void EllenBinTree_dhp_cmp();
- void EllenBinTree_dhp_cmpless();
- void EllenBinTree_dhp_less_ic();
- void EllenBinTree_dhp_cmp_ic();
- void EllenBinTree_dhp_less_stat();
- void EllenBinTree_dhp_cmp_ic_stat();
- void EllenBinTree_dhp_cmp_ic_stat_yield();
- void EllenBinTree_dhp_less_pool();
- void EllenBinTree_dhp_less_pool_ic_stat();
-
- void EllenBinTree_rcu_gpi_less();
- void EllenBinTree_rcu_gpi_cmp();
- void EllenBinTree_rcu_gpi_cmpless();
- void EllenBinTree_rcu_gpi_less_ic();
- void EllenBinTree_rcu_gpi_cmp_ic();
- void EllenBinTree_rcu_gpi_less_stat();
- void EllenBinTree_rcu_gpi_cmp_ic_stat();
- void EllenBinTree_rcu_gpi_cmp_ic_stat_yield();
- void EllenBinTree_rcu_gpi_less_pool();
- void EllenBinTree_rcu_gpi_less_pool_ic_stat();
-
- void EllenBinTree_rcu_gpb_less();
- void EllenBinTree_rcu_gpb_cmp();
- void EllenBinTree_rcu_gpb_cmpless();
- void EllenBinTree_rcu_gpb_less_ic();
- void EllenBinTree_rcu_gpb_cmp_ic();
- void EllenBinTree_rcu_gpb_less_stat();
- void EllenBinTree_rcu_gpb_cmp_ic_stat();
- void EllenBinTree_rcu_gpb_cmp_ic_stat_yield();
- void EllenBinTree_rcu_gpb_less_pool();
- void EllenBinTree_rcu_gpb_less_pool_ic_stat();
-
- void EllenBinTree_rcu_gpt_less();
- void EllenBinTree_rcu_gpt_cmp();
- void EllenBinTree_rcu_gpt_cmpless();
- void EllenBinTree_rcu_gpt_less_ic();
- void EllenBinTree_rcu_gpt_cmp_ic();
- void EllenBinTree_rcu_gpt_less_stat();
- void EllenBinTree_rcu_gpt_cmp_ic_stat();
- void EllenBinTree_rcu_gpt_cmp_ic_stat_yield();
- void EllenBinTree_rcu_gpt_less_pool();
- void EllenBinTree_rcu_gpt_less_pool_ic_stat();
-
- void EllenBinTree_rcu_shb_less();
- void EllenBinTree_rcu_shb_cmp();
- void EllenBinTree_rcu_shb_cmpless();
- void EllenBinTree_rcu_shb_less_ic();
- void EllenBinTree_rcu_shb_cmp_ic();
- void EllenBinTree_rcu_shb_less_stat();
- void EllenBinTree_rcu_shb_cmp_ic_stat();
- void EllenBinTree_rcu_shb_cmp_ic_stat_yield();
- void EllenBinTree_rcu_shb_less_pool();
- void EllenBinTree_rcu_shb_less_pool_ic_stat();
-
- void EllenBinTree_rcu_sht_less();
- void EllenBinTree_rcu_sht_cmp();
- void EllenBinTree_rcu_sht_cmpless();
- void EllenBinTree_rcu_sht_less_ic();
- void EllenBinTree_rcu_sht_cmp_ic();
- void EllenBinTree_rcu_sht_less_stat();
- void EllenBinTree_rcu_sht_cmp_ic_stat();
- void EllenBinTree_rcu_sht_cmp_ic_stat_yield();
- void EllenBinTree_rcu_sht_less_pool();
- void EllenBinTree_rcu_sht_less_pool_ic_stat();
-
- CPPUNIT_TEST_SUITE(EllenBinTreeMapHdrTest)
- CPPUNIT_TEST(EllenBinTree_hp_less)
- CPPUNIT_TEST(EllenBinTree_hp_cmp)
- CPPUNIT_TEST(EllenBinTree_hp_less_stat)
- CPPUNIT_TEST(EllenBinTree_hp_cmpless)
- CPPUNIT_TEST(EllenBinTree_hp_less_ic)
- CPPUNIT_TEST(EllenBinTree_hp_cmp_ic)
- CPPUNIT_TEST(EllenBinTree_hp_cmp_ic_stat)
- CPPUNIT_TEST( EllenBinTree_hp_cmp_ic_stat_yield )
- CPPUNIT_TEST( EllenBinTree_hp_less_pool )
- CPPUNIT_TEST(EllenBinTree_hp_less_pool_ic_stat)
-
- CPPUNIT_TEST(EllenBinTree_dhp_less)
- CPPUNIT_TEST(EllenBinTree_dhp_cmp)
- CPPUNIT_TEST(EllenBinTree_dhp_less_stat)
- CPPUNIT_TEST(EllenBinTree_dhp_cmpless)
- CPPUNIT_TEST(EllenBinTree_dhp_less_ic)
- CPPUNIT_TEST(EllenBinTree_dhp_cmp_ic)
- CPPUNIT_TEST(EllenBinTree_dhp_cmp_ic_stat)
- CPPUNIT_TEST( EllenBinTree_dhp_cmp_ic_stat_yield )
- CPPUNIT_TEST( EllenBinTree_dhp_less_pool )
- CPPUNIT_TEST(EllenBinTree_dhp_less_pool_ic_stat)
-
- CPPUNIT_TEST(EllenBinTree_rcu_gpi_less)
- CPPUNIT_TEST(EllenBinTree_rcu_gpi_cmp)
- CPPUNIT_TEST(EllenBinTree_rcu_gpi_less_stat)
- CPPUNIT_TEST(EllenBinTree_rcu_gpi_cmpless)
- CPPUNIT_TEST(EllenBinTree_rcu_gpi_less_ic)
- CPPUNIT_TEST(EllenBinTree_rcu_gpi_cmp_ic)
- CPPUNIT_TEST(EllenBinTree_rcu_gpi_cmp_ic_stat)
- CPPUNIT_TEST( EllenBinTree_rcu_gpi_cmp_ic_stat_yield )
- CPPUNIT_TEST( EllenBinTree_rcu_gpi_less_pool )
- CPPUNIT_TEST(EllenBinTree_rcu_gpi_less_pool_ic_stat)
-
- CPPUNIT_TEST(EllenBinTree_rcu_gpb_less)
- CPPUNIT_TEST(EllenBinTree_rcu_gpb_cmp)
- CPPUNIT_TEST(EllenBinTree_rcu_gpb_less_stat)
- CPPUNIT_TEST(EllenBinTree_rcu_gpb_cmpless)
- CPPUNIT_TEST(EllenBinTree_rcu_gpb_less_ic)
- CPPUNIT_TEST(EllenBinTree_rcu_gpb_cmp_ic)
- CPPUNIT_TEST(EllenBinTree_rcu_gpb_cmp_ic_stat)
- CPPUNIT_TEST( EllenBinTree_rcu_gpb_cmp_ic_stat_yield )
- CPPUNIT_TEST( EllenBinTree_rcu_gpb_less_pool )
- CPPUNIT_TEST(EllenBinTree_rcu_gpb_less_pool_ic_stat)
-
- CPPUNIT_TEST(EllenBinTree_rcu_gpt_less)
- CPPUNIT_TEST(EllenBinTree_rcu_gpt_cmp)
- CPPUNIT_TEST(EllenBinTree_rcu_gpt_less_stat)
- CPPUNIT_TEST(EllenBinTree_rcu_gpt_cmpless)
- CPPUNIT_TEST(EllenBinTree_rcu_gpt_less_ic)
- CPPUNIT_TEST(EllenBinTree_rcu_gpt_cmp_ic)
- CPPUNIT_TEST(EllenBinTree_rcu_gpt_cmp_ic_stat)
- CPPUNIT_TEST( EllenBinTree_rcu_gpt_cmp_ic_stat_yield )
- CPPUNIT_TEST( EllenBinTree_rcu_gpt_less_pool )
- CPPUNIT_TEST(EllenBinTree_rcu_gpt_less_pool_ic_stat)
-
- CPPUNIT_TEST(EllenBinTree_rcu_shb_less)
- CPPUNIT_TEST(EllenBinTree_rcu_shb_cmp)
- CPPUNIT_TEST(EllenBinTree_rcu_shb_less_stat)
- CPPUNIT_TEST(EllenBinTree_rcu_shb_cmpless)
- CPPUNIT_TEST(EllenBinTree_rcu_shb_less_ic)
- CPPUNIT_TEST(EllenBinTree_rcu_shb_cmp_ic)
- CPPUNIT_TEST(EllenBinTree_rcu_shb_cmp_ic_stat)
- CPPUNIT_TEST( EllenBinTree_rcu_shb_cmp_ic_stat_yield )
- CPPUNIT_TEST( EllenBinTree_rcu_shb_less_pool )
- CPPUNIT_TEST(EllenBinTree_rcu_shb_less_pool_ic_stat)
-
- CPPUNIT_TEST(EllenBinTree_rcu_sht_less)
- CPPUNIT_TEST(EllenBinTree_rcu_sht_cmp)
- CPPUNIT_TEST(EllenBinTree_rcu_sht_less_stat)
- CPPUNIT_TEST(EllenBinTree_rcu_sht_cmpless)
- CPPUNIT_TEST(EllenBinTree_rcu_sht_less_ic)
- CPPUNIT_TEST(EllenBinTree_rcu_sht_cmp_ic)
- CPPUNIT_TEST(EllenBinTree_rcu_sht_cmp_ic_stat)
- CPPUNIT_TEST( EllenBinTree_rcu_sht_cmp_ic_stat_yield )
- CPPUNIT_TEST( EllenBinTree_rcu_sht_less_pool )
- CPPUNIT_TEST(EllenBinTree_rcu_sht_less_pool_ic_stat)
-
- CPPUNIT_TEST_SUITE_END()
-
- };
-} // namespace tree
-
-#endif // #ifndef CDSTEST_HDR_ELLENBINTREE_MAP_H
projects / libcds.git / blobdiff