+++ /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_SET_H
-#define CDSTEST_HDR_ELLENBINTREE_SET_H
-
-#include "cppunit/cppunit_proxy.h"
-#include "size_check.h"
-#include <functional> // ref
-#include <algorithm>
-
-namespace tree {
- using misc::check_size;
-
- class EllenBinTreeSetHdrTest: 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 {
- key_type nKey;
- int nVal;
-
- stat_data stat;
-
- value_type()
- {}
-
- value_type( int key )
- : nKey( key )
- , nVal( key * 10 )
- {}
-
- value_type( int key, int v )
- : nKey( key )
- , nVal( v )
- {}
-
- value_type( std::pair<int,int> const& p )
- : nKey( p.first )
- , nVal( p.second )
- {}
- };
-
- struct key_extractor {
- void operator()( key_type& dest, value_type const& src ) const
- {
- dest = src.nKey;
- }
- };
-
- struct less {
- bool operator()( int k1, int k2 ) const
- {
- return k1 < k2;
- }
- bool operator()( value_type const& v1, value_type const& v2 ) const
- {
- return v1.nKey < v2.nKey;
- }
- bool operator()( value_type const& v, int k ) const
- {
- return v.nKey < k;
- }
- bool operator()( int k, value_type const& v ) const
- {
- return k < v.nKey;
- }
- bool operator()( std::pair<int,int> const& p, value_type& v ) const
- {
- return p.first < v.nKey;
- }
- bool operator()( value_type& v, std::pair<int,int> const& p ) const
- {
- return v.nKey < p.first;
- }
- bool operator()( std::pair<int,int> const& p, int v ) const
- {
- return p.first < v;
- }
- bool operator()( int v, std::pair<int,int> const& p ) const
- {
- return v < p.first;
- }
- };
-
- 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 );
- }
- int operator()( value_type const& v1, value_type const& v2 ) const
- {
- return cmp( v1.nKey, v2.nKey );
- }
- int operator()( value_type const& v, int k ) const
- {
- return cmp( v.nKey, k );
- }
- int operator()( int k, value_type const& v ) const
- {
- return cmp( k, v.nKey );
- }
- int operator()( std::pair<int,int> const& p, value_type& v ) const
- {
- return cmp( p.first, v.nKey );
- }
- int operator()( value_type& v, std::pair<int,int> const& p ) const
- {
- return cmp( v.nKey, p.first );
- }
- int operator()( std::pair<int,int> const& p, int v ) const
- {
- return cmp( p.first, v );
- }
- int operator()( int v, std::pair<int,int> const& p ) const
- {
- return cmp( v, p.first );
- }
- };
-
- 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:
- 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 find_functor
- {
- template <typename T>
- void operator()( value_type& i, T& /*val*/ )
- {
- ++i.stat.nFindFuncCall;
- }
- template <typename T>
- void operator()( value_type& i, T const& /*val*/ )
- {
- ++i.stat.nFindConstFuncCall;
- }
- };
-
- template <typename Item>
- struct copy_found
- {
- Item m_found;
-
- template <typename T>
- void operator()( Item& i, T& /*val*/ )
- {
- m_found = i;
- }
-
- void operator()( Item const& i )
- {
- m_found = i;
- }
- };
-
- struct insert_functor
- {
- template <typename Item>
- void operator()(Item& i )
- {
- i.nVal = i.nKey * 100;
- ++i.stat.nInsertFuncCall;
- }
- };
-
- template <typename Q>
- static void ensure_func( bool bNew, value_type& i, Q& /*val*/ )
- {
- if ( bNew )
- ++i.stat.nEnsureNewFuncCall;
- else
- ++i.stat.nEnsureExistFuncCall;
- }
-
- struct update_functor
- {
- template <typename Q>
- void operator()( bool bNew, value_type& i, Q& val )
- {
- ensure_func( bNew, i, val );
- }
- };
-
- struct extract_functor
- {
- int nKey;
-
- template <typename Q>
- void operator()( Q&, value_type& v )
- {
- nKey = v.nKey;
- }
- };
-
-
- protected:
- template <class Set>
- void test_with( Set& s)
- {
- value_type itm;
- int key;
-
- // insert/find test
- CPPUNIT_ASSERT( !s.contains( 10 ) );
- CPPUNIT_ASSERT( s.insert( 10 ));
- CPPUNIT_ASSERT( !s.empty() );
- CPPUNIT_ASSERT( check_size( s, 1 ));
- CPPUNIT_ASSERT( s.contains( 10 ) );
-
- CPPUNIT_ASSERT( !s.insert( 10 ));
- CPPUNIT_ASSERT( !s.empty() );
- CPPUNIT_ASSERT( check_size( s, 1 ));
-
- CPPUNIT_ASSERT( !s.contains( 20, less() ) );
- CPPUNIT_ASSERT( s.insert( std::make_pair(20, 25) ));
- CPPUNIT_ASSERT( !s.empty() );
- CPPUNIT_ASSERT( check_size( s, 2 ));
- CPPUNIT_ASSERT( s.contains( 10, less() ) );
- CPPUNIT_ASSERT( s.contains( key = 20 ) );
- CPPUNIT_ASSERT( s.find_with( key, less(), find_functor() ) );
- {
- copy_found<value_type> f;
- f.m_found.nKey = 0;
- key = 20;
- CPPUNIT_ASSERT( s.find( key, std::ref( f ) ) );
- CPPUNIT_ASSERT( f.m_found.nKey == 20 );
- CPPUNIT_ASSERT( f.m_found.nVal == 25 );
- CPPUNIT_ASSERT( f.m_found.stat.nFindFuncCall == 1 );
- CPPUNIT_ASSERT( f.m_found.stat.nFindConstFuncCall == 0 );
- }
- CPPUNIT_ASSERT( s.find( key, find_functor() ) );
- {
- copy_found<value_type> f;
- f.m_found.nKey = 0;
- key = 20;
- CPPUNIT_ASSERT( s.find_with( key, less(), std::ref( f ) ) );
- CPPUNIT_ASSERT( f.m_found.nKey == 20 );
- CPPUNIT_ASSERT( f.m_found.nVal == 25 );
- CPPUNIT_ASSERT( f.m_found.stat.nFindFuncCall == 2 );
- CPPUNIT_ASSERT( f.m_found.stat.nFindConstFuncCall == 0 );
- }
- CPPUNIT_ASSERT( s.find( 20, find_functor() ) );
- {
- copy_found<value_type> f;
- f.m_found.nKey = 0;
- CPPUNIT_ASSERT( s.find_with( 20, less(), std::ref( f ) ) );
- CPPUNIT_ASSERT( f.m_found.nKey == 20 );
- CPPUNIT_ASSERT( f.m_found.nVal == 25 );
- CPPUNIT_ASSERT( f.m_found.stat.nFindFuncCall == 2 );
- CPPUNIT_ASSERT( f.m_found.stat.nFindConstFuncCall == 1 );
- }
-
- CPPUNIT_ASSERT( !s.empty() );
- CPPUNIT_ASSERT( check_size( s, 2 ));
-
- CPPUNIT_ASSERT( !s.contains( 25 ) );
- CPPUNIT_ASSERT( s.insert( std::make_pair(25, -1), insert_functor() ));
- CPPUNIT_ASSERT( !s.empty() );
- CPPUNIT_ASSERT( check_size( s, 3 ));
- {
- copy_found<value_type> f;
- f.m_found.nKey = 0;
- key = 25;
- CPPUNIT_ASSERT( s.find( key, std::ref( f ) ) );
- CPPUNIT_ASSERT( f.m_found.nKey == 25 );
- CPPUNIT_ASSERT( f.m_found.nVal == 2500 );
- CPPUNIT_ASSERT( f.m_found.stat.nInsertFuncCall == 1 );
- }
-
- // update test
- key = 10;
- {
- copy_found<value_type> f;
- f.m_found.nKey = 0;
- CPPUNIT_ASSERT( s.find( key, std::ref( f ) ) );
- CPPUNIT_ASSERT( f.m_found.nKey == 10 );
- CPPUNIT_ASSERT( f.m_found.nVal == 100 );
- CPPUNIT_ASSERT( f.m_found.stat.nEnsureExistFuncCall == 0 );
- CPPUNIT_ASSERT( f.m_found.stat.nEnsureNewFuncCall == 0 );
- }
- std::pair<bool, bool> updateResult = s.update( key, update_functor(), false );
- CPPUNIT_ASSERT( updateResult.first && !updateResult.second );
- CPPUNIT_ASSERT( !s.empty() );
- CPPUNIT_ASSERT( check_size( s, 3 ));
- {
- copy_found<value_type> f;
- f.m_found.nKey = 0;
- CPPUNIT_ASSERT( s.find( key, std::ref( f ) ) );
- CPPUNIT_ASSERT( f.m_found.nKey == 10 );
- CPPUNIT_ASSERT( f.m_found.nVal == 100 );
- CPPUNIT_ASSERT( f.m_found.stat.nEnsureExistFuncCall == 1 );
- CPPUNIT_ASSERT( f.m_found.stat.nEnsureNewFuncCall == 0 );
- }
-
- updateResult = s.update( std::make_pair(13, 1300), update_functor(), false );
- CPPUNIT_ASSERT( !updateResult.first && !updateResult.second );
- updateResult = s.update( std::make_pair(13, 1300), update_functor());
- CPPUNIT_ASSERT( updateResult.first && updateResult.second );
- CPPUNIT_ASSERT( !s.empty() );
- CPPUNIT_ASSERT( check_size( s, 4 ));
- {
- copy_found<value_type> f;
- f.m_found.nKey = 0;
- key = 13;
- CPPUNIT_ASSERT( s.find( key, std::ref( f ) ) );
- CPPUNIT_ASSERT( f.m_found.nKey == 13 );
- CPPUNIT_ASSERT( f.m_found.nVal == 1300 );
- CPPUNIT_ASSERT( f.m_found.stat.nEnsureExistFuncCall == 0 );
- CPPUNIT_ASSERT( f.m_found.stat.nEnsureNewFuncCall == 1 );
- }
-
- // erase test
- CPPUNIT_ASSERT( s.erase(13) );
- CPPUNIT_ASSERT( !s.contains( 13 ));
- CPPUNIT_ASSERT( !s.empty() );
- CPPUNIT_ASSERT( check_size( s, 3 ));
- CPPUNIT_ASSERT( !s.erase(13) );
- CPPUNIT_ASSERT( !s.empty() );
- CPPUNIT_ASSERT( check_size( s, 3 ));
-
- CPPUNIT_ASSERT( s.contains( 10 ));
- CPPUNIT_ASSERT( s.erase_with( 10, less() ));
- CPPUNIT_ASSERT( !s.contains( 10 ));
- CPPUNIT_ASSERT( !s.empty() );
- CPPUNIT_ASSERT( check_size( s, 2 ));
- CPPUNIT_ASSERT( !s.erase_with(10, less()) );
- CPPUNIT_ASSERT( !s.empty() );
- CPPUNIT_ASSERT( check_size( s, 2 ));
-
- CPPUNIT_ASSERT( s.contains(20) );
- {
- copy_found<value_type> f;
- f.m_found.nKey = 0;
- CPPUNIT_ASSERT( s.erase( 20, std::ref( f ) ) );
- CPPUNIT_ASSERT( f.m_found.nKey == 20 );
- CPPUNIT_ASSERT( f.m_found.nVal == 25 );
-
- CPPUNIT_ASSERT( s.insert(235))
- CPPUNIT_ASSERT( s.erase_with( 235, less(), std::ref( f ) ) );
- CPPUNIT_ASSERT( f.m_found.nKey == 235 );
- CPPUNIT_ASSERT( f.m_found.nVal == 2350 );
- }
- CPPUNIT_ASSERT( !s.contains( 20 ));
- CPPUNIT_ASSERT( !s.empty() );
- CPPUNIT_ASSERT( check_size( s, 1 ));
-
- s.clear();
- CPPUNIT_ASSERT( s.empty() );
- CPPUNIT_ASSERT( check_size( s, 0 ));
-
- // emplace test
- CPPUNIT_ASSERT( s.emplace( 151 )) ; // key = 151, val = 1510
- CPPUNIT_ASSERT( s.emplace( 174, 471 )) ; // key = 174, val = 471
- CPPUNIT_ASSERT( s.emplace( std::make_pair( 190, 91 ) )) ; // key == 190, val = 91
- CPPUNIT_ASSERT( !s.empty() );
- CPPUNIT_ASSERT( check_size( s, 3 ));
-
- CPPUNIT_ASSERT( s.contains(151));
- CPPUNIT_ASSERT( s.contains(174, less()));
- CPPUNIT_ASSERT( s.contains(190));
-
- {
- copy_found<value_type> f;
- f.m_found.nKey = 0;
- key = 151;
- CPPUNIT_ASSERT( s.find( key, std::ref( f ) ) );
- CPPUNIT_ASSERT( f.m_found.nKey == 151 );
- CPPUNIT_ASSERT( f.m_found.nVal == 1510 );
-
- key = 174;
- CPPUNIT_ASSERT( s.find( key, std::ref( f ) ) );
- CPPUNIT_ASSERT( f.m_found.nKey == 174 );
- CPPUNIT_ASSERT( f.m_found.nVal == 471 );
-
- key = 190;
- CPPUNIT_ASSERT( s.find( key, std::ref( f ) ) );
- CPPUNIT_ASSERT( f.m_found.nKey == 190 );
- CPPUNIT_ASSERT( f.m_found.nVal == 91 );
- }
-
- s.clear();
- CPPUNIT_ASSERT( s.empty() );
- CPPUNIT_ASSERT( check_size( s, 0 ));
- }
-
- template <typename Set>
- void fill_set( Set& 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 Set, class PrintStat>
- void test()
- {
- typedef Set set_type;
-
- set_type s;
-
- test_with( s );
-
- s.clear();
- CPPUNIT_ASSERT( s.empty() );
- CPPUNIT_ASSERT( check_size( s, 0 ));
-
- // extract min/max
- {
- typename Set::guarded_ptr gp;
-
- data_array arr;
- fill_set( s, arr );
-
- int i = 0;
- while ( !s.empty() ) {
- gp = s.extract_min();
- CPPUNIT_ASSERT( gp );
- CPPUNIT_ASSERT( gp->nKey == i );
- ++i;
- }
- CPPUNIT_ASSERT( s.empty() );
- CPPUNIT_ASSERT( check_size( s, 0 ));
-
- fill_set( s, arr );
- i = (int) c_nItemCount - 1;
- while ( !s.empty() ) {
- gp = s.extract_max();
- CPPUNIT_ASSERT( gp );
- CPPUNIT_ASSERT( gp->nKey == i );
- --i;
- }
- CPPUNIT_ASSERT( s.empty() );
- CPPUNIT_ASSERT( check_size( s, 0 ));
-
- fill_set( s, arr );
- for ( int i = 0; i < static_cast<int>( c_nItemCount ); ++i ) {
- int nKey = arr[i];
- gp = s.get( nKey );
- CPPUNIT_ASSERT( gp );
- CPPUNIT_ASSERT( !gp.empty());
- CPPUNIT_CHECK( gp->nKey == nKey );
-
- gp = s.extract( nKey );
- CPPUNIT_ASSERT( gp );
- CPPUNIT_ASSERT( !gp.empty());
- CPPUNIT_CHECK( gp->nKey == nKey );
-
- gp = s.get( nKey );
- CPPUNIT_CHECK( !gp );
- CPPUNIT_CHECK( gp.empty());
- CPPUNIT_CHECK( !s.extract( nKey ));
- CPPUNIT_CHECK( gp.empty());
- }
- CPPUNIT_ASSERT( s.empty() );
- CPPUNIT_ASSERT( check_size( s, 0 ));
-
- fill_set( s, arr );
- for ( int i = 0; i < static_cast<int>( c_nItemCount ); ++i ) {
- int nKey = arr[i];
- gp = s.get_with( wrapped_int( nKey ), wrapped_less() );
- CPPUNIT_ASSERT( gp );
- CPPUNIT_ASSERT( !gp.empty());
- CPPUNIT_CHECK( gp->nKey == nKey );
-
- gp = s.extract_with( wrapped_int( nKey ), wrapped_less() );
- CPPUNIT_ASSERT( gp );
- CPPUNIT_ASSERT( !gp.empty());
- CPPUNIT_CHECK( gp->nKey == nKey );
-
- gp = s.get_with( wrapped_int( nKey ), wrapped_less() );
- CPPUNIT_CHECK( !gp );
- CPPUNIT_CHECK( gp.empty());
- CPPUNIT_CHECK( !s.extract_with( wrapped_int(nKey), wrapped_less() ));
- CPPUNIT_CHECK( gp.empty());
- }
- CPPUNIT_ASSERT( s.empty() );
- CPPUNIT_ASSERT( check_size( s, 0 ));
- }
-
- PrintStat()( s );
- }
-
- template <class Set, class PrintStat>
- void test_rcu()
- {
- typedef Set set_type;
-
- set_type s;
-
- test_with( s );
-
- s.clear();
- CPPUNIT_ASSERT( s.empty() );
- CPPUNIT_ASSERT( check_size( s, 0 ));
-
- // extract min/max
- {
- typename set_type::exempt_ptr ep;
- data_array arr;
- fill_set( s, arr );
-
- int i = 0;
- value_type v;
- while ( !s.empty() ) {
- ep = s.extract_min();
- CPPUNIT_ASSERT( ep );
- CPPUNIT_ASSERT( !ep.empty());
- CPPUNIT_CHECK( ep->nKey == i );
- ++i;
- //ep.release();
- }
- ep.release();
- CPPUNIT_ASSERT( s.empty() );
- CPPUNIT_ASSERT( check_size( s, 0 ));
-
- fill_set( s, arr );
- i = (int) c_nItemCount - 1;
- while ( !s.empty() ) {
- ep = s.extract_max();
- CPPUNIT_ASSERT( ep );
- CPPUNIT_ASSERT( !ep.empty());
- CPPUNIT_CHECK( ep->nKey == i );
- --i;
- //ep.release();
- }
- ep.release();
- CPPUNIT_ASSERT( s.empty() );
- CPPUNIT_ASSERT( check_size( s, 0 ));
-
- fill_set( s, arr );
- for ( size_t i = 0; i < c_nItemCount; ++i ) {
- int nKey = arr[i];
- {
- typename set_type::rcu_lock l;
- value_type * p = s.get( nKey );
- CPPUNIT_ASSERT( p != nullptr );
- CPPUNIT_CHECK( p->nKey == nKey );
- }
- ep = s.extract( nKey );
- CPPUNIT_ASSERT( !ep.empty());
- CPPUNIT_CHECK( ep->nKey == nKey);
- //ep.release();
-
- {
- typename set_type::rcu_lock l;
- CPPUNIT_CHECK( s.get( nKey ) == nullptr );
- }
- ep = s.extract( nKey );
- CPPUNIT_CHECK( !ep );
- }
- CPPUNIT_ASSERT( s.empty() );
- CPPUNIT_ASSERT( check_size( s, 0 ));
-
- fill_set( s, arr );
- for ( size_t i = 0; i < c_nItemCount; ++i ) {
- int nKey = arr[i];
- {
- typename set_type::rcu_lock l;
- value_type * p = s.get_with( wrapped_int(nKey), wrapped_less() );
- CPPUNIT_ASSERT( p != nullptr );
- CPPUNIT_CHECK( p->nKey == nKey );
- }
- ep = s.extract_with( wrapped_int( nKey ), wrapped_less() );
- CPPUNIT_ASSERT( ep );
- CPPUNIT_ASSERT( !ep.empty());
- CPPUNIT_CHECK( ep->nKey == nKey);
- //ep.release();
-
- {
- typename set_type::rcu_lock l;
- CPPUNIT_CHECK( s.get_with( wrapped_int( nKey ), wrapped_less() ) == nullptr );
- }
- ep = s.extract_with( wrapped_int( nKey ), wrapped_less() );
- CPPUNIT_CHECK( !ep );
- }
- CPPUNIT_ASSERT( s.empty() );
- CPPUNIT_ASSERT( check_size( s, 0 ));
-
- }
-
- PrintStat()( s );
- }
-
- 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(EllenBinTreeSetHdrTest)
- 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_SET_H
projects / libcds.git / blobdiff