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 );
306 gp = l.extract( nKey );
307 CPPUNIT_ASSERT( gp );
308 CPPUNIT_ASSERT( !gp.empty());
309 CPPUNIT_CHECK( gp->first == nKey );
310 CPPUNIT_CHECK( gp->second.m_val == nKey*2 );
313 CPPUNIT_CHECK( !gp );
314 CPPUNIT_CHECK( gp.empty());
315 CPPUNIT_CHECK( !l.extract( nKey));
316 CPPUNIT_CHECK( gp.empty());
318 CPPUNIT_ASSERT( l.empty());
319 CPPUNIT_CHECK( !l.get(arr[0]));
320 CPPUNIT_CHECK( gp.empty());
321 CPPUNIT_CHECK( !l.extract( arr[0]));
322 CPPUNIT_CHECK( gp.empty());
325 // extract_with/get_with
326 for ( int i = 0; i < nLimit; ++i )
327 l.insert( arr[i], arr[i] * 2 );
330 for ( int i = 0; i < nLimit; ++i ) {
332 other_key key = float(nKey + 0.3);
334 gp = l.get_with( key, other_less() );
335 CPPUNIT_ASSERT( gp );
336 CPPUNIT_ASSERT( !gp.empty());
337 CPPUNIT_CHECK( gp->first == nKey );
338 CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
340 gp = l.extract_with( key, other_less() );
341 CPPUNIT_ASSERT( gp );
342 CPPUNIT_ASSERT( !gp.empty());
343 CPPUNIT_CHECK( gp->first == nKey );
344 CPPUNIT_CHECK( gp->second.m_val == nKey*2 );
346 gp = l.get_with( key, other_less() );
347 CPPUNIT_CHECK( !gp );
348 CPPUNIT_CHECK( gp.empty());
349 CPPUNIT_CHECK( !l.extract_with( key, other_less()));
350 CPPUNIT_CHECK( gp.empty());
352 CPPUNIT_ASSERT( l.empty());
353 CPPUNIT_CHECK( !l.get_with(3.4f, other_less()));
354 CPPUNIT_CHECK( gp.empty());
355 CPPUNIT_CHECK( !l.extract_with( 3.4f, other_less()));
356 CPPUNIT_CHECK( gp.empty());
360 template <class OrdList>
366 static int const nLimit = 20;
368 typedef typename OrdList::rcu_lock rcu_lock;
369 typedef typename OrdList::value_type value_type;
370 typedef typename OrdList::gc rcu_type;
374 for (int i = 0; i < nLimit; ++i)
376 std::random_shuffle( a, a + nLimit );
379 for ( int i = 0; i < nLimit; ++i )
380 CPPUNIT_ASSERT( l.insert( a[i], a[i]*2 ) );
382 typename OrdList::exempt_ptr ep;
384 for ( int i = 0; i < nLimit; ++i ) {
387 value_type * pGet = l.get( a[i] );
388 CPPUNIT_ASSERT( pGet != nullptr );
389 CPPUNIT_CHECK( pGet->first == a[i] );
390 CPPUNIT_CHECK( pGet->second.m_val == a[i] * 2 );
392 ep = l.extract( a[i] );
393 CPPUNIT_ASSERT( ep );
394 CPPUNIT_ASSERT( !ep.empty() );
395 CPPUNIT_CHECK( ep->first == a[i] );
396 CPPUNIT_CHECK( (*ep).second.m_val == a[i] * 2 );
401 CPPUNIT_CHECK( l.get( a[i] ) == nullptr );
402 ep = l.extract( a[i] );
403 CPPUNIT_CHECK( !ep );
404 CPPUNIT_CHECK( ep.empty() );
407 CPPUNIT_ASSERT( l.empty() );
411 CPPUNIT_CHECK( l.get( a[0] ) == nullptr );
412 CPPUNIT_CHECK( !l.extract( a[0] ) );
413 //CPPUNIT_CHECK( ep.empty() );
416 // extract_with/get_with
417 for ( int i = 0; i < nLimit; ++i ) {
418 CPPUNIT_ASSERT( l.insert( a[i], a[i]*2 ) );
421 for ( int i = 0; i < nLimit; ++i ) {
422 float itm = a[i] + 0.3f;
425 value_type * pGet = l.get_with( itm, other_less() );
426 CPPUNIT_ASSERT( pGet != nullptr );
427 CPPUNIT_CHECK( pGet->first == a[i] );
428 CPPUNIT_CHECK( pGet->second.m_val == a[i] * 2 );
430 ep = l.extract_with( itm, other_less() );
431 CPPUNIT_ASSERT( ep );
432 CPPUNIT_ASSERT( !ep.empty() );
433 CPPUNIT_CHECK( ep->first == a[i] );
434 CPPUNIT_CHECK( ep->second.m_val == a[i] * 2 );
439 CPPUNIT_CHECK( l.get_with( itm, other_less()) == nullptr );
440 ep = l.extract_with( itm, other_less() );
441 CPPUNIT_CHECK( !ep );
442 CPPUNIT_CHECK( ep.empty() );
445 CPPUNIT_ASSERT( l.empty() );
449 CPPUNIT_CHECK( l.get_with( 3.14f, other_less() ) == nullptr );
450 CPPUNIT_CHECK( !l.extract_with( 3.14f, other_less() ));
451 CPPUNIT_CHECK( ep.empty() );
456 template <class OrdList>
459 typedef typename OrdList::value_type value_type;
460 typedef typename OrdList::iterator iterator;
466 CPPUNIT_ASSERT( l.empty() );
468 // insert / find test
469 CPPUNIT_ASSERT( l.find( 100 ) == l.end() );
470 CPPUNIT_ASSERT( l.insert( 100 ) != l.end() );
471 CPPUNIT_ASSERT( !l.empty() );
473 CPPUNIT_ASSERT( it != l.end() );
474 CPPUNIT_ASSERT( it.key() == 100 );
475 CPPUNIT_ASSERT( it.val().m_val == 0 );
477 CPPUNIT_ASSERT( l.find_with( 50, lt<key_type>() ) == l.end() );
478 CPPUNIT_ASSERT( l.insert( 50, 500 ) != l.end());
480 CPPUNIT_ASSERT( it != l.end() );
481 CPPUNIT_ASSERT( it.key() == 50 );
482 CPPUNIT_ASSERT( it.val().m_val == 500 );
484 CPPUNIT_ASSERT( l.insert( 50, 5 ) == l.end() );
486 CPPUNIT_ASSERT( it != l.end() );
487 CPPUNIT_ASSERT( it.key() == 50 );
488 CPPUNIT_ASSERT( it.val().m_val == 500 );
489 CPPUNIT_ASSERT( !l.empty() );
491 CPPUNIT_ASSERT( l.find( 150 ) == l.end() );
492 CPPUNIT_ASSERT( l.insert_key( 150, insert_functor() ) != l.end() );
494 CPPUNIT_ASSERT( it != l.end() );
495 CPPUNIT_ASSERT( it.key() == 150 );
496 CPPUNIT_ASSERT( it.val().m_val == 1500 );
498 CPPUNIT_ASSERT( it != l.end() );
499 CPPUNIT_ASSERT( it.key() == 100 );
500 CPPUNIT_ASSERT( it.val().m_val == 0 );
502 CPPUNIT_ASSERT( it != l.end() );
503 CPPUNIT_ASSERT( it.key() == 50 );
504 CPPUNIT_ASSERT( it.val().m_val == 500 );
507 CPPUNIT_ASSERT( it != l.end() );
508 CPPUNIT_ASSERT( it.key() == 50 );
509 CPPUNIT_ASSERT( it.val().m_val == 25 );
510 CPPUNIT_ASSERT( !l.empty() );
512 // ensure existing item
513 std::pair<iterator, bool> ensureResult;
514 ensureResult = l.ensure( 100 );
515 CPPUNIT_ASSERT( !ensureResult.second );
516 CPPUNIT_ASSERT( ensureResult.first.key() == 100 );
517 CPPUNIT_ASSERT( ensureResult.first.val().m_val == 0 );
518 ensureResult.first.val().m_val = 5;
520 CPPUNIT_ASSERT( it != l.end() );
521 CPPUNIT_ASSERT( it.key() == 100 );
522 CPPUNIT_ASSERT( it.val().m_val == 5 );
524 CPPUNIT_ASSERT( !l.empty() );
527 ensureResult = l.ensure( 1000 );
528 CPPUNIT_ASSERT( ensureResult.second );
529 CPPUNIT_ASSERT( ensureResult.first.key() == 1000 );
530 CPPUNIT_ASSERT( ensureResult.first.val().m_val == 0 );
531 ensureResult.first.val().m_val = 33;
532 ensureResult = l.ensure( 1000 );
533 CPPUNIT_ASSERT( !ensureResult.second );
534 CPPUNIT_ASSERT( ensureResult.first.key() == 1000 );
535 CPPUNIT_ASSERT( ensureResult.first.val().m_val == 33 );
539 CPPUNIT_ASSERT( l.empty() );
542 CPPUNIT_ASSERT( l.emplace( 501 ) != l.end());
543 CPPUNIT_ASSERT( l.emplace( 251, 152 ) != l.end());
545 // insert failed - such key exists
546 CPPUNIT_ASSERT( l.emplace( 501, 2 ) == l.end());
547 CPPUNIT_ASSERT( l.emplace( 251, 10) == l.end());
550 CPPUNIT_ASSERT( it != l.end() );
551 CPPUNIT_ASSERT( it.key() == 501 );
552 CPPUNIT_ASSERT( it.val().m_val == 0 );
555 CPPUNIT_ASSERT( it != l.end() );
556 CPPUNIT_ASSERT( it.key() == 251 );
557 CPPUNIT_ASSERT( it.val().m_val == 152 );
560 CPPUNIT_ASSERT( l.empty() );
565 for ( int i = 0; i < nCount; ++i )
566 CPPUNIT_ASSERT( l.insert(i, i * 2 ) != l.end() );
569 typename OrdList::iterator it( l.begin() );
570 typename OrdList::const_iterator cit( l.cbegin() );
571 CPPUNIT_CHECK( it == cit );
572 CPPUNIT_CHECK( it != l.end() );
573 CPPUNIT_CHECK( it != l.cend() );
574 CPPUNIT_CHECK( cit != l.end() );
575 CPPUNIT_CHECK( cit != l.cend() );
577 CPPUNIT_CHECK( it != cit );
578 CPPUNIT_CHECK( it != l.end() );
579 CPPUNIT_CHECK( it != l.cend() );
580 CPPUNIT_CHECK( cit != l.end() );
581 CPPUNIT_CHECK( cit != l.cend() );
583 CPPUNIT_CHECK( it == cit );
584 CPPUNIT_CHECK( it != l.end() );
585 CPPUNIT_CHECK( it != l.cend() );
586 CPPUNIT_CHECK( cit != l.end() );
587 CPPUNIT_CHECK( cit != l.cend() );
591 for ( typename OrdList::iterator iter = l.begin(), itEnd = l.end(); iter != itEnd; ++iter, ++i ) {
592 CPPUNIT_ASSERT( iter.key() == i );
593 CPPUNIT_ASSERT( iter->first == i );
594 CPPUNIT_ASSERT( (*iter).first == i );
596 CPPUNIT_ASSERT( iter.val().m_val == i * 2 );
597 CPPUNIT_ASSERT( iter->second.m_val == i * 2 );
598 CPPUNIT_ASSERT( (*iter).second.m_val == i * 2 );
600 iter.val().m_val = i * 3;
603 // Check that we have visited all items
604 for ( int i = 0; i < nCount; ++i ) {
606 CPPUNIT_ASSERT( it != l.end() );
607 CPPUNIT_ASSERT( it.key() == i );
608 CPPUNIT_ASSERT( it.val().m_val == i * 3 );
612 CPPUNIT_ASSERT( l.empty() );
615 for ( int i = 0; i < nCount; ++i )
616 CPPUNIT_ASSERT( l.insert(i, i * 7) != l.end() );
619 const OrdList& rl = l;
620 for ( typename OrdList::const_iterator iter = rl.begin(), itEnd = rl.end(); iter != itEnd; ++iter, ++i ) {
621 CPPUNIT_ASSERT( iter.key() == i );
622 CPPUNIT_ASSERT( iter->first == i );
623 CPPUNIT_ASSERT( (*iter).first == i );
625 CPPUNIT_ASSERT( iter.val().m_val == i * 7 );
626 CPPUNIT_ASSERT( iter->second.m_val == i * 7 );
627 CPPUNIT_ASSERT( (*iter).second.m_val == i * 7 );
628 // it.val().m_val = i * 3 ; // error: const-iterator
632 CPPUNIT_ASSERT( l.empty() );
650 void RCU_GPI_cmpmix();
655 void RCU_GPB_cmpmix();
660 void RCU_GPT_cmpmix();
665 void RCU_SHB_cmpmix();
670 void RCU_SHT_cmpmix();
678 CPPUNIT_TEST_SUITE(LazyKVListTestHeader)
680 CPPUNIT_TEST(HP_less)
681 CPPUNIT_TEST(HP_cmpmix)
684 CPPUNIT_TEST(DHP_cmp)
685 CPPUNIT_TEST(DHP_less)
686 CPPUNIT_TEST(DHP_cmpmix)
689 CPPUNIT_TEST(RCU_GPI_cmp)
690 CPPUNIT_TEST(RCU_GPI_less)
691 CPPUNIT_TEST(RCU_GPI_cmpmix)
692 CPPUNIT_TEST(RCU_GPI_ic)
694 CPPUNIT_TEST(RCU_GPB_cmp)
695 CPPUNIT_TEST(RCU_GPB_less)
696 CPPUNIT_TEST(RCU_GPB_cmpmix)
697 CPPUNIT_TEST(RCU_GPB_ic)
699 CPPUNIT_TEST(RCU_GPT_cmp)
700 CPPUNIT_TEST(RCU_GPT_less)
701 CPPUNIT_TEST(RCU_GPT_cmpmix)
702 CPPUNIT_TEST(RCU_GPT_ic)
704 CPPUNIT_TEST(RCU_SHB_cmp)
705 CPPUNIT_TEST(RCU_SHB_less)
706 CPPUNIT_TEST(RCU_SHB_cmpmix)
707 CPPUNIT_TEST(RCU_SHB_ic)
709 CPPUNIT_TEST(RCU_SHT_cmp)
710 CPPUNIT_TEST(RCU_SHT_less)
711 CPPUNIT_TEST(RCU_SHT_cmpmix)
712 CPPUNIT_TEST(RCU_SHT_ic)
714 CPPUNIT_TEST(NOGC_cmp)
715 CPPUNIT_TEST(NOGC_less)
716 CPPUNIT_TEST(NOGC_cmpmix)
717 CPPUNIT_TEST(NOGC_ic)
718 CPPUNIT_TEST_SUITE_END()
721 } // namespace ordlist