e21aaaa333b7222b5925871b2a9d378527625cf1
[libcds.git] / tests / test-hdr / map / hdr_skiplist_map.h
1 //$$CDS-header$$
2
3 #ifndef __CDSTEST_HDR_SKIPLIST_MAP_H
4 #define __CDSTEST_HDR_SKIPLIST_MAP_H
5
6 #include "map/hdr_map.h"
7
8 namespace map {
9
10     class SkipListMapHdrTest: public HashMapHdrTest
11     {
12         typedef HashMapHdrTest base_class;
13         typedef base_class::other_item  wrapped_item;
14         typedef base_class::other_less  wrapped_less;
15
16         template <class Map, typename PrintStat >
17         void test()
18         {
19             Map m;
20             test_int_with( m );
21
22             static int const nLimit = 10000;
23             typedef typename Map::iterator          set_iterator;
24             typedef typename Map::const_iterator    const_set_iterator;
25
26             int nCount = 0;
27             int nPrevKey = 0;
28
29             // Test iterator - ascending order
30             m.clear();
31             CPPUNIT_ASSERT( m.empty() );
32
33             for ( int i = 0; i < nLimit; ++i ) {
34                 CPPUNIT_ASSERT( m.insert(i, i) );
35             }
36             CPPUNIT_MSG( PrintStat()(m, "Iterator test, ascending insert order") );
37
38             nCount = 0;
39             nPrevKey = 0;
40             for ( set_iterator it = m.begin(), itEnd = m.end(); it != itEnd; ++it ) {
41                 CPPUNIT_ASSERT( (*it).first == it->second.m_val );
42                 CPPUNIT_ASSERT( m.find( it->first ));
43                 it->second.m_val = (*it).first * 2;
44                 ++nCount;
45                 if ( it != m.begin() ) {
46                     CPPUNIT_ASSERT( nPrevKey + 1 == it->first );
47                 }
48                 nPrevKey = it->first;
49             }
50             CPPUNIT_ASSERT( nCount == nLimit );
51
52             nCount = 0;
53             for ( const_set_iterator it = m.cbegin(), itEnd = m.cend(); it != itEnd; ++it ) {
54                 CPPUNIT_ASSERT( (*it).first * 2 == it->second.m_val );
55                 ++nCount;
56                 if ( it != m.cbegin() ) {
57                     CPPUNIT_ASSERT( nPrevKey + 1 == it->first );
58                 }
59                 nPrevKey = it->first;
60             }
61             CPPUNIT_ASSERT( nCount == nLimit );
62
63             // Test iterator - descending order
64             m.clear();
65             CPPUNIT_ASSERT( m.empty() );
66
67             for ( int i = nLimit; i > 0; --i ) {
68                 CPPUNIT_ASSERT( m.insert( i - 1, (i-1) * 2) );
69             }
70             CPPUNIT_MSG( PrintStat()(m, "Iterator test, descending insert order") );
71
72             nCount = 0;
73             nPrevKey = 0;
74             for ( set_iterator it = m.begin(), itEnd = m.end(); it != itEnd; ++it ) {
75                 CPPUNIT_ASSERT( (*it).first * 2 == it->second.m_val );
76                 CPPUNIT_ASSERT( m.find( it->first ));
77                 it->second.m_val = (*it).first;
78                 ++nCount;
79                 if ( it != m.begin() ) {
80                     CPPUNIT_ASSERT( nPrevKey + 1 == it->first );
81                 }
82                 nPrevKey = it->first;
83             }
84             CPPUNIT_ASSERT( nCount == nLimit );
85
86             nCount = 0;
87             for ( const_set_iterator it = m.cbegin(), itEnd = m.cend(); it != itEnd; ++it ) {
88                 CPPUNIT_ASSERT( (*it).first == it->second.m_val );
89                 ++nCount;
90                 if ( it != m.cbegin() ) {
91                     CPPUNIT_ASSERT( nPrevKey + 1 == it->first );
92                 }
93                 nPrevKey = it->first;
94             }
95             CPPUNIT_ASSERT( nCount == nLimit );
96
97             // Test iterator - random order
98             m.clear();
99             CPPUNIT_ASSERT( m.empty() );
100             {
101                 int nRand[nLimit];
102                 for ( int i = 0; i < nLimit; ++i ) {
103                     nRand[i] = i;
104                 }
105                 std::random_shuffle( nRand, nRand + nLimit );
106
107                 for ( int i = 0; i < nLimit; ++i ) {
108                     CPPUNIT_ASSERT( m.insert( nRand[i], nRand[i]) );
109                 }
110                 CPPUNIT_MSG( PrintStat()(m, "Iterator test, random insert order") );
111             }
112
113             nCount = 0;
114             nPrevKey = 0;
115             for ( set_iterator it = m.begin(), itEnd = m.end(); it != itEnd; ++it ) {
116                 CPPUNIT_ASSERT( (*it).first == it->second.m_val );
117                 CPPUNIT_ASSERT( m.find( it->first ));
118                 it->second.m_val = (*it).first * 2;
119                 ++nCount;
120                 if ( it != m.begin() ) {
121                     CPPUNIT_ASSERT( nPrevKey + 1 == it->first );
122                 }
123                 nPrevKey = it->first;
124             }
125             CPPUNIT_ASSERT( nCount == nLimit );
126
127             nCount = 0;
128             for ( const_set_iterator it = m.cbegin(), itEnd = m.cend(); it != itEnd; ++it ) {
129                 CPPUNIT_ASSERT( (*it).first * 2 == it->second.m_val );
130                 ++nCount;
131                 if ( it != m.cbegin() ) {
132                     CPPUNIT_ASSERT( nPrevKey + 1 == it->first );
133                 }
134                 nPrevKey = it->first;
135             }
136             CPPUNIT_ASSERT( nCount == nLimit );
137
138             {
139                 typename Map::guarded_ptr gp;
140                 int arrItem[nLimit];
141                 for ( int i = 0; i < nLimit; ++i )
142                     arrItem[i] = i;
143                 std::random_shuffle( arrItem, arrItem + nLimit );
144
145                 typedef base_class::less less;
146
147                 // extract/get
148                 for ( int i = 0; i < nLimit; ++i ) {
149                     int nKey = arrItem[i];
150                     gp = m.get( nKey );
151                     CPPUNIT_ASSERT( gp );
152                     CPPUNIT_ASSERT( !gp.empty());
153                     CPPUNIT_CHECK( gp->first == nKey );
154                     CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
155                     gp.release();
156
157                     gp = m.extract( nKey );
158                     CPPUNIT_ASSERT( gp );
159                     CPPUNIT_ASSERT( !gp.empty());
160                     CPPUNIT_CHECK( gp->first == nKey );
161                     CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
162                     gp.release();
163
164                     gp = m.get( nKey );
165                     CPPUNIT_CHECK( !gp );
166                     CPPUNIT_CHECK( !m.extract(nKey));
167                     CPPUNIT_CHECK( gp.empty());
168                 }
169                 CPPUNIT_ASSERT( m.empty());
170
171                 for ( int i = 0; i < nLimit; ++i )
172                     CPPUNIT_ASSERT( m.insert(arrItem[i], arrItem[i]*2) );
173
174                 // extract_with/get_with
175                 for ( int i = 0; i < nLimit; ++i ) {
176                     int nKey = arrItem[i];
177                     gp = m.get_with( wrapped_item( nKey ), wrapped_less());
178                     CPPUNIT_ASSERT( gp );
179                     CPPUNIT_ASSERT( !gp.empty());
180                     CPPUNIT_CHECK( gp->first == nKey );
181                     CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
182                     gp.release();
183                     
184                     gp = m.extract_with( wrapped_item( nKey ), wrapped_less());
185                     CPPUNIT_ASSERT( gp );
186                     CPPUNIT_ASSERT( !gp.empty());
187                     CPPUNIT_CHECK( gp->first == nKey );
188                     CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
189                     gp.release();
190
191                     gp = m.get_with( wrapped_item( nKey ), wrapped_less() );
192                     CPPUNIT_CHECK( !gp );
193                     CPPUNIT_CHECK( !m.extract_with( wrapped_item(nKey), wrapped_less()));
194                     CPPUNIT_CHECK( gp.empty());
195                 }
196                 CPPUNIT_ASSERT( m.empty());
197
198                 //extract_min
199                 for ( int i = 0; i < nLimit; ++i )
200                     CPPUNIT_ASSERT( m.insert(arrItem[i], arrItem[i]*2) );
201
202                 for ( int i = 0; i < nLimit; ++i ) {
203                     gp = m.extract_min();
204                     CPPUNIT_ASSERT( gp );
205                     CPPUNIT_ASSERT( !gp.empty());
206                     CPPUNIT_CHECK( gp->first == i );
207                     CPPUNIT_CHECK( gp->second.m_val == i * 2 );
208                     gp.release();
209                     CPPUNIT_CHECK( gp.empty());
210                 }
211                 CPPUNIT_CHECK( !m.extract_min());
212
213                 // extract_max
214                 for ( int i = 0; i < nLimit; ++i )
215                     CPPUNIT_ASSERT( m.insert(arrItem[i], arrItem[i]*2) );
216
217                 for ( int i = nLimit - 1; i >= 0; --i ) {
218                     gp = m.extract_max();
219                     CPPUNIT_ASSERT( gp );
220                     CPPUNIT_ASSERT( !gp.empty());
221                     CPPUNIT_CHECK( gp->first == i );
222                     CPPUNIT_CHECK( gp->second.m_val == i * 2 );
223                     gp.release();
224                     CPPUNIT_CHECK( gp.empty());
225                 }
226                 CPPUNIT_CHECK( !m.extract_max());
227                 CPPUNIT_CHECK( gp.empty());
228                 CPPUNIT_ASSERT( m.empty());
229             }
230
231             CPPUNIT_MSG( PrintStat()(m, nullptr) );
232         }
233
234         template <class Map, typename PrintStat >
235         void test_nogc()
236         {
237             typedef typename Map::iterator          iterator;
238             typedef typename Map::const_iterator    const_iterator;
239
240             Map m;
241
242             CPPUNIT_ASSERT( m.empty() );
243             CPPUNIT_ASSERT( check_size( m, 0 ));
244
245             CPPUNIT_ASSERT( m.find(10) == m.end() );
246             iterator it = m.insert( 10 );
247             CPPUNIT_ASSERT( it != m.end() );
248             CPPUNIT_ASSERT( it->first == 10 );
249             CPPUNIT_ASSERT( it->second.m_val == 0 );
250             CPPUNIT_ASSERT( !m.empty() );
251             CPPUNIT_ASSERT( check_size( m, 1 ));
252             CPPUNIT_ASSERT( m.find(10) == it );
253             CPPUNIT_ASSERT( it->first == 10 );
254             CPPUNIT_ASSERT( it->second.m_val == 0 );
255
256             CPPUNIT_ASSERT( m.find(100) == m.end() );
257             it = m.insert( 100, 200 );
258             CPPUNIT_ASSERT( it != m.end() );
259             CPPUNIT_ASSERT( !m.empty() );
260             CPPUNIT_ASSERT( check_size( m, 2 ));
261             CPPUNIT_ASSERT( m.find(100) == it );
262             CPPUNIT_ASSERT( it->first == 100 );
263             CPPUNIT_ASSERT( it->second.m_val == 200 );
264
265             CPPUNIT_ASSERT( m.find(55) == m.end() );
266             it = m.insert_with( 55, insert_functor<Map>() );
267             CPPUNIT_ASSERT( it != m.end() );
268             CPPUNIT_ASSERT( !m.empty() );
269             CPPUNIT_ASSERT( check_size( m, 3 ));
270             CPPUNIT_ASSERT( m.find(55) == it );
271             CPPUNIT_ASSERT( it->first == 55 );
272             CPPUNIT_ASSERT( it->second.m_val == 55 * 3 );
273
274             CPPUNIT_ASSERT( m.insert( 55 ) == m.end() );
275             CPPUNIT_ASSERT( m.insert( 55, 10 ) == m.end() );
276             CPPUNIT_ASSERT( m.insert_with( 55, insert_functor<Map>()) == m.end() );
277
278             CPPUNIT_ASSERT( m.find(10) != m.end() );
279             std::pair<iterator, bool> ensureResult = m.ensure( 10 );
280             CPPUNIT_ASSERT( ensureResult.first != m.end() );
281             CPPUNIT_ASSERT( !ensureResult.second  );
282             CPPUNIT_ASSERT( !m.empty() );
283             ensureResult.first->second.m_val = ensureResult.first->first * 5;
284             CPPUNIT_ASSERT( check_size( m, 3 ));
285             CPPUNIT_ASSERT( m.find(10) == ensureResult.first );
286             it = m.find_with( 10, typename base_class::less() );
287             CPPUNIT_ASSERT( it != m.end() );
288             CPPUNIT_ASSERT( it->second.m_val == 50 );
289
290             CPPUNIT_ASSERT( m.find_with(120, base_class::less()) == m.end() );
291             ensureResult = m.ensure( 120 );
292             CPPUNIT_ASSERT( ensureResult.first != m.end() );
293             CPPUNIT_ASSERT( ensureResult.second  );
294             CPPUNIT_ASSERT( !m.empty() );
295             CPPUNIT_ASSERT( check_size( m, 4 ));
296             ensureResult.first->second.m_val = ensureResult.first->first * 5;
297             CPPUNIT_ASSERT( m.find_with(120, base_class::less()) == ensureResult.first );
298             it = m.find_with(120, base_class::less());
299             CPPUNIT_ASSERT( it != m.end() );
300             CPPUNIT_ASSERT( it->second.m_val == 120 * 5 );
301
302             // emplace test
303             it = m.emplace( 151 ) ;  // key = 151,  val = 0
304             CPPUNIT_ASSERT( it != m.end() );
305             CPPUNIT_ASSERT( it->first == 151 );
306             CPPUNIT_ASSERT( it->second.m_val == 0 );
307
308             it = m.emplace( 174, 471 ) ; // key == 174, val = 471
309             CPPUNIT_ASSERT( it != m.end() );
310             CPPUNIT_ASSERT( it->first == 174 );
311             CPPUNIT_ASSERT( it->second.m_val == 471 );
312
313             it = m.emplace( 190, value_type(91)) ; // key == 190, val = 19
314             CPPUNIT_ASSERT( it != m.end() );
315             CPPUNIT_ASSERT( it->first == 190 );
316             CPPUNIT_ASSERT( it->second.m_val == 91 );
317
318             it = m.emplace( 151, 1051 );
319             CPPUNIT_ASSERT( it == m.end());
320
321             it = m.find( 174 );
322             CPPUNIT_ASSERT( it != m.end() );
323             CPPUNIT_ASSERT( it->first == 174 );
324             CPPUNIT_ASSERT( it->second.m_val == 471 );
325
326             it = m.find( 190 );
327             CPPUNIT_ASSERT( it != m.end() );
328             CPPUNIT_ASSERT( it->first == 190 );
329             CPPUNIT_ASSERT( it->second.m_val == 91 );
330
331             it = m.find( 151 );
332             CPPUNIT_ASSERT( it != m.end() );
333             CPPUNIT_ASSERT( it->first == 151 );
334             CPPUNIT_ASSERT( it->second.m_val == 0 );
335
336             m.clear();
337             CPPUNIT_ASSERT( m.empty() );
338             CPPUNIT_ASSERT( check_size( m, 0 ));
339
340             // get_min test
341             for ( int i = 500; i > 0; --i ) {
342                 CPPUNIT_ASSERT( m.insert( i, i * 2 ) != m.end() );
343
344                 typename Map::value_type * pVal = m.get_min();
345                 CPPUNIT_ASSERT( pVal != nullptr );
346                 CPPUNIT_CHECK( pVal->first == i );
347                 CPPUNIT_CHECK( pVal->second.m_val == i * 2 );
348             }
349             m.clear();
350             CPPUNIT_ASSERT( m.empty() );
351             CPPUNIT_ASSERT( check_size( m, 0 ));
352             CPPUNIT_CHECK( m.get_min() == nullptr );
353             CPPUNIT_CHECK( m.get_max() == nullptr );
354
355             // iterator test
356
357             for ( int i = 0; i < 500; ++i ) {
358                 CPPUNIT_ASSERT( m.insert( i, i * 2 ) != m.end() );
359
360                 typename Map::value_type * pVal = m.get_max();
361                 CPPUNIT_ASSERT( pVal != nullptr );
362                 CPPUNIT_CHECK( pVal->first == i );
363                 CPPUNIT_CHECK( pVal->second.m_val == i * 2 );
364             }
365             CPPUNIT_ASSERT( check_size( m, 500 ));
366
367             for ( iterator it = m.begin(), itEnd = m.end(); it != itEnd; ++it ) {
368                 CPPUNIT_ASSERT( it->first * 2 == (*it).second.m_val );
369                 it->second = it->first;
370             }
371
372             Map const& refMap = m;
373             for ( const_iterator it = refMap.begin(), itEnd = refMap.end(); it != itEnd; ++it ) {
374                 CPPUNIT_ASSERT( it->first == it->second.m_val );
375                 CPPUNIT_ASSERT( (*it).first == (*it).second.m_val );
376             }
377
378             CPPUNIT_MSG( PrintStat()(m, "SkipListMap statistics") );
379         }
380
381     public:
382         void SkipList_HP_less();
383         void SkipList_HP_cmp();
384         void SkipList_HP_cmpless();
385         void SkipList_HP_less_stat();
386         void SkipList_HP_cmp_stat();
387         void SkipList_HP_cmpless_stat();
388         void SkipList_HP_xorshift_less();
389         void SkipList_HP_xorshift_cmp();
390         void SkipList_HP_xorshift_cmpless();
391         void SkipList_HP_xorshift_less_stat();
392         void SkipList_HP_xorshift_cmp_stat();
393         void SkipList_HP_xorshift_cmpless_stat();
394         void SkipList_HP_turbopas_less();
395         void SkipList_HP_turbopas_cmp();
396         void SkipList_HP_turbopas_cmpless();
397         void SkipList_HP_turbopas_less_stat();
398         void SkipList_HP_turbopas_cmp_stat();
399         void SkipList_HP_turbopas_cmpless_stat();
400         void SkipList_HP_michaelalloc_less();
401         void SkipList_HP_michaelalloc_cmp();
402         void SkipList_HP_michaelalloc_cmpless();
403         void SkipList_HP_michaelalloc_less_stat();
404         void SkipList_HP_michaelalloc_cmp_stat();
405         void SkipList_HP_michaelalloc_cmpless_stat();
406
407         void SkipList_DHP_less();
408         void SkipList_DHP_cmp();
409         void SkipList_DHP_cmpless();
410         void SkipList_DHP_less_stat();
411         void SkipList_DHP_cmp_stat();
412         void SkipList_DHP_cmpless_stat();
413         void SkipList_DHP_xorshift_less();
414         void SkipList_DHP_xorshift_cmp();
415         void SkipList_DHP_xorshift_cmpless();
416         void SkipList_DHP_xorshift_less_stat();
417         void SkipList_DHP_xorshift_cmp_stat();
418         void SkipList_DHP_xorshift_cmpless_stat();
419         void SkipList_DHP_turbopas_less();
420         void SkipList_DHP_turbopas_cmp();
421         void SkipList_DHP_turbopas_cmpless();
422         void SkipList_DHP_turbopas_less_stat();
423         void SkipList_DHP_turbopas_cmp_stat();
424         void SkipList_DHP_turbopas_cmpless_stat();
425         void SkipList_DHP_michaelalloc_less();
426         void SkipList_DHP_michaelalloc_cmp();
427         void SkipList_DHP_michaelalloc_cmpless();
428         void SkipList_DHP_michaelalloc_less_stat();
429         void SkipList_DHP_michaelalloc_cmp_stat();
430         void SkipList_DHP_michaelalloc_cmpless_stat();
431
432         void SkipList_NOGC_less();
433         void SkipList_NOGC_cmp();
434         void SkipList_NOGC_cmpless();
435         void SkipList_NOGC_less_stat();
436         void SkipList_NOGC_cmp_stat();
437         void SkipList_NOGC_cmpless_stat();
438         void SkipList_NOGC_xorshift_less();
439         void SkipList_NOGC_xorshift_cmp();
440         void SkipList_NOGC_xorshift_cmpless();
441         void SkipList_NOGC_xorshift_less_stat();
442         void SkipList_NOGC_xorshift_cmp_stat();
443         void SkipList_NOGC_xorshift_cmpless_stat();
444         void SkipList_NOGC_turbopas_less();
445         void SkipList_NOGC_turbopas_cmp();
446         void SkipList_NOGC_turbopas_cmpless();
447         void SkipList_NOGC_turbopas_less_stat();
448         void SkipList_NOGC_turbopas_cmp_stat();
449         void SkipList_NOGC_turbopas_cmpless_stat();
450         void SkipList_NOGC_michaelalloc_less();
451         void SkipList_NOGC_michaelalloc_cmp();
452         void SkipList_NOGC_michaelalloc_cmpless();
453         void SkipList_NOGC_michaelalloc_less_stat();
454         void SkipList_NOGC_michaelalloc_cmp_stat();
455         void SkipList_NOGC_michaelalloc_cmpless_stat();
456
457         CPPUNIT_TEST_SUITE(SkipListMapHdrTest)
458             CPPUNIT_TEST(SkipList_HP_less)
459             CPPUNIT_TEST(SkipList_HP_cmp)
460             CPPUNIT_TEST(SkipList_HP_cmpless)
461             CPPUNIT_TEST(SkipList_HP_less_stat)
462             CPPUNIT_TEST(SkipList_HP_cmp_stat)
463             CPPUNIT_TEST(SkipList_HP_cmpless_stat)
464             CPPUNIT_TEST(SkipList_HP_xorshift_less)
465             CPPUNIT_TEST(SkipList_HP_xorshift_cmp)
466             CPPUNIT_TEST(SkipList_HP_xorshift_cmpless)
467             CPPUNIT_TEST(SkipList_HP_xorshift_less_stat)
468             CPPUNIT_TEST(SkipList_HP_xorshift_cmp_stat)
469             CPPUNIT_TEST(SkipList_HP_xorshift_cmpless_stat)
470             CPPUNIT_TEST(SkipList_HP_turbopas_less)
471             CPPUNIT_TEST(SkipList_HP_turbopas_cmp)
472             CPPUNIT_TEST(SkipList_HP_turbopas_cmpless)
473             CPPUNIT_TEST(SkipList_HP_turbopas_less_stat)
474             CPPUNIT_TEST(SkipList_HP_turbopas_cmp_stat)
475             CPPUNIT_TEST(SkipList_HP_turbopas_cmpless_stat)
476             CPPUNIT_TEST(SkipList_HP_michaelalloc_less)
477             CPPUNIT_TEST(SkipList_HP_michaelalloc_cmp)
478             CPPUNIT_TEST(SkipList_HP_michaelalloc_cmpless)
479             CPPUNIT_TEST(SkipList_HP_michaelalloc_less_stat)
480             CPPUNIT_TEST(SkipList_HP_michaelalloc_cmp_stat)
481             CPPUNIT_TEST(SkipList_HP_michaelalloc_cmpless_stat)
482
483             CPPUNIT_TEST(SkipList_DHP_less)
484             CPPUNIT_TEST(SkipList_DHP_cmp)
485             CPPUNIT_TEST(SkipList_DHP_cmpless)
486             CPPUNIT_TEST(SkipList_DHP_less_stat)
487             CPPUNIT_TEST(SkipList_DHP_cmp_stat)
488             CPPUNIT_TEST(SkipList_DHP_cmpless_stat)
489             CPPUNIT_TEST(SkipList_DHP_xorshift_less)
490             CPPUNIT_TEST(SkipList_DHP_xorshift_cmp)
491             CPPUNIT_TEST(SkipList_DHP_xorshift_cmpless)
492             CPPUNIT_TEST(SkipList_DHP_xorshift_less_stat)
493             CPPUNIT_TEST(SkipList_DHP_xorshift_cmp_stat)
494             CPPUNIT_TEST(SkipList_DHP_xorshift_cmpless_stat)
495             CPPUNIT_TEST(SkipList_DHP_turbopas_less)
496             CPPUNIT_TEST(SkipList_DHP_turbopas_cmp)
497             CPPUNIT_TEST(SkipList_DHP_turbopas_cmpless)
498             CPPUNIT_TEST(SkipList_DHP_turbopas_less_stat)
499             CPPUNIT_TEST(SkipList_DHP_turbopas_cmp_stat)
500             CPPUNIT_TEST(SkipList_DHP_turbopas_cmpless_stat)
501             CPPUNIT_TEST(SkipList_DHP_michaelalloc_less)
502             CPPUNIT_TEST(SkipList_DHP_michaelalloc_cmp)
503             CPPUNIT_TEST(SkipList_DHP_michaelalloc_cmpless)
504             CPPUNIT_TEST(SkipList_DHP_michaelalloc_less_stat)
505             CPPUNIT_TEST(SkipList_DHP_michaelalloc_cmp_stat)
506             CPPUNIT_TEST(SkipList_DHP_michaelalloc_cmpless_stat)
507
508             CPPUNIT_TEST(SkipList_NOGC_less)
509             CPPUNIT_TEST(SkipList_NOGC_cmp)
510             CPPUNIT_TEST(SkipList_NOGC_cmpless)
511             CPPUNIT_TEST(SkipList_NOGC_less_stat)
512             CPPUNIT_TEST(SkipList_NOGC_cmp_stat)
513             CPPUNIT_TEST(SkipList_NOGC_cmpless_stat)
514             CPPUNIT_TEST(SkipList_NOGC_xorshift_less)
515             CPPUNIT_TEST(SkipList_NOGC_xorshift_cmp)
516             CPPUNIT_TEST(SkipList_NOGC_xorshift_cmpless)
517             CPPUNIT_TEST(SkipList_NOGC_xorshift_less_stat)
518             CPPUNIT_TEST(SkipList_NOGC_xorshift_cmp_stat)
519             CPPUNIT_TEST(SkipList_NOGC_xorshift_cmpless_stat)
520             CPPUNIT_TEST(SkipList_NOGC_turbopas_less)
521             CPPUNIT_TEST(SkipList_NOGC_turbopas_cmp)
522             CPPUNIT_TEST(SkipList_NOGC_turbopas_cmpless)
523             CPPUNIT_TEST(SkipList_NOGC_turbopas_less_stat)
524             CPPUNIT_TEST(SkipList_NOGC_turbopas_cmp_stat)
525             CPPUNIT_TEST(SkipList_NOGC_turbopas_cmpless_stat)
526             CPPUNIT_TEST(SkipList_NOGC_michaelalloc_less)
527             CPPUNIT_TEST(SkipList_NOGC_michaelalloc_cmp)
528             CPPUNIT_TEST(SkipList_NOGC_michaelalloc_cmpless)
529             CPPUNIT_TEST(SkipList_NOGC_michaelalloc_less_stat)
530             CPPUNIT_TEST(SkipList_NOGC_michaelalloc_cmp_stat)
531             CPPUNIT_TEST(SkipList_NOGC_michaelalloc_cmpless_stat)
532
533         CPPUNIT_TEST_SUITE_END()
534
535     };
536
537 } // namespace map
538
539 #endif // #ifndef __CDSTEST_HDR_SKIPLIST_MAP_H