3 #include "cppunit/cppunit_proxy.h"
4 #include <cds/container/details/lazy_list_base.h>
7 namespace cc = cds::container;
8 namespace co = cds::container::opt;
10 class LazyKVListTestHeader: 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( 50, std::ref( chk ) ) );
131 CPPUNIT_ASSERT( l.find( 100, 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_with( 150, lt<key_type>(), 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 typename OrdList::iterator it( l.begin() );
220 typename OrdList::const_iterator cit( l.cbegin() );
221 CPPUNIT_CHECK( it == cit );
222 CPPUNIT_CHECK( it != l.end() );
223 CPPUNIT_CHECK( it != l.cend() );
224 CPPUNIT_CHECK( cit != l.end() );
225 CPPUNIT_CHECK( cit != l.cend() );
227 CPPUNIT_CHECK( it != cit );
228 CPPUNIT_CHECK( it != l.end() );
229 CPPUNIT_CHECK( it != l.cend() );
230 CPPUNIT_CHECK( cit != l.end() );
231 CPPUNIT_CHECK( cit != l.cend() );
233 CPPUNIT_CHECK( it == cit );
234 CPPUNIT_CHECK( it != l.end() );
235 CPPUNIT_CHECK( it != l.cend() );
236 CPPUNIT_CHECK( cit != l.end() );
237 CPPUNIT_CHECK( cit != l.cend() );
241 for ( typename OrdList::iterator it = l.begin(), itEnd = l.end(); it != itEnd; ++it, ++i ) {
242 CPPUNIT_ASSERT( it.key() == i );
243 CPPUNIT_ASSERT( it.val().m_val == i * 2 );
244 it.val().m_val = i * 3;
247 // Check that we have visited all items
248 for ( int i = 0; i < nCount; ++i ) {
249 chk.m_nExpected = i * 3;
250 CPPUNIT_ASSERT( l.find( i, std::ref( chk ) ) );
254 CPPUNIT_ASSERT( l.empty() );
257 for ( int i = 0; i < nCount; ++i )
258 CPPUNIT_ASSERT( l.insert(i, i * 7) );
261 const OrdList& rl = l;
262 for ( typename OrdList::const_iterator it = rl.begin(), itEnd = rl.end(); it != itEnd; ++it, ++i ) {
263 CPPUNIT_ASSERT( it.key() == i );
264 CPPUNIT_ASSERT( it.val().m_val == i * 7 );
267 // Check that we have visited all items
268 for ( int i = nCount; i > 0; --i ) {
269 chk.m_nExpected = (i - 1) * 7;
270 CPPUNIT_ASSERT( l.find_with( i - 1, lt<key_type>(), std::ref( chk ) ) );
274 CPPUNIT_ASSERT( l.empty() );
278 template <class OrdList>
284 typedef typename OrdList::guarded_ptr guarded_ptr;
286 static int const nLimit = 20;
288 for ( int i = 0; i < nLimit; i++ )
290 std::random_shuffle( arr, arr + nLimit );
293 for ( int i = 0; i < nLimit; ++i )
294 l.insert( arr[i], arr[i] * 2 );
297 for ( int i = 0; i < nLimit; ++i ) {
301 CPPUNIT_ASSERT( gp );
302 CPPUNIT_ASSERT( !gp.empty());
303 CPPUNIT_CHECK( gp->first == nKey );
304 CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
307 gp = l.extract( nKey );
308 CPPUNIT_ASSERT( gp );
309 CPPUNIT_ASSERT( !gp.empty());
310 CPPUNIT_CHECK( gp->first == nKey );
311 CPPUNIT_CHECK( gp->second.m_val == nKey*2 );
315 CPPUNIT_CHECK( !gp );
316 CPPUNIT_CHECK( gp.empty());
317 CPPUNIT_CHECK( !l.extract( nKey));
318 CPPUNIT_CHECK( gp.empty());
320 CPPUNIT_ASSERT( l.empty());
321 CPPUNIT_CHECK( !l.get(arr[0]));
322 CPPUNIT_CHECK( gp.empty());
323 CPPUNIT_CHECK( !l.extract( arr[0]));
324 CPPUNIT_CHECK( gp.empty());
327 // extract_with/get_with
328 for ( int i = 0; i < nLimit; ++i )
329 l.insert( arr[i], arr[i] * 2 );
332 for ( int i = 0; i < nLimit; ++i ) {
334 other_key key = float(nKey + 0.3);
336 gp = l.get_with( key, other_less() );
337 CPPUNIT_ASSERT( gp );
338 CPPUNIT_ASSERT( !gp.empty());
339 CPPUNIT_CHECK( gp->first == nKey );
340 CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
343 gp = l.extract_with( key, other_less() );
344 CPPUNIT_ASSERT( gp );
345 CPPUNIT_ASSERT( !gp.empty());
346 CPPUNIT_CHECK( gp->first == nKey );
347 CPPUNIT_CHECK( gp->second.m_val == nKey*2 );
350 gp = l.get_with( key, other_less() );
351 CPPUNIT_CHECK( !gp );
352 CPPUNIT_CHECK( gp.empty());
353 CPPUNIT_CHECK( !l.extract_with( key, other_less()));
354 CPPUNIT_CHECK( gp.empty());
356 CPPUNIT_ASSERT( l.empty());
357 CPPUNIT_CHECK( !l.get_with(3.4f, other_less()));
358 CPPUNIT_CHECK( gp.empty());
359 CPPUNIT_CHECK( !l.extract_with( 3.4f, other_less()));
360 CPPUNIT_CHECK( gp.empty());
364 template <class OrdList>
370 static int const nLimit = 20;
372 typedef typename OrdList::rcu_lock rcu_lock;
373 typedef typename OrdList::value_type value_type;
374 typedef typename OrdList::gc rcu_type;
378 for (int i = 0; i < nLimit; ++i)
380 std::random_shuffle( a, a + nLimit );
383 for ( int i = 0; i < nLimit; ++i )
384 CPPUNIT_ASSERT( l.insert( a[i], a[i]*2 ) );
386 typename OrdList::exempt_ptr ep;
388 for ( int i = 0; i < nLimit; ++i ) {
391 value_type * pGet = l.get( a[i] );
392 CPPUNIT_ASSERT( pGet != nullptr );
393 CPPUNIT_CHECK( pGet->first == a[i] );
394 CPPUNIT_CHECK( pGet->second.m_val == a[i] * 2 );
396 ep = l.extract( a[i] );
397 CPPUNIT_ASSERT( ep );
398 CPPUNIT_ASSERT( !ep.empty() );
399 CPPUNIT_CHECK( ep->first == a[i] );
400 CPPUNIT_CHECK( (*ep).second.m_val == a[i] * 2 );
405 CPPUNIT_CHECK( l.get( a[i] ) == nullptr );
406 ep = l.extract( a[i] );
407 CPPUNIT_CHECK( !ep );
408 CPPUNIT_CHECK( ep.empty() );
411 CPPUNIT_ASSERT( l.empty() );
415 CPPUNIT_CHECK( l.get( a[0] ) == nullptr );
416 CPPUNIT_CHECK( !l.extract( a[0] ) );
419 // extract_with/get_with
420 for ( int i = 0; i < nLimit; ++i ) {
421 CPPUNIT_ASSERT( l.insert( a[i], a[i]*2 ) );
424 for ( int i = 0; i < nLimit; ++i ) {
425 float itm = a[i] + 0.3f;
428 value_type * pGet = l.get_with( itm, other_less() );
429 CPPUNIT_ASSERT( pGet != nullptr );
430 CPPUNIT_CHECK( pGet->first == a[i] );
431 CPPUNIT_CHECK( pGet->second.m_val == a[i] * 2 );
433 ep = l.extract_with( itm, other_less() );
434 CPPUNIT_ASSERT( ep );
435 CPPUNIT_ASSERT( !ep.empty() );
436 CPPUNIT_CHECK( ep->first == a[i] );
437 CPPUNIT_CHECK( ep->second.m_val == a[i] * 2 );
442 CPPUNIT_CHECK( l.get_with( itm, other_less()) == nullptr );
443 ep = l.extract_with( itm, other_less() );
444 CPPUNIT_CHECK( !ep );
445 CPPUNIT_CHECK( ep.empty() );
448 CPPUNIT_ASSERT( l.empty() );
452 CPPUNIT_CHECK( l.get_with( 3.14f, other_less() ) == nullptr );
453 CPPUNIT_CHECK( !l.extract_with( 3.14f, other_less() ));
454 CPPUNIT_CHECK( ep.empty() );
459 template <class OrdList>
462 typedef typename OrdList::value_type value_type;
463 typedef typename OrdList::iterator iterator;
469 CPPUNIT_ASSERT( l.empty() );
471 // insert / find test
472 CPPUNIT_ASSERT( l.find( 100 ) == l.end() );
473 CPPUNIT_ASSERT( l.insert( 100 ) != l.end() );
474 CPPUNIT_ASSERT( !l.empty() );
476 CPPUNIT_ASSERT( it != l.end() );
477 CPPUNIT_ASSERT( it.key() == 100 );
478 CPPUNIT_ASSERT( it.val().m_val == 0 );
480 CPPUNIT_ASSERT( l.find_with( 50, lt<key_type>() ) == l.end() );
481 CPPUNIT_ASSERT( l.insert( 50, 500 ) != l.end());
483 CPPUNIT_ASSERT( it != l.end() );
484 CPPUNIT_ASSERT( it.key() == 50 );
485 CPPUNIT_ASSERT( it.val().m_val == 500 );
487 CPPUNIT_ASSERT( l.insert( 50, 5 ) == l.end() );
489 CPPUNIT_ASSERT( it != l.end() );
490 CPPUNIT_ASSERT( it.key() == 50 );
491 CPPUNIT_ASSERT( it.val().m_val == 500 );
492 CPPUNIT_ASSERT( !l.empty() );
494 CPPUNIT_ASSERT( l.find( 150 ) == l.end() );
495 CPPUNIT_ASSERT( l.insert_key( 150, insert_functor() ) != l.end() );
497 CPPUNIT_ASSERT( it != l.end() );
498 CPPUNIT_ASSERT( it.key() == 150 );
499 CPPUNIT_ASSERT( it.val().m_val == 1500 );
501 CPPUNIT_ASSERT( it != l.end() );
502 CPPUNIT_ASSERT( it.key() == 100 );
503 CPPUNIT_ASSERT( it.val().m_val == 0 );
505 CPPUNIT_ASSERT( it != l.end() );
506 CPPUNIT_ASSERT( it.key() == 50 );
507 CPPUNIT_ASSERT( it.val().m_val == 500 );
510 CPPUNIT_ASSERT( it != l.end() );
511 CPPUNIT_ASSERT( it.key() == 50 );
512 CPPUNIT_ASSERT( it.val().m_val == 25 );
513 CPPUNIT_ASSERT( !l.empty() );
515 // ensure existing item
516 std::pair<iterator, bool> ensureResult;
517 ensureResult = l.ensure( 100 );
518 CPPUNIT_ASSERT( !ensureResult.second );
519 CPPUNIT_ASSERT( ensureResult.first.key() == 100 );
520 CPPUNIT_ASSERT( ensureResult.first.val().m_val == 0 );
521 ensureResult.first.val().m_val = 5;
523 CPPUNIT_ASSERT( it != l.end() );
524 CPPUNIT_ASSERT( it.key() == 100 );
525 CPPUNIT_ASSERT( it.val().m_val == 5 );
527 CPPUNIT_ASSERT( !l.empty() );
530 ensureResult = l.ensure( 1000 );
531 CPPUNIT_ASSERT( ensureResult.second );
532 CPPUNIT_ASSERT( ensureResult.first.key() == 1000 );
533 CPPUNIT_ASSERT( ensureResult.first.val().m_val == 0 );
534 ensureResult.first.val().m_val = 33;
535 ensureResult = l.ensure( 1000 );
536 CPPUNIT_ASSERT( !ensureResult.second );
537 CPPUNIT_ASSERT( ensureResult.first.key() == 1000 );
538 CPPUNIT_ASSERT( ensureResult.first.val().m_val == 33 );
542 CPPUNIT_ASSERT( l.empty() );
545 CPPUNIT_ASSERT( l.emplace( 501 ) != l.end());
546 CPPUNIT_ASSERT( l.emplace( 251, 152 ) != l.end());
548 // insert failed - such key exists
549 CPPUNIT_ASSERT( l.emplace( 501, 2 ) == l.end());
550 CPPUNIT_ASSERT( l.emplace( 251, 10) == l.end());
553 CPPUNIT_ASSERT( it != l.end() );
554 CPPUNIT_ASSERT( it.key() == 501 );
555 CPPUNIT_ASSERT( it.val().m_val == 0 );
558 CPPUNIT_ASSERT( it != l.end() );
559 CPPUNIT_ASSERT( it.key() == 251 );
560 CPPUNIT_ASSERT( it.val().m_val == 152 );
563 CPPUNIT_ASSERT( l.empty() );
568 for ( int i = 0; i < nCount; ++i )
569 CPPUNIT_ASSERT( l.insert(i, i * 2 ) != l.end() );
572 typename OrdList::iterator it( l.begin() );
573 typename OrdList::const_iterator cit( l.cbegin() );
574 CPPUNIT_CHECK( it == cit );
575 CPPUNIT_CHECK( it != l.end() );
576 CPPUNIT_CHECK( it != l.cend() );
577 CPPUNIT_CHECK( cit != l.end() );
578 CPPUNIT_CHECK( cit != l.cend() );
580 CPPUNIT_CHECK( it != cit );
581 CPPUNIT_CHECK( it != l.end() );
582 CPPUNIT_CHECK( it != l.cend() );
583 CPPUNIT_CHECK( cit != l.end() );
584 CPPUNIT_CHECK( cit != l.cend() );
586 CPPUNIT_CHECK( it == cit );
587 CPPUNIT_CHECK( it != l.end() );
588 CPPUNIT_CHECK( it != l.cend() );
589 CPPUNIT_CHECK( cit != l.end() );
590 CPPUNIT_CHECK( cit != l.cend() );
594 for ( typename OrdList::iterator iter = l.begin(), itEnd = l.end(); iter != itEnd; ++iter, ++i ) {
595 CPPUNIT_ASSERT( iter.key() == i );
596 CPPUNIT_ASSERT( iter->first == i );
597 CPPUNIT_ASSERT( (*iter).first == i );
599 CPPUNIT_ASSERT( iter.val().m_val == i * 2 );
600 CPPUNIT_ASSERT( iter->second.m_val == i * 2 );
601 CPPUNIT_ASSERT( (*iter).second.m_val == i * 2 );
603 iter.val().m_val = i * 3;
606 // Check that we have visited all items
607 for ( int i = 0; i < nCount; ++i ) {
609 CPPUNIT_ASSERT( it != l.end() );
610 CPPUNIT_ASSERT( it.key() == i );
611 CPPUNIT_ASSERT( it.val().m_val == i * 3 );
615 CPPUNIT_ASSERT( l.empty() );
618 for ( int i = 0; i < nCount; ++i )
619 CPPUNIT_ASSERT( l.insert(i, i * 7) != l.end() );
622 const OrdList& rl = l;
623 for ( typename OrdList::const_iterator iter = rl.begin(), itEnd = rl.end(); iter != itEnd; ++iter, ++i ) {
624 CPPUNIT_ASSERT( iter.key() == i );
625 CPPUNIT_ASSERT( iter->first == i );
626 CPPUNIT_ASSERT( (*iter).first == i );
628 CPPUNIT_ASSERT( iter.val().m_val == i * 7 );
629 CPPUNIT_ASSERT( iter->second.m_val == i * 7 );
630 CPPUNIT_ASSERT( (*iter).second.m_val == i * 7 );
631 // it.val().m_val = i * 3 ; // error: const-iterator
635 CPPUNIT_ASSERT( l.empty() );
653 void RCU_GPI_cmpmix();
658 void RCU_GPB_cmpmix();
663 void RCU_GPT_cmpmix();
668 void RCU_SHB_cmpmix();
673 void RCU_SHT_cmpmix();
681 CPPUNIT_TEST_SUITE(LazyKVListTestHeader)
683 CPPUNIT_TEST(HP_less)
684 CPPUNIT_TEST(HP_cmpmix)
687 CPPUNIT_TEST(DHP_cmp)
688 CPPUNIT_TEST(DHP_less)
689 CPPUNIT_TEST(DHP_cmpmix)
692 CPPUNIT_TEST(RCU_GPI_cmp)
693 CPPUNIT_TEST(RCU_GPI_less)
694 CPPUNIT_TEST(RCU_GPI_cmpmix)
695 CPPUNIT_TEST(RCU_GPI_ic)
697 CPPUNIT_TEST(RCU_GPB_cmp)
698 CPPUNIT_TEST(RCU_GPB_less)
699 CPPUNIT_TEST(RCU_GPB_cmpmix)
700 CPPUNIT_TEST(RCU_GPB_ic)
702 CPPUNIT_TEST(RCU_GPT_cmp)
703 CPPUNIT_TEST(RCU_GPT_less)
704 CPPUNIT_TEST(RCU_GPT_cmpmix)
705 CPPUNIT_TEST(RCU_GPT_ic)
707 CPPUNIT_TEST(RCU_SHB_cmp)
708 CPPUNIT_TEST(RCU_SHB_less)
709 CPPUNIT_TEST(RCU_SHB_cmpmix)
710 CPPUNIT_TEST(RCU_SHB_ic)
712 CPPUNIT_TEST(RCU_SHT_cmp)
713 CPPUNIT_TEST(RCU_SHT_less)
714 CPPUNIT_TEST(RCU_SHT_cmpmix)
715 CPPUNIT_TEST(RCU_SHT_ic)
717 CPPUNIT_TEST(NOGC_cmp)
718 CPPUNIT_TEST(NOGC_less)
719 CPPUNIT_TEST(NOGC_cmpmix)
720 CPPUNIT_TEST(NOGC_ic)
721 CPPUNIT_TEST_SUITE_END()
724 } // namespace ordlist