+++ /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_SKIPLIST_MAP_H
-#define CDSTEST_HDR_SKIPLIST_MAP_H
-
-#include "map/hdr_map.h"
-
-namespace map {
-
- class SkipListMapHdrTest: public HashMapHdrTest
- {
- typedef HashMapHdrTest base_class;
- typedef base_class::other_item wrapped_item;
- typedef base_class::other_less wrapped_less;
-
- template <class Map, typename PrintStat >
- void test()
- {
- Map m;
- test_int_with( m );
-
- static int const nLimit = 10000;
- typedef typename Map::iterator set_iterator;
- typedef typename Map::const_iterator const_set_iterator;
-
- int nCount = 0;
- int nPrevKey = 0;
-
- // Test iterator - ascending order
- m.clear();
- CPPUNIT_ASSERT( m.empty() );
-
- for ( int i = 0; i < nLimit; ++i ) {
- CPPUNIT_ASSERT( m.insert(i, i) );
- }
- CPPUNIT_MSG( PrintStat()(m, "Iterator test, ascending insert order") );
-
- nCount = 0;
- nPrevKey = 0;
- for ( set_iterator it = m.begin(), itEnd = m.end(); it != itEnd; ++it ) {
- CPPUNIT_ASSERT( (*it).first == it->second.m_val );
- CPPUNIT_ASSERT( m.contains( it->first ));
- it->second.m_val = (*it).first * 2;
- ++nCount;
- if ( it != m.begin() ) {
- CPPUNIT_ASSERT( nPrevKey + 1 == it->first );
- }
- nPrevKey = it->first;
- }
- CPPUNIT_ASSERT( nCount == nLimit );
-
- nCount = 0;
- for ( const_set_iterator it = m.cbegin(), itEnd = m.cend(); it != itEnd; ++it ) {
- CPPUNIT_ASSERT( (*it).first * 2 == it->second.m_val );
- ++nCount;
- if ( it != m.cbegin() ) {
- CPPUNIT_ASSERT( nPrevKey + 1 == it->first );
- }
- nPrevKey = it->first;
- }
- CPPUNIT_ASSERT( nCount == nLimit );
-
- // Test iterator - descending order
- m.clear();
- CPPUNIT_ASSERT( m.empty() );
-
- for ( int i = nLimit; i > 0; --i ) {
- CPPUNIT_ASSERT( m.insert( i - 1, (i-1) * 2) );
- }
- CPPUNIT_MSG( PrintStat()(m, "Iterator test, descending insert order") );
-
- nCount = 0;
- nPrevKey = 0;
- for ( set_iterator it = m.begin(), itEnd = m.end(); it != itEnd; ++it ) {
- CPPUNIT_ASSERT( (*it).first * 2 == it->second.m_val );
- CPPUNIT_ASSERT( m.contains( it->first ));
- it->second.m_val = (*it).first;
- ++nCount;
- if ( it != m.begin() ) {
- CPPUNIT_ASSERT( nPrevKey + 1 == it->first );
- }
- nPrevKey = it->first;
- }
- CPPUNIT_ASSERT( nCount == nLimit );
-
- nCount = 0;
- for ( const_set_iterator it = m.cbegin(), itEnd = m.cend(); it != itEnd; ++it ) {
- CPPUNIT_ASSERT( (*it).first == it->second.m_val );
- ++nCount;
- if ( it != m.cbegin() ) {
- CPPUNIT_ASSERT( nPrevKey + 1 == it->first );
- }
- nPrevKey = it->first;
- }
- CPPUNIT_ASSERT( nCount == nLimit );
-
- // Test iterator - random order
- m.clear();
- CPPUNIT_ASSERT( m.empty() );
- {
- int nRand[nLimit];
- for ( int i = 0; i < nLimit; ++i ) {
- nRand[i] = i;
- }
- shuffle( nRand, nRand + nLimit );
-
- for ( int i = 0; i < nLimit; ++i ) {
- CPPUNIT_ASSERT( m.insert( nRand[i], nRand[i]) );
- }
- CPPUNIT_MSG( PrintStat()(m, "Iterator test, random insert order") );
- }
-
- nCount = 0;
- nPrevKey = 0;
- for ( set_iterator it = m.begin(), itEnd = m.end(); it != itEnd; ++it ) {
- CPPUNIT_ASSERT( (*it).first == it->second.m_val );
- CPPUNIT_ASSERT( m.contains( it->first ));
- it->second.m_val = (*it).first * 2;
- ++nCount;
- if ( it != m.begin() ) {
- CPPUNIT_ASSERT( nPrevKey + 1 == it->first );
- }
- nPrevKey = it->first;
- }
- CPPUNIT_ASSERT( nCount == nLimit );
-
- nCount = 0;
- for ( const_set_iterator it = m.cbegin(), itEnd = m.cend(); it != itEnd; ++it ) {
- CPPUNIT_ASSERT( (*it).first * 2 == it->second.m_val );
- ++nCount;
- if ( it != m.cbegin() ) {
- CPPUNIT_ASSERT( nPrevKey + 1 == it->first );
- }
- nPrevKey = it->first;
- }
- CPPUNIT_ASSERT( nCount == nLimit );
-
- {
- typename Map::guarded_ptr gp;
- int arrItem[nLimit];
- for ( int i = 0; i < nLimit; ++i )
- arrItem[i] = i;
- shuffle( arrItem, arrItem + nLimit );
-
- typedef base_class::less less;
-
- // extract/get
- for ( int i = 0; i < nLimit; ++i ) {
- int nKey = arrItem[i];
- gp = m.get( nKey );
- CPPUNIT_ASSERT( gp );
- CPPUNIT_ASSERT( !gp.empty());
- CPPUNIT_CHECK( gp->first == nKey );
- CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
- gp.release();
-
- gp = m.extract( nKey );
- CPPUNIT_ASSERT( gp );
- CPPUNIT_ASSERT( !gp.empty());
- CPPUNIT_CHECK( gp->first == nKey );
- CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
- gp.release();
-
- gp = m.get( nKey );
- CPPUNIT_CHECK( !gp );
- CPPUNIT_CHECK( !m.extract(nKey));
- CPPUNIT_CHECK( gp.empty());
- }
- CPPUNIT_ASSERT( m.empty());
-
- for ( int i = 0; i < nLimit; ++i )
- CPPUNIT_ASSERT( m.insert(arrItem[i], arrItem[i]*2) );
-
- // extract_with/get_with
- for ( int i = 0; i < nLimit; ++i ) {
- int nKey = arrItem[i];
- gp = m.get_with( wrapped_item( nKey ), wrapped_less());
- CPPUNIT_ASSERT( gp );
- CPPUNIT_ASSERT( !gp.empty());
- CPPUNIT_CHECK( gp->first == nKey );
- CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
- gp.release();
-
- gp = m.extract_with( wrapped_item( nKey ), wrapped_less());
- CPPUNIT_ASSERT( gp );
- CPPUNIT_ASSERT( !gp.empty());
- CPPUNIT_CHECK( gp->first == nKey );
- CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
- gp.release();
-
- gp = m.get_with( wrapped_item( nKey ), wrapped_less() );
- CPPUNIT_CHECK( !gp );
- CPPUNIT_CHECK( !m.extract_with( wrapped_item(nKey), wrapped_less()));
- CPPUNIT_CHECK( gp.empty());
- }
- CPPUNIT_ASSERT( m.empty());
-
- //extract_min
- for ( int i = 0; i < nLimit; ++i )
- CPPUNIT_ASSERT( m.insert(arrItem[i], arrItem[i]*2) );
-
- for ( int i = 0; i < nLimit; ++i ) {
- gp = m.extract_min();
- CPPUNIT_ASSERT( gp );
- CPPUNIT_ASSERT( !gp.empty());
- CPPUNIT_CHECK( gp->first == i );
- CPPUNIT_CHECK( gp->second.m_val == i * 2 );
- gp.release();
- CPPUNIT_CHECK( gp.empty());
- }
- CPPUNIT_CHECK( !m.extract_min());
-
- // extract_max
- for ( int i = 0; i < nLimit; ++i )
- CPPUNIT_ASSERT( m.insert(arrItem[i], arrItem[i]*2) );
-
- for ( int i = nLimit - 1; i >= 0; --i ) {
- gp = m.extract_max();
- CPPUNIT_ASSERT( gp );
- CPPUNIT_ASSERT( !gp.empty());
- CPPUNIT_CHECK( gp->first == i );
- CPPUNIT_CHECK( gp->second.m_val == i * 2 );
- gp.release();
- CPPUNIT_CHECK( gp.empty());
- }
- CPPUNIT_CHECK( !m.extract_max());
- CPPUNIT_CHECK( gp.empty());
- CPPUNIT_ASSERT( m.empty());
- }
-
- CPPUNIT_MSG( PrintStat()(m, nullptr) );
- }
-
- template <class Map, typename PrintStat >
- void test_nogc()
- {
- typedef typename Map::iterator iterator;
- typedef typename Map::const_iterator const_iterator;
-
- Map m;
-
- CPPUNIT_ASSERT( m.empty() );
- CPPUNIT_ASSERT( check_size( m, 0 ));
-
- CPPUNIT_ASSERT( m.contains(10) == m.end() );
- iterator it = m.insert( 10 );
- CPPUNIT_ASSERT( it != m.end() );
- CPPUNIT_ASSERT( it->first == 10 );
- CPPUNIT_ASSERT( it->second.m_val == 0 );
- CPPUNIT_ASSERT( !m.empty() );
- CPPUNIT_ASSERT( check_size( m, 1 ));
- CPPUNIT_ASSERT( m.contains(10) == it );
- CPPUNIT_ASSERT( it->first == 10 );
- CPPUNIT_ASSERT( it->second.m_val == 0 );
-
- CPPUNIT_ASSERT( m.contains(100) == m.end() );
- it = m.insert( 100, 200 );
- CPPUNIT_ASSERT( it != m.end() );
- CPPUNIT_ASSERT( !m.empty() );
- CPPUNIT_ASSERT( check_size( m, 2 ));
- CPPUNIT_ASSERT( m.contains(100) == it );
- CPPUNIT_ASSERT( it->first == 100 );
- CPPUNIT_ASSERT( it->second.m_val == 200 );
-
- CPPUNIT_ASSERT( m.contains(55) == m.end() );
- it = m.insert_with( 55, insert_functor<Map>() );
- CPPUNIT_ASSERT( it != m.end() );
- CPPUNIT_ASSERT( !m.empty() );
- CPPUNIT_ASSERT( check_size( m, 3 ));
- CPPUNIT_ASSERT( m.contains(55) == it );
- CPPUNIT_ASSERT( it->first == 55 );
- CPPUNIT_ASSERT( it->second.m_val == 55 * 3 );
-
- CPPUNIT_ASSERT( m.insert( 55 ) == m.end() );
- CPPUNIT_ASSERT( m.insert( 55, 10 ) == m.end() );
- CPPUNIT_ASSERT( m.insert_with( 55, insert_functor<Map>()) == m.end() );
-
- CPPUNIT_ASSERT( m.contains(10) != m.end() );
- std::pair<iterator, bool> updateResult = m.update( 10, false );
- CPPUNIT_ASSERT( updateResult.first != m.end() );
- CPPUNIT_ASSERT( !updateResult.second );
- CPPUNIT_ASSERT( !m.empty() );
- updateResult.first->second.m_val = updateResult.first->first * 5;
- CPPUNIT_ASSERT( check_size( m, 3 ));
- CPPUNIT_ASSERT( m.contains(10) == updateResult.first );
- it = m.contains( 10, typename base_class::less() );
- CPPUNIT_ASSERT( it != m.end() );
- CPPUNIT_ASSERT( it->second.m_val == 50 );
-
- CPPUNIT_ASSERT( m.contains(120, base_class::less()) == m.end() );
- updateResult = m.update(120, false);
- CPPUNIT_ASSERT(updateResult.first == m.end());
- CPPUNIT_ASSERT(!updateResult.second);
- updateResult = m.update( 120 );
- CPPUNIT_ASSERT( updateResult.first != m.end() );
- CPPUNIT_ASSERT( updateResult.second );
- CPPUNIT_ASSERT( !m.empty() );
- CPPUNIT_ASSERT( check_size( m, 4 ));
- updateResult.first->second.m_val = updateResult.first->first * 5;
- CPPUNIT_ASSERT( m.contains(120, base_class::less()) == updateResult.first );
- it = m.contains(120, base_class::less());
- CPPUNIT_ASSERT( it != m.end() );
- CPPUNIT_ASSERT( it->second.m_val == 120 * 5 );
-
- // emplace test
- it = m.emplace( 151 ) ; // key = 151, val = 0
- CPPUNIT_ASSERT( it != m.end() );
- CPPUNIT_ASSERT( it->first == 151 );
- CPPUNIT_ASSERT( it->second.m_val == 0 );
-
- it = m.emplace( 174, 471 ) ; // key == 174, val = 471
- CPPUNIT_ASSERT( it != m.end() );
- CPPUNIT_ASSERT( it->first == 174 );
- CPPUNIT_ASSERT( it->second.m_val == 471 );
-
- it = m.emplace( 190, value_type(91)) ; // key == 190, val = 19
- CPPUNIT_ASSERT( it != m.end() );
- CPPUNIT_ASSERT( it->first == 190 );
- CPPUNIT_ASSERT( it->second.m_val == 91 );
-
- it = m.emplace( 151, 1051 );
- CPPUNIT_ASSERT( it == m.end());
-
- it = m.contains( 174 );
- CPPUNIT_ASSERT( it != m.end() );
- CPPUNIT_ASSERT( it->first == 174 );
- CPPUNIT_ASSERT( it->second.m_val == 471 );
-
- it = m.contains( 190 );
- CPPUNIT_ASSERT( it != m.end() );
- CPPUNIT_ASSERT( it->first == 190 );
- CPPUNIT_ASSERT( it->second.m_val == 91 );
-
- it = m.contains( 151 );
- CPPUNIT_ASSERT( it != m.end() );
- CPPUNIT_ASSERT( it->first == 151 );
- CPPUNIT_ASSERT( it->second.m_val == 0 );
-
- m.clear();
- CPPUNIT_ASSERT( m.empty() );
- CPPUNIT_ASSERT( check_size( m, 0 ));
-
- // get_min test
- for ( int i = 500; i > 0; --i ) {
- CPPUNIT_ASSERT( m.insert( i, i * 2 ) != m.end() );
-
- typename Map::value_type * pVal = m.get_min();
- CPPUNIT_ASSERT( pVal != nullptr );
- CPPUNIT_CHECK( pVal->first == i );
- CPPUNIT_CHECK( pVal->second.m_val == i * 2 );
- }
- m.clear();
- CPPUNIT_ASSERT( m.empty() );
- CPPUNIT_ASSERT( check_size( m, 0 ));
- CPPUNIT_CHECK( m.get_min() == nullptr );
- CPPUNIT_CHECK( m.get_max() == nullptr );
-
- // iterator test
-
- for ( int i = 0; i < 500; ++i ) {
- CPPUNIT_ASSERT( m.insert( i, i * 2 ) != m.end() );
-
- typename Map::value_type * pVal = m.get_max();
- CPPUNIT_ASSERT( pVal != nullptr );
- CPPUNIT_CHECK( pVal->first == i );
- CPPUNIT_CHECK( pVal->second.m_val == i * 2 );
- }
- CPPUNIT_ASSERT( check_size( m, 500 ));
-
- for ( iterator it = m.begin(), itEnd = m.end(); it != itEnd; ++it ) {
- CPPUNIT_ASSERT( it->first * 2 == (*it).second.m_val );
- it->second = it->first;
- }
-
- Map const& refMap = m;
- for ( const_iterator it = refMap.begin(), itEnd = refMap.end(); it != itEnd; ++it ) {
- CPPUNIT_ASSERT( it->first == it->second.m_val );
- CPPUNIT_ASSERT( (*it).first == (*it).second.m_val );
- }
-
- CPPUNIT_MSG( PrintStat()(m, "SkipListMap statistics") );
- }
-
- public:
- void SkipList_HP_less();
- void SkipList_HP_cmp();
- void SkipList_HP_cmpless();
- void SkipList_HP_less_stat();
- void SkipList_HP_cmp_stat();
- void SkipList_HP_cmpless_stat();
- void SkipList_HP_xorshift_less();
- void SkipList_HP_xorshift_cmp();
- void SkipList_HP_xorshift_cmpless();
- void SkipList_HP_xorshift_less_stat();
- void SkipList_HP_xorshift_cmp_stat();
- void SkipList_HP_xorshift_cmpless_stat();
- void SkipList_HP_turbopas_less();
- void SkipList_HP_turbopas_cmp();
- void SkipList_HP_turbopas_cmpless();
- void SkipList_HP_turbopas_less_stat();
- void SkipList_HP_turbopas_cmp_stat();
- void SkipList_HP_turbopas_cmpless_stat();
- void SkipList_HP_michaelalloc_less();
- void SkipList_HP_michaelalloc_cmp();
- void SkipList_HP_michaelalloc_cmpless();
- void SkipList_HP_michaelalloc_less_stat();
- void SkipList_HP_michaelalloc_cmp_stat();
- void SkipList_HP_michaelalloc_cmpless_stat();
-
- void SkipList_DHP_less();
- void SkipList_DHP_cmp();
- void SkipList_DHP_cmpless();
- void SkipList_DHP_less_stat();
- void SkipList_DHP_cmp_stat();
- void SkipList_DHP_cmpless_stat();
- void SkipList_DHP_xorshift_less();
- void SkipList_DHP_xorshift_cmp();
- void SkipList_DHP_xorshift_cmpless();
- void SkipList_DHP_xorshift_less_stat();
- void SkipList_DHP_xorshift_cmp_stat();
- void SkipList_DHP_xorshift_cmpless_stat();
- void SkipList_DHP_turbopas_less();
- void SkipList_DHP_turbopas_cmp();
- void SkipList_DHP_turbopas_cmpless();
- void SkipList_DHP_turbopas_less_stat();
- void SkipList_DHP_turbopas_cmp_stat();
- void SkipList_DHP_turbopas_cmpless_stat();
- void SkipList_DHP_michaelalloc_less();
- void SkipList_DHP_michaelalloc_cmp();
- void SkipList_DHP_michaelalloc_cmpless();
- void SkipList_DHP_michaelalloc_less_stat();
- void SkipList_DHP_michaelalloc_cmp_stat();
- void SkipList_DHP_michaelalloc_cmpless_stat();
-
- void SkipList_NOGC_less();
- void SkipList_NOGC_cmp();
- void SkipList_NOGC_cmpless();
- void SkipList_NOGC_less_stat();
- void SkipList_NOGC_cmp_stat();
- void SkipList_NOGC_cmpless_stat();
- void SkipList_NOGC_xorshift_less();
- void SkipList_NOGC_xorshift_cmp();
- void SkipList_NOGC_xorshift_cmpless();
- void SkipList_NOGC_xorshift_less_stat();
- void SkipList_NOGC_xorshift_cmp_stat();
- void SkipList_NOGC_xorshift_cmpless_stat();
- void SkipList_NOGC_turbopas_less();
- void SkipList_NOGC_turbopas_cmp();
- void SkipList_NOGC_turbopas_cmpless();
- void SkipList_NOGC_turbopas_less_stat();
- void SkipList_NOGC_turbopas_cmp_stat();
- void SkipList_NOGC_turbopas_cmpless_stat();
- void SkipList_NOGC_michaelalloc_less();
- void SkipList_NOGC_michaelalloc_cmp();
- void SkipList_NOGC_michaelalloc_cmpless();
- void SkipList_NOGC_michaelalloc_less_stat();
- void SkipList_NOGC_michaelalloc_cmp_stat();
- void SkipList_NOGC_michaelalloc_cmpless_stat();
-
- CPPUNIT_TEST_SUITE(SkipListMapHdrTest)
- CPPUNIT_TEST(SkipList_HP_less)
- CPPUNIT_TEST(SkipList_HP_cmp)
- CPPUNIT_TEST(SkipList_HP_cmpless)
- CPPUNIT_TEST(SkipList_HP_less_stat)
- CPPUNIT_TEST(SkipList_HP_cmp_stat)
- CPPUNIT_TEST(SkipList_HP_cmpless_stat)
- CPPUNIT_TEST(SkipList_HP_xorshift_less)
- CPPUNIT_TEST(SkipList_HP_xorshift_cmp)
- CPPUNIT_TEST(SkipList_HP_xorshift_cmpless)
- CPPUNIT_TEST(SkipList_HP_xorshift_less_stat)
- CPPUNIT_TEST(SkipList_HP_xorshift_cmp_stat)
- CPPUNIT_TEST(SkipList_HP_xorshift_cmpless_stat)
- CPPUNIT_TEST(SkipList_HP_turbopas_less)
- CPPUNIT_TEST(SkipList_HP_turbopas_cmp)
- CPPUNIT_TEST(SkipList_HP_turbopas_cmpless)
- CPPUNIT_TEST(SkipList_HP_turbopas_less_stat)
- CPPUNIT_TEST(SkipList_HP_turbopas_cmp_stat)
- CPPUNIT_TEST(SkipList_HP_turbopas_cmpless_stat)
- CPPUNIT_TEST(SkipList_HP_michaelalloc_less)
- CPPUNIT_TEST(SkipList_HP_michaelalloc_cmp)
- CPPUNIT_TEST(SkipList_HP_michaelalloc_cmpless)
- CPPUNIT_TEST(SkipList_HP_michaelalloc_less_stat)
- CPPUNIT_TEST(SkipList_HP_michaelalloc_cmp_stat)
- CPPUNIT_TEST(SkipList_HP_michaelalloc_cmpless_stat)
-
- CPPUNIT_TEST(SkipList_DHP_less)
- CPPUNIT_TEST(SkipList_DHP_cmp)
- CPPUNIT_TEST(SkipList_DHP_cmpless)
- CPPUNIT_TEST(SkipList_DHP_less_stat)
- CPPUNIT_TEST(SkipList_DHP_cmp_stat)
- CPPUNIT_TEST(SkipList_DHP_cmpless_stat)
- CPPUNIT_TEST(SkipList_DHP_xorshift_less)
- CPPUNIT_TEST(SkipList_DHP_xorshift_cmp)
- CPPUNIT_TEST(SkipList_DHP_xorshift_cmpless)
- CPPUNIT_TEST(SkipList_DHP_xorshift_less_stat)
- CPPUNIT_TEST(SkipList_DHP_xorshift_cmp_stat)
- CPPUNIT_TEST(SkipList_DHP_xorshift_cmpless_stat)
- CPPUNIT_TEST(SkipList_DHP_turbopas_less)
- CPPUNIT_TEST(SkipList_DHP_turbopas_cmp)
- CPPUNIT_TEST(SkipList_DHP_turbopas_cmpless)
- CPPUNIT_TEST(SkipList_DHP_turbopas_less_stat)
- CPPUNIT_TEST(SkipList_DHP_turbopas_cmp_stat)
- CPPUNIT_TEST(SkipList_DHP_turbopas_cmpless_stat)
- CPPUNIT_TEST(SkipList_DHP_michaelalloc_less)
- CPPUNIT_TEST(SkipList_DHP_michaelalloc_cmp)
- CPPUNIT_TEST(SkipList_DHP_michaelalloc_cmpless)
- CPPUNIT_TEST(SkipList_DHP_michaelalloc_less_stat)
- CPPUNIT_TEST(SkipList_DHP_michaelalloc_cmp_stat)
- CPPUNIT_TEST(SkipList_DHP_michaelalloc_cmpless_stat)
-
- CPPUNIT_TEST(SkipList_NOGC_less)
- CPPUNIT_TEST(SkipList_NOGC_cmp)
- CPPUNIT_TEST(SkipList_NOGC_cmpless)
- CPPUNIT_TEST(SkipList_NOGC_less_stat)
- CPPUNIT_TEST(SkipList_NOGC_cmp_stat)
- CPPUNIT_TEST(SkipList_NOGC_cmpless_stat)
- CPPUNIT_TEST(SkipList_NOGC_xorshift_less)
- CPPUNIT_TEST(SkipList_NOGC_xorshift_cmp)
- CPPUNIT_TEST(SkipList_NOGC_xorshift_cmpless)
- CPPUNIT_TEST(SkipList_NOGC_xorshift_less_stat)
- CPPUNIT_TEST(SkipList_NOGC_xorshift_cmp_stat)
- CPPUNIT_TEST(SkipList_NOGC_xorshift_cmpless_stat)
- CPPUNIT_TEST(SkipList_NOGC_turbopas_less)
- CPPUNIT_TEST(SkipList_NOGC_turbopas_cmp)
- CPPUNIT_TEST(SkipList_NOGC_turbopas_cmpless)
- CPPUNIT_TEST(SkipList_NOGC_turbopas_less_stat)
- CPPUNIT_TEST(SkipList_NOGC_turbopas_cmp_stat)
- CPPUNIT_TEST(SkipList_NOGC_turbopas_cmpless_stat)
- CPPUNIT_TEST(SkipList_NOGC_michaelalloc_less)
- CPPUNIT_TEST(SkipList_NOGC_michaelalloc_cmp)
- CPPUNIT_TEST(SkipList_NOGC_michaelalloc_cmpless)
- CPPUNIT_TEST(SkipList_NOGC_michaelalloc_less_stat)
- CPPUNIT_TEST(SkipList_NOGC_michaelalloc_cmp_stat)
- CPPUNIT_TEST(SkipList_NOGC_michaelalloc_cmpless_stat)
-
- CPPUNIT_TEST_SUITE_END()
-
- };
-
-} // namespace map
-
-#endif // #ifndef CDSTEST_HDR_SKIPLIST_MAP_H
projects / libcds.git / blobdiff