9122af3592b1a5014d3021eda64dee1e08f2d43b
[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                     CPPUNIT_ASSERT( m.get( gp, nKey ));
151                     CPPUNIT_ASSERT( !gp.empty());
152                     CPPUNIT_CHECK( gp->first == nKey );
153                     CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
154                     gp.release();
155                     CPPUNIT_ASSERT( m.extract(gp, nKey));
156                     CPPUNIT_ASSERT( !gp.empty());
157                     CPPUNIT_CHECK( gp->first == nKey );
158                     CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
159                     gp.release();
160                     CPPUNIT_CHECK( !m.get( gp, nKey ));
161                     CPPUNIT_CHECK( !m.extract(gp, nKey));
162                     CPPUNIT_CHECK( gp.empty());
163                 }
164                 CPPUNIT_ASSERT( m.empty());
165
166                 for ( int i = 0; i < nLimit; ++i )
167                     CPPUNIT_ASSERT( m.insert(arrItem[i], arrItem[i]*2) );
168
169                 // extract_with/get_with
170                 for ( int i = 0; i < nLimit; ++i ) {
171                     int nKey = arrItem[i];
172                     CPPUNIT_ASSERT( m.get_with( gp, wrapped_item(nKey), wrapped_less() ));
173                     CPPUNIT_ASSERT( !gp.empty());
174                     CPPUNIT_CHECK( gp->first == nKey );
175                     CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
176                     gp.release();
177                     CPPUNIT_ASSERT( m.extract_with(gp, wrapped_item(nKey), wrapped_less()));
178                     CPPUNIT_ASSERT( !gp.empty());
179                     CPPUNIT_CHECK( gp->first == nKey );
180                     CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
181                     gp.release();
182                     CPPUNIT_CHECK( !m.get_with( gp, wrapped_item(nKey), wrapped_less()));
183                     CPPUNIT_CHECK( !m.extract_with( gp, wrapped_item(nKey), wrapped_less()));
184                     CPPUNIT_CHECK( gp.empty());
185                 }
186                 CPPUNIT_ASSERT( m.empty());
187
188                 //extract_min
189                 for ( int i = 0; i < nLimit; ++i )
190                     CPPUNIT_ASSERT( m.insert(arrItem[i], arrItem[i]*2) );
191
192                 for ( int i = 0; i < nLimit; ++i ) {
193                     CPPUNIT_ASSERT( m.extract_min(gp));
194                     CPPUNIT_ASSERT( !gp.empty());
195                     CPPUNIT_CHECK( gp->first == i );
196                     CPPUNIT_CHECK( gp->second.m_val == i * 2 );
197                     gp.release();
198                     CPPUNIT_CHECK( gp.empty());
199                 }
200                 CPPUNIT_CHECK( !m.extract_min(gp));
201                 CPPUNIT_CHECK( gp.empty());
202                 CPPUNIT_ASSERT( m.empty());
203
204                 // extract_max
205                 for ( int i = 0; i < nLimit; ++i )
206                     CPPUNIT_ASSERT( m.insert(arrItem[i], arrItem[i]*2) );
207
208                 for ( int i = nLimit - 1; i >= 0; --i ) {
209                     CPPUNIT_ASSERT( m.extract_max(gp));
210                     CPPUNIT_ASSERT( !gp.empty());
211                     CPPUNIT_CHECK( gp->first == i );
212                     CPPUNIT_CHECK( gp->second.m_val == i * 2 );
213                     gp.release();
214                     CPPUNIT_CHECK( gp.empty());
215                 }
216                 CPPUNIT_CHECK( !m.extract_max(gp));
217                 CPPUNIT_CHECK( gp.empty());
218                 CPPUNIT_ASSERT( m.empty());
219             }
220
221             CPPUNIT_MSG( PrintStat()(m, nullptr) );
222         }
223
224         template <class Map, typename PrintStat >
225         void test_nogc()
226         {
227             typedef typename Map::iterator          iterator;
228             typedef typename Map::const_iterator    const_iterator;
229
230             Map m;
231
232             CPPUNIT_ASSERT( m.empty() );
233             CPPUNIT_ASSERT( check_size( m, 0 ));
234
235             CPPUNIT_ASSERT( m.find(10) == m.end() );
236             iterator it = m.insert( 10 );
237             CPPUNIT_ASSERT( it != m.end() );
238             CPPUNIT_ASSERT( it->first == 10 );
239             CPPUNIT_ASSERT( it->second.m_val == 0 );
240             CPPUNIT_ASSERT( !m.empty() );
241             CPPUNIT_ASSERT( check_size( m, 1 ));
242             CPPUNIT_ASSERT( m.find(10) == it );
243             CPPUNIT_ASSERT( it->first == 10 );
244             CPPUNIT_ASSERT( it->second.m_val == 0 );
245
246             CPPUNIT_ASSERT( m.find(100) == m.end() );
247             it = m.insert( 100, 200 );
248             CPPUNIT_ASSERT( it != m.end() );
249             CPPUNIT_ASSERT( !m.empty() );
250             CPPUNIT_ASSERT( check_size( m, 2 ));
251             CPPUNIT_ASSERT( m.find(100) == it );
252             CPPUNIT_ASSERT( it->first == 100 );
253             CPPUNIT_ASSERT( it->second.m_val == 200 );
254
255             CPPUNIT_ASSERT( m.find(55) == m.end() );
256             it = m.insert_key( 55, insert_functor<Map>() );
257             CPPUNIT_ASSERT( it != m.end() );
258             CPPUNIT_ASSERT( !m.empty() );
259             CPPUNIT_ASSERT( check_size( m, 3 ));
260             CPPUNIT_ASSERT( m.find(55) == it );
261             CPPUNIT_ASSERT( it->first == 55 );
262             CPPUNIT_ASSERT( it->second.m_val == 55 * 3 );
263
264             CPPUNIT_ASSERT( m.insert( 55 ) == m.end() );
265             CPPUNIT_ASSERT( m.insert( 55, 10 ) == m.end() );
266             CPPUNIT_ASSERT( m.insert_key( 55, insert_functor<Map>()) == m.end() );
267
268             CPPUNIT_ASSERT( m.find(10) != m.end() );
269             std::pair<iterator, bool> ensureResult = m.ensure( 10 );
270             CPPUNIT_ASSERT( ensureResult.first != m.end() );
271             CPPUNIT_ASSERT( !ensureResult.second  );
272             CPPUNIT_ASSERT( !m.empty() );
273             ensureResult.first->second.m_val = ensureResult.first->first * 5;
274             CPPUNIT_ASSERT( check_size( m, 3 ));
275             CPPUNIT_ASSERT( m.find(10) == ensureResult.first );
276             it = m.find_with( 10, typename base_class::less() );
277             CPPUNIT_ASSERT( it != m.end() );
278             CPPUNIT_ASSERT( it->second.m_val == 50 );
279
280             CPPUNIT_ASSERT( m.find_with(120, base_class::less()) == m.end() );
281             ensureResult = m.ensure( 120 );
282             CPPUNIT_ASSERT( ensureResult.first != m.end() );
283             CPPUNIT_ASSERT( ensureResult.second  );
284             CPPUNIT_ASSERT( !m.empty() );
285             CPPUNIT_ASSERT( check_size( m, 4 ));
286             ensureResult.first->second.m_val = ensureResult.first->first * 5;
287             CPPUNIT_ASSERT( m.find_with(120, base_class::less()) == ensureResult.first );
288             it = m.find_with(120, base_class::less());
289             CPPUNIT_ASSERT( it != m.end() );
290             CPPUNIT_ASSERT( it->second.m_val == 120 * 5 );
291
292             // emplace test
293             it = m.emplace( 151 ) ;  // key = 151,  val = 0
294             CPPUNIT_ASSERT( it != m.end() );
295             CPPUNIT_ASSERT( it->first == 151 );
296             CPPUNIT_ASSERT( it->second.m_val == 0 );
297
298             it = m.emplace( 174, 471 ) ; // key == 174, val = 471
299             CPPUNIT_ASSERT( it != m.end() );
300             CPPUNIT_ASSERT( it->first == 174 );
301             CPPUNIT_ASSERT( it->second.m_val == 471 );
302
303             it = m.emplace( 190, value_type(91)) ; // key == 190, val = 19
304             CPPUNIT_ASSERT( it != m.end() );
305             CPPUNIT_ASSERT( it->first == 190 );
306             CPPUNIT_ASSERT( it->second.m_val == 91 );
307
308             it = m.emplace( 151, 1051 );
309             CPPUNIT_ASSERT( it == m.end());
310
311             it = m.find( 174 );
312             CPPUNIT_ASSERT( it != m.end() );
313             CPPUNIT_ASSERT( it->first == 174 );
314             CPPUNIT_ASSERT( it->second.m_val == 471 );
315
316             it = m.find( 190 );
317             CPPUNIT_ASSERT( it != m.end() );
318             CPPUNIT_ASSERT( it->first == 190 );
319             CPPUNIT_ASSERT( it->second.m_val == 91 );
320
321             it = m.find( 151 );
322             CPPUNIT_ASSERT( it != m.end() );
323             CPPUNIT_ASSERT( it->first == 151 );
324             CPPUNIT_ASSERT( it->second.m_val == 0 );
325
326             m.clear();
327             CPPUNIT_ASSERT( m.empty() );
328             CPPUNIT_ASSERT( check_size( m, 0 ));
329
330             // get_min test
331             for ( int i = 500; i > 0; --i ) {
332                 CPPUNIT_ASSERT( m.insert( i, i * 2 ) != m.end() );
333
334                 typename Map::value_type * pVal = m.get_min();
335                 CPPUNIT_ASSERT( pVal != nullptr );
336                 CPPUNIT_CHECK( pVal->first == i );
337                 CPPUNIT_CHECK( pVal->second.m_val == i * 2 );
338             }
339             m.clear();
340             CPPUNIT_ASSERT( m.empty() );
341             CPPUNIT_ASSERT( check_size( m, 0 ));
342             CPPUNIT_CHECK( m.get_min() == nullptr );
343             CPPUNIT_CHECK( m.get_max() == nullptr );
344
345             // iterator test
346
347             for ( int i = 0; i < 500; ++i ) {
348                 CPPUNIT_ASSERT( m.insert( i, i * 2 ) != m.end() );
349
350                 typename Map::value_type * pVal = m.get_max();
351                 CPPUNIT_ASSERT( pVal != nullptr );
352                 CPPUNIT_CHECK( pVal->first == i );
353                 CPPUNIT_CHECK( pVal->second.m_val == i * 2 );
354             }
355             CPPUNIT_ASSERT( check_size( m, 500 ));
356
357             for ( iterator it = m.begin(), itEnd = m.end(); it != itEnd; ++it ) {
358                 CPPUNIT_ASSERT( it->first * 2 == (*it).second.m_val );
359                 it->second = it->first;
360             }
361
362             Map const& refMap = m;
363             for ( const_iterator it = refMap.begin(), itEnd = refMap.end(); it != itEnd; ++it ) {
364                 CPPUNIT_ASSERT( it->first == it->second.m_val );
365                 CPPUNIT_ASSERT( (*it).first == (*it).second.m_val );
366             }
367
368             CPPUNIT_MSG( PrintStat()(m, "SkipListMap statistics") );
369         }
370
371     public:
372         void SkipList_HP_less();
373         void SkipList_HP_cmp();
374         void SkipList_HP_cmpless();
375         void SkipList_HP_less_stat();
376         void SkipList_HP_cmp_stat();
377         void SkipList_HP_cmpless_stat();
378         void SkipList_HP_xorshift_less();
379         void SkipList_HP_xorshift_cmp();
380         void SkipList_HP_xorshift_cmpless();
381         void SkipList_HP_xorshift_less_stat();
382         void SkipList_HP_xorshift_cmp_stat();
383         void SkipList_HP_xorshift_cmpless_stat();
384         void SkipList_HP_turbopas_less();
385         void SkipList_HP_turbopas_cmp();
386         void SkipList_HP_turbopas_cmpless();
387         void SkipList_HP_turbopas_less_stat();
388         void SkipList_HP_turbopas_cmp_stat();
389         void SkipList_HP_turbopas_cmpless_stat();
390         void SkipList_HP_michaelalloc_less();
391         void SkipList_HP_michaelalloc_cmp();
392         void SkipList_HP_michaelalloc_cmpless();
393         void SkipList_HP_michaelalloc_less_stat();
394         void SkipList_HP_michaelalloc_cmp_stat();
395         void SkipList_HP_michaelalloc_cmpless_stat();
396
397         void SkipList_DHP_less();
398         void SkipList_DHP_cmp();
399         void SkipList_DHP_cmpless();
400         void SkipList_DHP_less_stat();
401         void SkipList_DHP_cmp_stat();
402         void SkipList_DHP_cmpless_stat();
403         void SkipList_DHP_xorshift_less();
404         void SkipList_DHP_xorshift_cmp();
405         void SkipList_DHP_xorshift_cmpless();
406         void SkipList_DHP_xorshift_less_stat();
407         void SkipList_DHP_xorshift_cmp_stat();
408         void SkipList_DHP_xorshift_cmpless_stat();
409         void SkipList_DHP_turbopas_less();
410         void SkipList_DHP_turbopas_cmp();
411         void SkipList_DHP_turbopas_cmpless();
412         void SkipList_DHP_turbopas_less_stat();
413         void SkipList_DHP_turbopas_cmp_stat();
414         void SkipList_DHP_turbopas_cmpless_stat();
415         void SkipList_DHP_michaelalloc_less();
416         void SkipList_DHP_michaelalloc_cmp();
417         void SkipList_DHP_michaelalloc_cmpless();
418         void SkipList_DHP_michaelalloc_less_stat();
419         void SkipList_DHP_michaelalloc_cmp_stat();
420         void SkipList_DHP_michaelalloc_cmpless_stat();
421
422         void SkipList_NOGC_less();
423         void SkipList_NOGC_cmp();
424         void SkipList_NOGC_cmpless();
425         void SkipList_NOGC_less_stat();
426         void SkipList_NOGC_cmp_stat();
427         void SkipList_NOGC_cmpless_stat();
428         void SkipList_NOGC_xorshift_less();
429         void SkipList_NOGC_xorshift_cmp();
430         void SkipList_NOGC_xorshift_cmpless();
431         void SkipList_NOGC_xorshift_less_stat();
432         void SkipList_NOGC_xorshift_cmp_stat();
433         void SkipList_NOGC_xorshift_cmpless_stat();
434         void SkipList_NOGC_turbopas_less();
435         void SkipList_NOGC_turbopas_cmp();
436         void SkipList_NOGC_turbopas_cmpless();
437         void SkipList_NOGC_turbopas_less_stat();
438         void SkipList_NOGC_turbopas_cmp_stat();
439         void SkipList_NOGC_turbopas_cmpless_stat();
440         void SkipList_NOGC_michaelalloc_less();
441         void SkipList_NOGC_michaelalloc_cmp();
442         void SkipList_NOGC_michaelalloc_cmpless();
443         void SkipList_NOGC_michaelalloc_less_stat();
444         void SkipList_NOGC_michaelalloc_cmp_stat();
445         void SkipList_NOGC_michaelalloc_cmpless_stat();
446
447         CPPUNIT_TEST_SUITE(SkipListMapHdrTest)
448             CPPUNIT_TEST(SkipList_HP_less)
449             CPPUNIT_TEST(SkipList_HP_cmp)
450             CPPUNIT_TEST(SkipList_HP_cmpless)
451             CPPUNIT_TEST(SkipList_HP_less_stat)
452             CPPUNIT_TEST(SkipList_HP_cmp_stat)
453             CPPUNIT_TEST(SkipList_HP_cmpless_stat)
454             CPPUNIT_TEST(SkipList_HP_xorshift_less)
455             CPPUNIT_TEST(SkipList_HP_xorshift_cmp)
456             CPPUNIT_TEST(SkipList_HP_xorshift_cmpless)
457             CPPUNIT_TEST(SkipList_HP_xorshift_less_stat)
458             CPPUNIT_TEST(SkipList_HP_xorshift_cmp_stat)
459             CPPUNIT_TEST(SkipList_HP_xorshift_cmpless_stat)
460             CPPUNIT_TEST(SkipList_HP_turbopas_less)
461             CPPUNIT_TEST(SkipList_HP_turbopas_cmp)
462             CPPUNIT_TEST(SkipList_HP_turbopas_cmpless)
463             CPPUNIT_TEST(SkipList_HP_turbopas_less_stat)
464             CPPUNIT_TEST(SkipList_HP_turbopas_cmp_stat)
465             CPPUNIT_TEST(SkipList_HP_turbopas_cmpless_stat)
466             CPPUNIT_TEST(SkipList_HP_michaelalloc_less)
467             CPPUNIT_TEST(SkipList_HP_michaelalloc_cmp)
468             CPPUNIT_TEST(SkipList_HP_michaelalloc_cmpless)
469             CPPUNIT_TEST(SkipList_HP_michaelalloc_less_stat)
470             CPPUNIT_TEST(SkipList_HP_michaelalloc_cmp_stat)
471             CPPUNIT_TEST(SkipList_HP_michaelalloc_cmpless_stat)
472
473             CPPUNIT_TEST(SkipList_DHP_less)
474             CPPUNIT_TEST(SkipList_DHP_cmp)
475             CPPUNIT_TEST(SkipList_DHP_cmpless)
476             CPPUNIT_TEST(SkipList_DHP_less_stat)
477             CPPUNIT_TEST(SkipList_DHP_cmp_stat)
478             CPPUNIT_TEST(SkipList_DHP_cmpless_stat)
479             CPPUNIT_TEST(SkipList_DHP_xorshift_less)
480             CPPUNIT_TEST(SkipList_DHP_xorshift_cmp)
481             CPPUNIT_TEST(SkipList_DHP_xorshift_cmpless)
482             CPPUNIT_TEST(SkipList_DHP_xorshift_less_stat)
483             CPPUNIT_TEST(SkipList_DHP_xorshift_cmp_stat)
484             CPPUNIT_TEST(SkipList_DHP_xorshift_cmpless_stat)
485             CPPUNIT_TEST(SkipList_DHP_turbopas_less)
486             CPPUNIT_TEST(SkipList_DHP_turbopas_cmp)
487             CPPUNIT_TEST(SkipList_DHP_turbopas_cmpless)
488             CPPUNIT_TEST(SkipList_DHP_turbopas_less_stat)
489             CPPUNIT_TEST(SkipList_DHP_turbopas_cmp_stat)
490             CPPUNIT_TEST(SkipList_DHP_turbopas_cmpless_stat)
491             CPPUNIT_TEST(SkipList_DHP_michaelalloc_less)
492             CPPUNIT_TEST(SkipList_DHP_michaelalloc_cmp)
493             CPPUNIT_TEST(SkipList_DHP_michaelalloc_cmpless)
494             CPPUNIT_TEST(SkipList_DHP_michaelalloc_less_stat)
495             CPPUNIT_TEST(SkipList_DHP_michaelalloc_cmp_stat)
496             CPPUNIT_TEST(SkipList_DHP_michaelalloc_cmpless_stat)
497
498             CPPUNIT_TEST(SkipList_NOGC_less)
499             CPPUNIT_TEST(SkipList_NOGC_cmp)
500             CPPUNIT_TEST(SkipList_NOGC_cmpless)
501             CPPUNIT_TEST(SkipList_NOGC_less_stat)
502             CPPUNIT_TEST(SkipList_NOGC_cmp_stat)
503             CPPUNIT_TEST(SkipList_NOGC_cmpless_stat)
504             CPPUNIT_TEST(SkipList_NOGC_xorshift_less)
505             CPPUNIT_TEST(SkipList_NOGC_xorshift_cmp)
506             CPPUNIT_TEST(SkipList_NOGC_xorshift_cmpless)
507             CPPUNIT_TEST(SkipList_NOGC_xorshift_less_stat)
508             CPPUNIT_TEST(SkipList_NOGC_xorshift_cmp_stat)
509             CPPUNIT_TEST(SkipList_NOGC_xorshift_cmpless_stat)
510             CPPUNIT_TEST(SkipList_NOGC_turbopas_less)
511             CPPUNIT_TEST(SkipList_NOGC_turbopas_cmp)
512             CPPUNIT_TEST(SkipList_NOGC_turbopas_cmpless)
513             CPPUNIT_TEST(SkipList_NOGC_turbopas_less_stat)
514             CPPUNIT_TEST(SkipList_NOGC_turbopas_cmp_stat)
515             CPPUNIT_TEST(SkipList_NOGC_turbopas_cmpless_stat)
516             CPPUNIT_TEST(SkipList_NOGC_michaelalloc_less)
517             CPPUNIT_TEST(SkipList_NOGC_michaelalloc_cmp)
518             CPPUNIT_TEST(SkipList_NOGC_michaelalloc_cmpless)
519             CPPUNIT_TEST(SkipList_NOGC_michaelalloc_less_stat)
520             CPPUNIT_TEST(SkipList_NOGC_michaelalloc_cmp_stat)
521             CPPUNIT_TEST(SkipList_NOGC_michaelalloc_cmpless_stat)
522
523         CPPUNIT_TEST_SUITE_END()
524
525     };
526
527 } // namespace map
528
529 #endif // #ifndef __CDSTEST_HDR_SKIPLIST_MAP_H