3 #include "cppunit/cppunit_proxy.h"
4 #include <cds/container/details/michael_list_base.h>
7 namespace cc = cds::container;
8 namespace co = cds::container::opt;
10 class MichaelKVListTestHeader: public CppUnitMini::TestCase
29 bool operator ()(const T& v1, const T& v2 ) const
37 int operator ()(const T& v1, const T& v2 ) const
41 return v1 > v2 ? 1 : 0;
48 check_value( int nExpected )
49 : m_nExpected( nExpected )
53 void operator ()( T& pair )
55 CPPUNIT_ASSERT_CURRENT( pair.second.m_val == m_nExpected );
59 struct insert_functor {
61 void operator()( T& pair )
63 pair.second.m_val = pair.first * 10;
67 struct ensure_functor {
69 void operator()( bool bNew, T& pair )
71 pair.second.m_val = pair.first * 50;
75 struct erase_functor {
85 void operator()( T& i )
88 nVal = i.second.m_val;
92 typedef float other_key;
94 bool operator()( float f, int i ) const
98 bool operator()( int i, float f ) const
105 template <class OrdList>
106 void test_with( OrdList& l)
108 typedef typename OrdList::value_type value_type;
110 typename OrdList::iterator itTest;
111 typename OrdList::const_iterator citTest;
113 CPPUNIT_ASSERT( l.empty() );
115 // insert / find test
116 CPPUNIT_ASSERT( !l.find( 100 ));
117 CPPUNIT_ASSERT( l.insert( 100 ));
118 CPPUNIT_ASSERT( !l.empty() );
119 CPPUNIT_ASSERT( l.find( 100 ));
122 CPPUNIT_ASSERT( l.find( 100, std::ref( chk ) ) );
124 CPPUNIT_ASSERT( !l.find_with( 50, lt<key_type>() ));
125 CPPUNIT_ASSERT( l.insert( 50, 500 ));
126 CPPUNIT_ASSERT( l.find_with( 50, lt<key_type>() ));
127 CPPUNIT_ASSERT( !l.insert( 50, 5 ));
128 chk.m_nExpected = 500;
129 CPPUNIT_ASSERT( l.find_with( 50, lt<key_type>(), std::ref( chk ) ) );
131 CPPUNIT_ASSERT( l.find_with( 100, lt<key_type>(), std::ref( chk ) ) );
132 CPPUNIT_ASSERT( !l.empty() );
134 CPPUNIT_ASSERT( !l.find( 150 ));
135 CPPUNIT_ASSERT( l.insert_key( 150, insert_functor() ));
136 CPPUNIT_ASSERT( l.find( 150 ));
137 chk.m_nExpected = 1500;
138 CPPUNIT_ASSERT( l.find( 150, std::ref( chk ) ) );
140 CPPUNIT_ASSERT( l.find( 100, std::ref( chk ) ) );
141 chk.m_nExpected = 500;
142 CPPUNIT_ASSERT( l.find( 50, std::ref( chk ) ) );
143 CPPUNIT_ASSERT( !l.empty() );
147 CPPUNIT_ASSERT( !l.erase( 500 ));
148 CPPUNIT_ASSERT( !l.empty() );
150 CPPUNIT_ASSERT( l.find( 50 ));
153 l.erase( 50, std::ref( ef ) );
154 CPPUNIT_ASSERT( ef.nKey == 50 );
155 CPPUNIT_ASSERT( ef.nVal == 500 );
157 CPPUNIT_ASSERT( !l.find( 50 ));
160 std::pair<bool, bool> bEnsureResult;
161 bEnsureResult = l.ensure( 100, ensure_functor() );
162 CPPUNIT_ASSERT( bEnsureResult.first );
163 CPPUNIT_ASSERT( !bEnsureResult.second );
164 chk.m_nExpected = 5000;
165 CPPUNIT_ASSERT( l.find( 100, std::ref( chk ) ) );
169 bEnsureResult = l.ensure( 50, std::ref( ef ) );
171 CPPUNIT_ASSERT( bEnsureResult.first );
172 CPPUNIT_ASSERT( bEnsureResult.second );
173 chk.m_nExpected = 2500;
174 CPPUNIT_ASSERT( l.find( 50, std::ref( chk ) ) );
177 CPPUNIT_ASSERT( !l.empty() );
178 CPPUNIT_ASSERT( l.insert_key( 200, insert_functor() ));
179 CPPUNIT_ASSERT( l.insert( 25 ));
180 CPPUNIT_ASSERT( l.erase( 100 ));
181 CPPUNIT_ASSERT( l.erase( 150 ));
184 CPPUNIT_ASSERT( l.erase_with( 200, lt<key_type>(), std::ref(ef)) );
185 CPPUNIT_ASSERT( ef.nKey == 200 );
186 CPPUNIT_ASSERT( ef.nVal == 2000 );
188 CPPUNIT_ASSERT( l.erase_with( 25, lt<key_type>()))
189 CPPUNIT_ASSERT( l.erase( 50 ));
190 CPPUNIT_ASSERT( l.empty() );
194 CPPUNIT_ASSERT( l.empty() );
197 CPPUNIT_ASSERT( l.emplace( 501 ) );
198 CPPUNIT_ASSERT( l.emplace( 251, 152 ));
200 // insert failed - such key exists
201 CPPUNIT_ASSERT( !l.emplace( 501, 2 ) );
202 CPPUNIT_ASSERT( !l.emplace( 251, 10) );
205 CPPUNIT_ASSERT( l.find( 501, std::ref(cv) ));
206 cv.m_nExpected = 152;
207 CPPUNIT_ASSERT( l.find( 251, std::ref(cv) ));
210 CPPUNIT_ASSERT( l.empty() );
215 for ( int i = 0; i < nCount; ++i )
216 CPPUNIT_ASSERT( l.insert(i, i * 2 ) );
219 for ( typename OrdList::iterator it = l.begin(), itEnd = l.end(); it != itEnd; ++it, ++i ) {
220 CPPUNIT_ASSERT( it.key() == i );
221 CPPUNIT_ASSERT( it->first == i );
222 CPPUNIT_ASSERT( (*it).first == i );
224 CPPUNIT_ASSERT( it.val().m_val == i * 2 );
225 CPPUNIT_ASSERT( it->second.m_val == i * 2 );
226 CPPUNIT_ASSERT( (*it).second.m_val == i * 2 );
227 it.val().m_val = i * 3;
230 // Check that we have visited all items
231 for ( int i = 0; i < nCount; ++i ) {
232 chk.m_nExpected = i * 3;
233 CPPUNIT_ASSERT( l.find( i, std::ref( chk ) ) );
237 CPPUNIT_ASSERT( l.empty() );
240 for ( int i = 0; i < nCount; ++i )
241 CPPUNIT_ASSERT( l.insert(i, i * 7) );
244 const OrdList& rl = l;
245 for ( typename OrdList::const_iterator it = rl.begin(), itEnd = rl.end(); it != itEnd; ++it, ++i ) {
246 CPPUNIT_ASSERT( it.key() == i );
247 CPPUNIT_ASSERT( it->first == i );
248 CPPUNIT_ASSERT( (*it).first == i );
250 CPPUNIT_ASSERT( it.val().m_val == i * 7 );
251 CPPUNIT_ASSERT( it->second.m_val == i * 7 );
252 CPPUNIT_ASSERT( (*it).second.m_val == i * 7 );
255 // Check that we have visited all items
256 for ( int i = 0; i < nCount; ++i ) {
257 chk.m_nExpected = i * 7;
258 CPPUNIT_ASSERT( l.find_with( i, lt<key_type>(), std::ref( chk ) ) );
262 CPPUNIT_ASSERT( l.empty() );
266 template <class OrdList>
272 typedef typename OrdList::guarded_ptr guarded_ptr;
274 static int const nLimit = 20;
276 for ( int i = 0; i < nLimit; i++ )
278 std::random_shuffle( arr, arr + nLimit );
281 for ( int i = 0; i < nLimit; ++i )
282 l.insert( arr[i], arr[i] * 2 );
285 for ( int i = 0; i < nLimit; ++i ) {
288 CPPUNIT_ASSERT( l.get(gp, nKey));
289 CPPUNIT_ASSERT( !gp.empty());
290 CPPUNIT_CHECK( gp->first == nKey );
291 CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
294 CPPUNIT_ASSERT( l.extract(gp, nKey));
295 CPPUNIT_ASSERT( !gp.empty());
296 CPPUNIT_CHECK( gp->first == nKey );
297 CPPUNIT_CHECK( gp->second.m_val == nKey*2 );
300 CPPUNIT_CHECK( !l.get(gp, nKey));
301 CPPUNIT_CHECK( gp.empty());
302 CPPUNIT_CHECK( !l.extract( gp, nKey));
303 CPPUNIT_CHECK( gp.empty());
305 CPPUNIT_ASSERT( l.empty());
306 CPPUNIT_CHECK( !l.get(gp, arr[0]));
307 CPPUNIT_CHECK( gp.empty());
308 CPPUNIT_CHECK( !l.extract( gp, arr[0]));
309 CPPUNIT_CHECK( gp.empty());
312 // extract_with/get_with
313 for ( int i = 0; i < nLimit; ++i )
314 l.insert( arr[i], arr[i] * 2 );
317 for ( int i = 0; i < nLimit; ++i ) {
319 other_key key = float(nKey + 0.3);
321 CPPUNIT_ASSERT( l.get_with(gp, key, other_less()));
322 CPPUNIT_ASSERT( !gp.empty());
323 CPPUNIT_CHECK( gp->first == nKey );
324 CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
327 CPPUNIT_ASSERT( l.extract_with(gp, key, other_less()));
328 CPPUNIT_ASSERT( !gp.empty());
329 CPPUNIT_CHECK( gp->first == nKey );
330 CPPUNIT_CHECK( gp->second.m_val == nKey*2 );
333 CPPUNIT_CHECK( !l.get_with(gp, key, other_less()));
334 CPPUNIT_CHECK( gp.empty());
335 CPPUNIT_CHECK( !l.extract_with( gp, key, other_less()));
336 CPPUNIT_CHECK( gp.empty());
338 CPPUNIT_ASSERT( l.empty());
339 CPPUNIT_CHECK( !l.get_with(gp, 3.4f, other_less()));
340 CPPUNIT_CHECK( gp.empty());
341 CPPUNIT_CHECK( !l.extract_with( gp, 3.4f, other_less()));
342 CPPUNIT_CHECK( gp.empty());
346 template <class OrdList>
352 static int const nLimit = 20;
354 typedef typename OrdList::rcu_lock rcu_lock;
355 typedef typename OrdList::value_type value_type;
356 typedef typename OrdList::gc rcu_type;
360 for (int i = 0; i < nLimit; ++i)
362 std::random_shuffle( a, a + nLimit );
365 for ( int i = 0; i < nLimit; ++i )
366 CPPUNIT_ASSERT( l.insert( a[i], a[i]*2 ) );
368 typename OrdList::exempt_ptr ep;
370 for ( int i = 0; i < nLimit; ++i ) {
373 value_type * pGet = l.get( a[i] );
374 CPPUNIT_ASSERT( pGet != nullptr );
375 CPPUNIT_CHECK( pGet->first == a[i] );
376 CPPUNIT_CHECK( pGet->second.m_val == a[i] * 2 );
378 CPPUNIT_ASSERT( l.extract( ep, a[i] ));
379 CPPUNIT_ASSERT( !ep.empty() );
380 CPPUNIT_CHECK( ep->first == a[i] );
381 CPPUNIT_CHECK( (*ep).second.m_val == a[i] * 2 );
386 CPPUNIT_CHECK( l.get( a[i] ) == nullptr );
387 CPPUNIT_CHECK( !l.extract( ep, a[i] ));
388 CPPUNIT_CHECK( ep.empty() );
391 CPPUNIT_ASSERT( l.empty() );
395 CPPUNIT_CHECK( l.get( a[0] ) == nullptr );
396 CPPUNIT_CHECK( !l.extract( ep, a[0] ) );
397 CPPUNIT_CHECK( ep.empty() );
400 // extract_with/get_with
401 for ( int i = 0; i < nLimit; ++i ) {
402 CPPUNIT_ASSERT( l.insert( a[i], a[i]*2 ) );
405 for ( int i = 0; i < nLimit; ++i ) {
406 float itm = a[i] + 0.3f;
409 value_type * pGet = l.get_with( itm, other_less() );
410 CPPUNIT_ASSERT( pGet != nullptr );
411 CPPUNIT_CHECK( pGet->first == a[i] );
412 CPPUNIT_CHECK( pGet->second.m_val == a[i] * 2 );
414 CPPUNIT_ASSERT( l.extract_with( ep, itm, other_less() ));
415 CPPUNIT_ASSERT( !ep.empty() );
416 CPPUNIT_CHECK( ep->first == a[i] );
417 CPPUNIT_CHECK( ep->second.m_val == a[i] * 2 );
422 CPPUNIT_CHECK( l.get_with( itm, other_less() ) == nullptr );
423 CPPUNIT_CHECK( !l.extract_with( ep, itm, other_less() ));
424 CPPUNIT_CHECK( ep.empty() );
427 CPPUNIT_ASSERT( l.empty() );
431 CPPUNIT_CHECK( l.get_with( 3.14f, other_less() ) == nullptr );
432 CPPUNIT_CHECK( !l.extract_with( ep, 3.14f, other_less() ));
433 CPPUNIT_CHECK( ep.empty() );
439 template <class OrdList>
442 typedef typename OrdList::value_type value_type;
443 typedef typename OrdList::iterator iterator;
449 CPPUNIT_ASSERT( l.empty() );
451 // insert / find test
452 CPPUNIT_ASSERT( l.find( 100 ) == l.end() );
453 CPPUNIT_ASSERT( l.insert( 100 ) != l.end() );
454 CPPUNIT_ASSERT( !l.empty() );
455 it = l.find_with( 100, lt<key_type>() );
456 CPPUNIT_ASSERT( it != l.end() );
457 CPPUNIT_ASSERT( it.key() == 100 );
458 CPPUNIT_ASSERT( it.val().m_val == 0 );
460 CPPUNIT_ASSERT( l.find_with( 50, lt<key_type>() ) == l.end() );
461 CPPUNIT_ASSERT( l.insert( 50, 500 ) != l.end());
463 CPPUNIT_ASSERT( it != l.end() );
464 CPPUNIT_ASSERT( it.key() == 50 );
465 CPPUNIT_ASSERT( it.val().m_val == 500 );
467 CPPUNIT_ASSERT( l.insert( 50, 5 ) == l.end() );
469 CPPUNIT_ASSERT( it != l.end() );
470 CPPUNIT_ASSERT( it.key() == 50 );
471 CPPUNIT_ASSERT( it.val().m_val == 500 );
472 CPPUNIT_ASSERT( !l.empty() );
474 CPPUNIT_ASSERT( l.find( 150 ) == l.end() );
475 CPPUNIT_ASSERT( l.insert_key( 150, insert_functor() ) != l.end() );
477 CPPUNIT_ASSERT( it != l.end() );
478 CPPUNIT_ASSERT( it.key() == 150 );
479 CPPUNIT_ASSERT( it.val().m_val == 1500 );
481 CPPUNIT_ASSERT( it != l.end() );
482 CPPUNIT_ASSERT( it.key() == 100 );
483 CPPUNIT_ASSERT( it.val().m_val == 0 );
485 CPPUNIT_ASSERT( it != l.end() );
486 CPPUNIT_ASSERT( it.key() == 50 );
487 CPPUNIT_ASSERT( it.val().m_val == 500 );
490 CPPUNIT_ASSERT( it != l.end() );
491 CPPUNIT_ASSERT( it.key() == 50 );
492 CPPUNIT_ASSERT( it.val().m_val == 25 );
493 CPPUNIT_ASSERT( !l.empty() );
495 // ensure existing item
496 std::pair<iterator, bool> ensureResult;
497 ensureResult = l.ensure( 100 );
498 CPPUNIT_ASSERT( !ensureResult.second );
499 CPPUNIT_ASSERT( ensureResult.first.key() == 100 );
500 CPPUNIT_ASSERT( ensureResult.first.val().m_val == 0 );
501 ensureResult.first.val().m_val = 5;
503 CPPUNIT_ASSERT( it != l.end() );
504 CPPUNIT_ASSERT( it.key() == 100 );
505 CPPUNIT_ASSERT( it.val().m_val == 5 );
507 CPPUNIT_ASSERT( !l.empty() );
510 ensureResult = l.ensure( 1000 );
511 CPPUNIT_ASSERT( ensureResult.second );
512 CPPUNIT_ASSERT( ensureResult.first.key() == 1000 );
513 CPPUNIT_ASSERT( ensureResult.first.val().m_val == 0 );
514 ensureResult.first.val().m_val = 33;
515 ensureResult = l.ensure( 1000 );
516 CPPUNIT_ASSERT( !ensureResult.second );
517 CPPUNIT_ASSERT( ensureResult.first.key() == 1000 );
518 CPPUNIT_ASSERT( ensureResult.first.val().m_val == 33 );
522 CPPUNIT_ASSERT( l.empty() );
525 CPPUNIT_ASSERT( l.emplace( 501 ) != l.end());
526 CPPUNIT_ASSERT( l.emplace( 251, 152 ) != l.end());
528 // insert failed - such key exists
529 CPPUNIT_ASSERT( l.emplace( 501, 2 ) == l.end());
530 CPPUNIT_ASSERT( l.emplace( 251, 10) == l.end());
533 CPPUNIT_ASSERT( it != l.end());
534 CPPUNIT_ASSERT( it.key() == 501 );
535 CPPUNIT_ASSERT( it.val().m_val == 0 );
538 CPPUNIT_ASSERT( it != l.end());
539 CPPUNIT_ASSERT( it.key() == 251 );
540 CPPUNIT_ASSERT( it.val().m_val == 152 );
543 CPPUNIT_ASSERT( l.empty() );
548 for ( int i = 0; i < nCount; ++i )
549 CPPUNIT_ASSERT( l.insert(i, i * 2 ) != l.end() );
552 for ( typename OrdList::iterator iter = l.begin(), itEnd = l.end(); iter != itEnd; ++iter, ++i ) {
553 CPPUNIT_ASSERT( iter.key() == i );
554 CPPUNIT_ASSERT( iter->first == i );
555 CPPUNIT_ASSERT( (*iter).first == i );
557 CPPUNIT_ASSERT( iter.val().m_val == i * 2 );
558 CPPUNIT_ASSERT( iter->second.m_val == i * 2 );
559 CPPUNIT_ASSERT( (*iter).second.m_val == i * 2 );
561 iter.val().m_val = i * 3;
564 // Check that we have visited all items
565 for ( int i = 0; i < nCount; ++i ) {
567 CPPUNIT_ASSERT( it != l.end() );
568 CPPUNIT_ASSERT( it.key() == i );
569 CPPUNIT_ASSERT( it.val().m_val == i * 3 );
573 CPPUNIT_ASSERT( l.empty() );
576 for ( int i = 0; i < nCount; ++i )
577 CPPUNIT_ASSERT( l.insert(i, i * 7) != l.end() );
580 const OrdList& rl = l;
581 for ( typename OrdList::const_iterator iter = rl.begin(), itEnd = rl.end(); iter != itEnd; ++iter, ++i ) {
582 CPPUNIT_ASSERT( iter.key() == i );
583 CPPUNIT_ASSERT( iter->first == i );
584 CPPUNIT_ASSERT( (*iter).first == i );
586 CPPUNIT_ASSERT( iter.val().m_val == i * 7 );
587 CPPUNIT_ASSERT( iter->second.m_val == i * 7 );
588 CPPUNIT_ASSERT( (*iter).second.m_val == i * 7 );
590 // it.val().m_val = i * 3 ; // error: const-iterator
594 CPPUNIT_ASSERT( l.empty() );
612 void RCU_GPI_cmpmix();
617 void RCU_GPB_cmpmix();
622 void RCU_GPT_cmpmix();
627 void RCU_SHB_cmpmix();
632 void RCU_SHT_cmpmix();
640 CPPUNIT_TEST_SUITE(MichaelKVListTestHeader)
642 CPPUNIT_TEST(HP_less)
643 CPPUNIT_TEST(HP_cmpmix)
646 CPPUNIT_TEST(DHP_cmp)
647 CPPUNIT_TEST(DHP_less)
648 CPPUNIT_TEST(DHP_cmpmix)
651 CPPUNIT_TEST(RCU_GPI_cmp)
652 CPPUNIT_TEST(RCU_GPI_less)
653 CPPUNIT_TEST(RCU_GPI_cmpmix)
654 CPPUNIT_TEST(RCU_GPI_ic)
656 CPPUNIT_TEST(RCU_GPB_cmp)
657 CPPUNIT_TEST(RCU_GPB_less)
658 CPPUNIT_TEST(RCU_GPB_cmpmix)
659 CPPUNIT_TEST(RCU_GPB_ic)
661 CPPUNIT_TEST(RCU_GPT_cmp)
662 CPPUNIT_TEST(RCU_GPT_less)
663 CPPUNIT_TEST(RCU_GPT_cmpmix)
664 CPPUNIT_TEST(RCU_GPT_ic)
666 CPPUNIT_TEST(RCU_SHB_cmp)
667 CPPUNIT_TEST(RCU_SHB_less)
668 CPPUNIT_TEST(RCU_SHB_cmpmix)
669 CPPUNIT_TEST(RCU_SHB_ic)
671 CPPUNIT_TEST(RCU_SHT_cmp)
672 CPPUNIT_TEST(RCU_SHT_less)
673 CPPUNIT_TEST(RCU_SHT_cmpmix)
674 CPPUNIT_TEST(RCU_SHT_ic)
676 CPPUNIT_TEST(NOGC_cmp)
677 CPPUNIT_TEST(NOGC_less)
678 CPPUNIT_TEST(NOGC_cmpmix)
679 CPPUNIT_TEST(NOGC_ic)
680 CPPUNIT_TEST_SUITE_END()
683 } // namespace ordlist