3 #include "cppunit/cppunit_proxy.h"
4 #include <cds/intrusive/details/lazy_list_base.h>
7 namespace ci = cds::intrusive;
8 namespace co = cds::opt;
10 class IntrusiveLazyListHeaderTest: public CppUnitMini::TestCase
16 int nEnsureExistsCall;
23 , nEnsureExistsCall(0)
34 stat& operator =(const stat& s)
36 memcpy( this, &s, sizeof(s));
41 template <typename GC>
42 struct base_int_item: public ci::lazy_list::node< GC >
52 base_int_item(int key, int val)
58 base_int_item(const base_int_item& v )
64 const int& key() const
70 template <typename GC>
71 struct member_int_item
76 ci::lazy_list::node< GC > hMember;
83 member_int_item(int key, int val)
89 member_int_item(const member_int_item& v )
95 const int& key() const
101 template <typename T>
104 bool operator ()(const T& v1, const T& v2 ) const
106 return v1.key() < v2.key();
109 template <typename Q>
110 bool operator ()(const T& v1, const Q& v2 ) const
112 return v1.key() < v2;
115 template <typename Q>
116 bool operator ()(const Q& v1, const T& v2 ) const
118 return v1 < v2.key();
122 template <typename T>
124 int operator ()(const T& v1, const T& v2 ) const
126 if ( v1.key() < v2.key() )
128 return v1.key() > v2.key() ? 1 : 0;
131 template <typename Q>
132 int operator ()(const T& v1, const Q& v2 ) const
136 return v1.key() > v2 ? 1 : 0;
139 template <typename Q>
140 int operator ()(const Q& v1, const T& v2 ) const
144 return v1 > v2.key() ? 1 : 0;
157 template <typename T, typename Q>
158 bool operator()( T const& i1, Q const& i2) const
160 return i1.nKey < i2.nKey;
164 struct faked_disposer
166 template <typename T>
167 void operator ()( T * p )
169 ++p->s.nDisposeCount;
173 struct ensure_functor
175 template <typename T>
176 void operator ()(bool bNew, T& item, T& val )
179 ++item.s.nEnsureNewCall;
181 ++item.s.nEnsureExistsCall;
187 template <typename T, typename Q>
188 void operator ()( T& item, Q& val )
196 template <typename T>
197 void operator()( T const& item )
203 template <class OrdList>
204 void test_int_common()
206 typedef typename OrdList::value_type value_type;
208 value_type v1( 10, 50 );
209 value_type v2( 5, 25 );
210 value_type v3( 20, 100 );
213 CPPUNIT_ASSERT( l.empty() );
215 CPPUNIT_ASSERT( l.insert( v1 )) ; // true
216 CPPUNIT_ASSERT( l.find( v1.key() ));
218 CPPUNIT_ASSERT( v1.s.nFindCall == 0 );
219 CPPUNIT_ASSERT( l.find( v1.key(), find_functor() ));
220 CPPUNIT_ASSERT( v1.s.nFindCall == 1 );
222 CPPUNIT_ASSERT( !l.find_with( v2.key(), less<value_type>() ));
223 CPPUNIT_ASSERT( !l.find( v3.key(), find_functor() ));
224 CPPUNIT_ASSERT( !l.empty() );
226 //CPPUNIT_ASSERT( !l.insert( v1 )) ; // assertion "is_empty" is raised
230 CPPUNIT_ASSERT( !l.insert( v )) ; // false
233 std::pair<bool, bool> ret = l.ensure( v2, ensure_functor() );
234 CPPUNIT_ASSERT( ret.first );
235 CPPUNIT_ASSERT( ret.second );
236 CPPUNIT_ASSERT( v2.s.nEnsureNewCall == 1 );
237 CPPUNIT_ASSERT( v2.s.nEnsureExistsCall == 0 );
239 //CPPUNIT_ASSERT( !l.insert( v2 )) ; // assertion "is_empty"
241 CPPUNIT_ASSERT( l.find( v1.key() )) ; // true
243 CPPUNIT_ASSERT( v1.s.nFindCall == 1 );
244 CPPUNIT_ASSERT( l.find( v1.key(), find_functor() ));
245 CPPUNIT_ASSERT( v1.s.nFindCall == 2 );
247 CPPUNIT_ASSERT( l.find( v2.key() ));
249 CPPUNIT_ASSERT( v2.s.nFindCall == 0 );
250 CPPUNIT_ASSERT( l.find_with( v2.key(), less<value_type>(), find_functor() ));
251 CPPUNIT_ASSERT( v2.s.nFindCall == 1 );
253 CPPUNIT_ASSERT( !l.find( v3.key() ));
256 CPPUNIT_ASSERT( v2.s.nEnsureExistsCall == 0 );
257 CPPUNIT_ASSERT( v2.s.nEnsureNewCall == 1 );
260 ret = l.ensure( v, ensure_functor() );
262 CPPUNIT_ASSERT( ret.first );
263 CPPUNIT_ASSERT( !ret.second );
264 CPPUNIT_ASSERT( v2.s.nEnsureExistsCall == 1 );
265 CPPUNIT_ASSERT( v2.s.nEnsureNewCall == 1 );
266 CPPUNIT_ASSERT( v.s.nEnsureExistsCall == 0 );
267 CPPUNIT_ASSERT( v.s.nEnsureNewCall == 0 );
270 CPPUNIT_ASSERT( !l.empty() );
272 CPPUNIT_ASSERT( l.insert( v3 )) ; // true
273 CPPUNIT_ASSERT( l.find( v3.key() ));
275 CPPUNIT_ASSERT( v3.s.nFindCall == 0 );
276 CPPUNIT_ASSERT( l.find( v3.key(), find_functor() ));
277 CPPUNIT_ASSERT( v3.s.nFindCall == 1 );
279 CPPUNIT_ASSERT( l.unlink( v2 ) );
280 CPPUNIT_ASSERT( l.find( v1.key() )) ; // true
281 CPPUNIT_ASSERT( !l.find( v2.key() )) ; // true
282 CPPUNIT_ASSERT( l.find( v3.key() )) ; // true
283 CPPUNIT_ASSERT( !l.empty() );
284 CPPUNIT_ASSERT( !l.unlink( v2 ) );
287 // v1 key is in the list but v NODE is not in the list
289 CPPUNIT_ASSERT( !l.unlink( v ) );
292 CPPUNIT_ASSERT( l.unlink( v1 ) );
293 CPPUNIT_ASSERT( !l.unlink( v1 ) );
294 CPPUNIT_ASSERT( !l.find( v1.key() ));
295 CPPUNIT_ASSERT( !l.find( v2.key() ));
296 CPPUNIT_ASSERT( l.find( v3.key() ));
297 CPPUNIT_ASSERT( !l.empty() );
298 CPPUNIT_ASSERT( !l.unlink( v1 ) );
299 CPPUNIT_ASSERT( !l.unlink( v2 ) );
301 CPPUNIT_ASSERT( l.unlink( v3 ) );
302 CPPUNIT_ASSERT( !l.find( v1.key() ));
303 CPPUNIT_ASSERT( !l.find_with( v2.key(), less<value_type>() ));
304 CPPUNIT_ASSERT( !l.find( v3.key() ));
305 CPPUNIT_ASSERT( l.empty() );
306 CPPUNIT_ASSERT( !l.unlink( v1 ) );
307 CPPUNIT_ASSERT( !l.unlink( v2 ) );
308 CPPUNIT_ASSERT( !l.unlink( v3 ) );
310 // Apply retired pointer to clean links
311 OrdList::gc::force_dispose();
314 ret = l.ensure( v3, ensure_functor() );
315 CPPUNIT_ASSERT( ret.first );
316 CPPUNIT_ASSERT( ret.second );
317 CPPUNIT_ASSERT( v3.s.nEnsureNewCall == s.nEnsureNewCall + 1);
318 CPPUNIT_ASSERT( v3.s.nEnsureExistsCall == s.nEnsureExistsCall );
319 CPPUNIT_ASSERT( !l.empty() );
322 ret = l.ensure( v2, ensure_functor() );
323 CPPUNIT_ASSERT( ret.first );
324 CPPUNIT_ASSERT( ret.second );
325 CPPUNIT_ASSERT( v2.s.nEnsureNewCall == s.nEnsureNewCall + 1);
326 CPPUNIT_ASSERT( v2.s.nEnsureExistsCall == s.nEnsureExistsCall );
327 CPPUNIT_ASSERT( !l.empty() );
330 ret = l.ensure( v1, ensure_functor() );
331 CPPUNIT_ASSERT( ret.first );
332 CPPUNIT_ASSERT( ret.second );
333 CPPUNIT_ASSERT( v1.s.nEnsureNewCall == s.nEnsureNewCall + 1);
334 CPPUNIT_ASSERT( v1.s.nEnsureExistsCall == s.nEnsureExistsCall );
335 CPPUNIT_ASSERT( !l.empty() );
338 CPPUNIT_ASSERT( l.erase( v1.key()) );
339 //CPPUNIT_ASSERT( v1.s.nDisposeCount == 0 );
340 CPPUNIT_ASSERT( !l.empty() );
342 CPPUNIT_ASSERT( v2.s.nEraseCall == 0 );
343 CPPUNIT_ASSERT( l.erase_with( v2.key(), less<value_type>(), erase_functor()) );
344 CPPUNIT_ASSERT( v2.s.nEraseCall == 1 );
345 CPPUNIT_ASSERT( !l.erase_with( v2.key(), less<value_type>()));
346 CPPUNIT_ASSERT( v2.s.nEraseCall == 1 );
347 //CPPUNIT_ASSERT( v2.s.nDisposeCount == 0 );
348 CPPUNIT_ASSERT( !l.empty() );
350 CPPUNIT_ASSERT( !l.erase( v2 ));
351 CPPUNIT_ASSERT( !l.erase( v1 ));
352 //CPPUNIT_ASSERT( v2.s.nDisposeCount == 0 );
353 CPPUNIT_ASSERT( !l.empty() );
355 CPPUNIT_ASSERT( v3.s.nEraseCall == 0 );
356 CPPUNIT_ASSERT( l.erase( v3, erase_functor() ));
357 CPPUNIT_ASSERT( v3.s.nEraseCall == 1 );
358 //CPPUNIT_ASSERT( v3.s.nDisposeCount == 0 );
359 CPPUNIT_ASSERT( l.empty() );
361 // Apply retired pointer to clean links
362 OrdList::gc::force_dispose();
365 CPPUNIT_ASSERT( l.insert( v1 ));
366 CPPUNIT_ASSERT( l.insert( v3 ));
367 CPPUNIT_ASSERT( !l.empty() );
368 CPPUNIT_ASSERT( !l.unlink( v2 ));
369 CPPUNIT_ASSERT( l.unlink( v1 ));
370 CPPUNIT_ASSERT( !l.unlink( v1 ));
371 CPPUNIT_ASSERT( l.unlink( v3 ));
372 CPPUNIT_ASSERT( !l.unlink( v3 ));
373 CPPUNIT_ASSERT( l.empty() );
375 // Apply retired pointer
376 OrdList::gc::force_dispose();
377 CPPUNIT_ASSERT( v1.s.nDisposeCount == 3 );
378 CPPUNIT_ASSERT( v2.s.nDisposeCount == 2 );
379 CPPUNIT_ASSERT( v3.s.nDisposeCount == 3 );
381 // Destructor test (call disposer)
382 CPPUNIT_ASSERT( l.insert( v1 ));
383 CPPUNIT_ASSERT( l.insert( v3 ));
384 CPPUNIT_ASSERT( l.insert( v2 ));
388 typename OrdList::iterator it = l.begin();
389 typename OrdList::const_iterator cit = l.cbegin();
390 CPPUNIT_ASSERT( it != l.end() );
391 CPPUNIT_ASSERT( it != l.cend() );
392 CPPUNIT_ASSERT( cit != l.end() );
393 CPPUNIT_ASSERT( cit != l.cend() );
394 CPPUNIT_ASSERT( cit == it );
396 CPPUNIT_ASSERT( it->nKey == v2.nKey );
397 CPPUNIT_ASSERT( it->nVal == v2.nVal );
398 CPPUNIT_ASSERT( ++it != l.end() );
399 CPPUNIT_ASSERT( it->nKey == v1.nKey );
400 CPPUNIT_ASSERT( it->nVal == v1.nVal );
401 CPPUNIT_ASSERT( ++it != l.end() );
402 CPPUNIT_ASSERT( it->nKey == v3.nKey );
403 CPPUNIT_ASSERT( it->nVal == v3.nVal );
404 CPPUNIT_ASSERT( ++it == l.end() );
408 OrdList const & lref = l;
409 typename OrdList::const_iterator it = lref.begin();
410 CPPUNIT_ASSERT( it != l.end() );
411 CPPUNIT_ASSERT( it->nKey == v2.nKey );
412 CPPUNIT_ASSERT( it->nVal == v2.nVal );
413 CPPUNIT_ASSERT( ++it != lref.end() );
414 CPPUNIT_ASSERT( it->nKey == v1.nKey );
415 CPPUNIT_ASSERT( it->nVal == v1.nVal );
416 CPPUNIT_ASSERT( ++it != l.end() );
417 CPPUNIT_ASSERT( it->nKey == v3.nKey );
418 CPPUNIT_ASSERT( it->nVal == v3.nVal );
419 CPPUNIT_ASSERT( ++it == l.end() );
423 // Apply retired pointer
424 OrdList::gc::force_dispose();
426 CPPUNIT_ASSERT( v1.s.nDisposeCount == 4 );
427 CPPUNIT_ASSERT( v2.s.nDisposeCount == 3 );
428 CPPUNIT_ASSERT( v3.s.nDisposeCount == 4 );
431 template <class OrdList>
434 test_int_common<OrdList>();
437 typename OrdList::guarded_ptr gp;
439 static int const nLimit = 20;
440 typename OrdList::value_type arrItem[nLimit];
445 for (int i = 0; i < nLimit; ++i)
447 std::random_shuffle( a, a + nLimit );
449 for (int i = 0; i < nLimit; ++i) {
450 arrItem[i].nKey = a[i];
451 arrItem[i].nVal = a[i] * 2;
455 for ( int i = 0; i < nLimit; ++i )
456 CPPUNIT_ASSERT( l.insert( arrItem[i] ) );
458 for ( int i=0; i < nLimit; ++i ) {
459 CPPUNIT_ASSERT( l.get( gp, arrItem[i].nKey ));
460 CPPUNIT_ASSERT( !gp.empty());
461 CPPUNIT_ASSERT( gp->nKey == arrItem[i].nKey );
462 CPPUNIT_ASSERT( gp->nVal == arrItem[i].nVal );
465 CPPUNIT_ASSERT( l.extract( gp, arrItem[i].nKey ));
466 CPPUNIT_ASSERT( !gp.empty());
467 CPPUNIT_ASSERT( gp->nKey == arrItem[i].nKey );
468 CPPUNIT_ASSERT( gp->nVal == arrItem[i].nVal );
471 CPPUNIT_ASSERT( !l.get( gp, arrItem[i].nKey ));
472 CPPUNIT_ASSERT( gp.empty());
473 CPPUNIT_ASSERT( !l.extract( gp, arrItem[i].nKey ));
474 CPPUNIT_ASSERT( gp.empty());
476 CPPUNIT_ASSERT( l.empty() );
477 CPPUNIT_ASSERT( !l.get( gp, nLimit/2 ));
478 CPPUNIT_ASSERT( gp.empty());
479 CPPUNIT_ASSERT( !l.extract( gp, nLimit/2 ));
480 CPPUNIT_ASSERT( gp.empty());
482 // Apply retired pointer
483 OrdList::gc::force_dispose();
485 // extract_with/get_with
486 for ( int i = 0; i < nLimit; ++i )
487 CPPUNIT_ASSERT( l.insert( arrItem[i] ) );
489 for ( int i=0; i < nLimit; ++i ) {
490 other_item itm( arrItem[i].nKey );
491 CPPUNIT_ASSERT( l.get_with( gp, itm, other_less() ));
492 CPPUNIT_ASSERT( !gp.empty());
493 CPPUNIT_ASSERT( gp->nKey == arrItem[i].nKey );
494 CPPUNIT_ASSERT( gp->nVal == arrItem[i].nVal );
497 CPPUNIT_ASSERT( l.extract_with( gp, itm, other_less() ));
498 CPPUNIT_ASSERT( !gp.empty());
499 CPPUNIT_ASSERT( gp->nKey == arrItem[i].nKey );
500 CPPUNIT_ASSERT( gp->nVal == arrItem[i].nVal );
503 CPPUNIT_ASSERT( !l.get_with( gp, itm, other_less() ));
504 CPPUNIT_ASSERT( gp.empty());
505 CPPUNIT_ASSERT( !l.extract_with( gp, itm, other_less() ));
506 CPPUNIT_ASSERT( gp.empty());
508 CPPUNIT_ASSERT( l.empty() );
509 CPPUNIT_ASSERT( !l.get_with( gp, other_item(nLimit/2), other_less() ));
510 CPPUNIT_ASSERT( gp.empty());
511 CPPUNIT_ASSERT( !l.extract_with( gp, other_item(nLimit/2), other_less() ));
512 CPPUNIT_ASSERT( gp.empty());
514 // Apply retired pointer
515 OrdList::gc::force_dispose();
517 for ( int i=0; i < nLimit; i++ ) {
518 CPPUNIT_ASSERT( arrItem[i].s.nDisposeCount == 2 );
523 template <class OrdList>
526 test_int_common<OrdList>();
529 static int const nLimit = 20;
530 typename OrdList::value_type arrItem[nLimit];
532 typedef typename OrdList::rcu_lock rcu_lock;
533 typedef typename OrdList::value_type value_type;
534 typedef typename OrdList::gc rcu_type;
538 for (int i = 0; i < nLimit; ++i)
540 std::random_shuffle( a, a + nLimit );
542 for (int i = 0; i < nLimit; ++i) {
543 arrItem[i].nKey = a[i];
544 arrItem[i].nVal = a[i] * 2;
547 typename OrdList::exempt_ptr ep;
550 for ( int i = 0; i < nLimit; ++i )
551 CPPUNIT_ASSERT( l.insert( arrItem[i] ) );
553 for ( int i = 0; i < nLimit; ++i ) {
556 value_type * pGet = l.get( a[i] );
557 CPPUNIT_ASSERT( pGet != nullptr );
558 CPPUNIT_CHECK( pGet->nKey == a[i] );
559 CPPUNIT_CHECK( pGet->nVal == a[i] * 2 );
561 ep = l.extract( a[i] );
562 CPPUNIT_ASSERT( ep );
563 CPPUNIT_ASSERT( !ep.empty() );
564 CPPUNIT_CHECK( ep->nKey == a[i] );
565 CPPUNIT_CHECK( (*ep).nVal == a[i] * 2 );
570 CPPUNIT_CHECK( l.get( a[i] ) == nullptr );
571 CPPUNIT_CHECK( !l.extract( a[i] ) );
572 CPPUNIT_CHECK( ep.empty() );
575 CPPUNIT_ASSERT( l.empty() );
579 CPPUNIT_CHECK( l.get( a[0] ) == nullptr );
580 ep = l.extract( a[0] );
581 CPPUNIT_CHECK( !ep );
582 CPPUNIT_CHECK( ep.empty() );
584 // Apply retired pointer
585 OrdList::gc::force_dispose();
587 // extract_with/get_with
588 for ( int i = 0; i < nLimit; ++i ) {
589 CPPUNIT_ASSERT( l.insert( arrItem[i] ) );
592 for ( int i = 0; i < nLimit; ++i ) {
593 other_item itm( a[i] );
596 value_type * pGet = l.get_with( itm, other_less() );
597 CPPUNIT_ASSERT( pGet != nullptr );
598 CPPUNIT_CHECK( pGet->nKey == a[i] );
599 CPPUNIT_CHECK( pGet->nVal == a[i] * 2 );
601 ep = l.extract_with( itm, other_less() );
602 CPPUNIT_ASSERT( ep );
603 CPPUNIT_ASSERT( !ep.empty() );
604 CPPUNIT_CHECK( ep->nKey == a[i] );
605 CPPUNIT_CHECK( ep->nVal == a[i] * 2 );
610 CPPUNIT_CHECK( l.get_with( itm, other_less() ) == nullptr );
611 ep = l.extract_with( itm, other_less() );
612 CPPUNIT_CHECK( !ep );
613 CPPUNIT_CHECK( ep.empty() );
616 CPPUNIT_ASSERT( l.empty() );
620 CPPUNIT_CHECK( l.get_with( other_item( 0 ), other_less() ) == nullptr );
621 CPPUNIT_CHECK( !l.extract_with( other_item(0), other_less() ));
622 CPPUNIT_CHECK( ep.empty() );
624 // Apply retired pointer
625 OrdList::gc::force_dispose();
629 template <class OrdList>
632 typedef typename OrdList::value_type value_type;
634 value_type v1( 10, 50 );
635 value_type v2( 5, 25 );
636 value_type v3( 20, 100 );
639 CPPUNIT_ASSERT( l.empty() );
641 CPPUNIT_ASSERT( l.insert( v1 )) ; // true
642 CPPUNIT_ASSERT( l.find( v1.key() ) == &v1 );
644 CPPUNIT_ASSERT( v1.s.nFindCall == 0 );
645 CPPUNIT_ASSERT( l.find( v1.key(), find_functor() ));
646 CPPUNIT_ASSERT( v1.s.nFindCall == 1 );
648 CPPUNIT_ASSERT( l.find_with( v2.key(), less<value_type>() ) == nullptr );
649 CPPUNIT_ASSERT( l.find( v3.key() ) == nullptr );
650 CPPUNIT_ASSERT( !l.empty() );
652 //CPPUNIT_ASSERT( !l.insert( v1 )) ; // assertion "is_empty" is raised
656 CPPUNIT_ASSERT( !l.insert( v )) ; // false
659 std::pair<bool, bool> ret = l.ensure( v2, ensure_functor() );
660 CPPUNIT_ASSERT( ret.first );
661 CPPUNIT_ASSERT( ret.second );
662 CPPUNIT_ASSERT( v2.s.nEnsureNewCall == 1 );
663 CPPUNIT_ASSERT( v2.s.nEnsureExistsCall == 0 );
665 //CPPUNIT_ASSERT( !l.insert( v2 )) ; // assertion "is_empty"
667 CPPUNIT_ASSERT( l.find( v1.key() ) == &v1 ) ; // true
669 CPPUNIT_ASSERT( v1.s.nFindCall == 1 );
670 CPPUNIT_ASSERT( l.find( v1.key(), find_functor() ));
671 CPPUNIT_ASSERT( v1.s.nFindCall == 2 );
673 CPPUNIT_ASSERT( l.find_with( v2.key(), less<value_type>() ) == &v2 );
675 CPPUNIT_ASSERT( v2.s.nFindCall == 0 );
676 CPPUNIT_ASSERT( l.find_with( v2.key(), less<value_type>(), find_functor() ));
677 CPPUNIT_ASSERT( v2.s.nFindCall == 1 );
679 CPPUNIT_ASSERT( !l.find( v3.key() ));
683 ret = l.ensure( v, ensure_functor() );
685 CPPUNIT_ASSERT( ret.first );
686 CPPUNIT_ASSERT( !ret.second );
687 CPPUNIT_ASSERT( v2.s.nEnsureExistsCall == 1 );
688 CPPUNIT_ASSERT( v.s.nEnsureExistsCall == 0 && v.s.nEnsureNewCall == 0 );
691 CPPUNIT_ASSERT( !l.empty() );
693 CPPUNIT_ASSERT( l.insert( v3 )) ; // true
694 CPPUNIT_ASSERT( l.find( v3.key() ) == &v3 );
696 CPPUNIT_ASSERT( v3.s.nFindCall == 0 );
697 CPPUNIT_ASSERT( l.find( v3.key(), find_functor() ));
698 CPPUNIT_ASSERT( v3.s.nFindCall == 1 );
701 typename OrdList::iterator it = l.begin();
702 typename OrdList::const_iterator cit = l.cbegin();
703 CPPUNIT_ASSERT( it != l.end() );
704 CPPUNIT_ASSERT( it != l.cend() );
705 CPPUNIT_ASSERT( cit != l.end() );
706 CPPUNIT_ASSERT( cit != l.cend() );
707 CPPUNIT_ASSERT( cit == it );
709 CPPUNIT_ASSERT( it->nKey == v2.nKey );
710 CPPUNIT_ASSERT( it->nVal == v2.nVal );
711 CPPUNIT_ASSERT( ++it != l.end() );
712 CPPUNIT_ASSERT( it->nKey == v1.nKey );
713 CPPUNIT_ASSERT( it->nVal == v1.nVal );
714 CPPUNIT_ASSERT( it++ != l.end() );
715 CPPUNIT_ASSERT( it->nKey == v3.nKey );
716 CPPUNIT_ASSERT( it->nVal == v3.nVal );
717 CPPUNIT_ASSERT( it++ != l.end() );
718 CPPUNIT_ASSERT( it == l.end() );
722 OrdList const & lref = l;
723 typename OrdList::const_iterator it = lref.begin();
724 CPPUNIT_ASSERT( it != l.end() );
725 CPPUNIT_ASSERT( it->nKey == v2.nKey );
726 CPPUNIT_ASSERT( it->nVal == v2.nVal );
727 CPPUNIT_ASSERT( ++it != lref.end() );
728 CPPUNIT_ASSERT( it->nKey == v1.nKey );
729 CPPUNIT_ASSERT( it->nVal == v1.nVal );
730 CPPUNIT_ASSERT( it++ != l.end() );
731 CPPUNIT_ASSERT( it->nKey == v3.nKey );
732 CPPUNIT_ASSERT( it->nVal == v3.nVal );
733 CPPUNIT_ASSERT( it++ != lref.end() );
734 CPPUNIT_ASSERT( it == l.end() );
738 // Disposer called on list destruction
739 CPPUNIT_ASSERT( v1.s.nDisposeCount == 1 );
740 CPPUNIT_ASSERT( v2.s.nDisposeCount == 1 );
741 CPPUNIT_ASSERT( v3.s.nDisposeCount == 1 );
747 void HP_base_cmpmix();
749 void HP_member_cmp();
750 void HP_member_less();
751 void HP_member_cmpmix();
755 void DHP_base_less();
756 void DHP_base_cmpmix();
758 void DHP_member_cmp();
759 void DHP_member_less();
760 void DHP_member_cmpmix();
761 void DHP_member_ic();
763 void RCU_GPI_base_cmp();
764 void RCU_GPI_base_less();
765 void RCU_GPI_base_cmpmix();
766 void RCU_GPI_base_ic();
767 void RCU_GPI_member_cmp();
768 void RCU_GPI_member_less();
769 void RCU_GPI_member_cmpmix();
770 void RCU_GPI_member_ic();
772 void RCU_GPB_base_cmp();
773 void RCU_GPB_base_less();
774 void RCU_GPB_base_cmpmix();
775 void RCU_GPB_base_ic();
776 void RCU_GPB_member_cmp();
777 void RCU_GPB_member_less();
778 void RCU_GPB_member_cmpmix();
779 void RCU_GPB_member_ic();
781 void RCU_GPT_base_cmp();
782 void RCU_GPT_base_less();
783 void RCU_GPT_base_cmpmix();
784 void RCU_GPT_base_ic();
785 void RCU_GPT_member_cmp();
786 void RCU_GPT_member_less();
787 void RCU_GPT_member_cmpmix();
788 void RCU_GPT_member_ic();
790 void RCU_SHB_base_cmp();
791 void RCU_SHB_base_less();
792 void RCU_SHB_base_cmpmix();
793 void RCU_SHB_base_ic();
794 void RCU_SHB_member_cmp();
795 void RCU_SHB_member_less();
796 void RCU_SHB_member_cmpmix();
797 void RCU_SHB_member_ic();
799 void RCU_SHT_base_cmp();
800 void RCU_SHT_base_less();
801 void RCU_SHT_base_cmpmix();
802 void RCU_SHT_base_ic();
803 void RCU_SHT_member_cmp();
804 void RCU_SHT_member_less();
805 void RCU_SHT_member_cmpmix();
806 void RCU_SHT_member_ic();
808 void nogc_base_cmp();
809 void nogc_base_less();
810 void nogc_base_cmpmix();
812 void nogc_member_cmp();
813 void nogc_member_less();
814 void nogc_member_cmpmix();
815 void nogc_member_ic();
818 CPPUNIT_TEST_SUITE(IntrusiveLazyListHeaderTest)
819 CPPUNIT_TEST(HP_base_cmp)
820 CPPUNIT_TEST(HP_base_less)
821 CPPUNIT_TEST(HP_base_cmpmix)
822 CPPUNIT_TEST(HP_base_ic)
823 CPPUNIT_TEST(HP_member_cmp)
824 CPPUNIT_TEST(HP_member_less)
825 CPPUNIT_TEST(HP_member_cmpmix)
826 CPPUNIT_TEST(HP_member_ic)
828 CPPUNIT_TEST(DHP_base_cmp)
829 CPPUNIT_TEST(DHP_base_less)
830 CPPUNIT_TEST(DHP_base_cmpmix)
831 CPPUNIT_TEST(DHP_base_ic)
832 CPPUNIT_TEST(DHP_member_cmp)
833 CPPUNIT_TEST(DHP_member_less)
834 CPPUNIT_TEST(DHP_member_cmpmix)
835 CPPUNIT_TEST(DHP_member_ic)
837 CPPUNIT_TEST(RCU_GPI_base_cmp)
838 CPPUNIT_TEST(RCU_GPI_base_less)
839 CPPUNIT_TEST(RCU_GPI_base_cmpmix)
840 CPPUNIT_TEST(RCU_GPI_base_ic)
841 CPPUNIT_TEST(RCU_GPI_member_cmp)
842 CPPUNIT_TEST(RCU_GPI_member_less)
843 CPPUNIT_TEST(RCU_GPI_member_cmpmix)
844 CPPUNIT_TEST(RCU_GPI_member_ic)
846 CPPUNIT_TEST(RCU_GPB_base_cmp)
847 CPPUNIT_TEST(RCU_GPB_base_less)
848 CPPUNIT_TEST(RCU_GPB_base_cmpmix)
849 CPPUNIT_TEST(RCU_GPB_base_ic)
850 CPPUNIT_TEST(RCU_GPB_member_cmp)
851 CPPUNIT_TEST(RCU_GPB_member_less)
852 CPPUNIT_TEST(RCU_GPB_member_cmpmix)
853 CPPUNIT_TEST(RCU_GPB_member_ic)
855 CPPUNIT_TEST(RCU_GPT_base_cmp)
856 CPPUNIT_TEST(RCU_GPT_base_less)
857 CPPUNIT_TEST(RCU_GPT_base_cmpmix)
858 CPPUNIT_TEST(RCU_GPT_base_ic)
859 CPPUNIT_TEST(RCU_GPT_member_cmp)
860 CPPUNIT_TEST(RCU_GPT_member_less)
861 CPPUNIT_TEST(RCU_GPT_member_cmpmix)
862 CPPUNIT_TEST(RCU_GPT_member_ic)
864 CPPUNIT_TEST(RCU_SHB_base_cmp)
865 CPPUNIT_TEST(RCU_SHB_base_less)
866 CPPUNIT_TEST(RCU_SHB_base_cmpmix)
867 CPPUNIT_TEST(RCU_SHB_base_ic)
868 CPPUNIT_TEST(RCU_SHB_member_cmp)
869 CPPUNIT_TEST(RCU_SHB_member_less)
870 CPPUNIT_TEST(RCU_SHB_member_cmpmix)
871 CPPUNIT_TEST(RCU_SHB_member_ic)
873 CPPUNIT_TEST(RCU_SHT_base_cmp)
874 CPPUNIT_TEST(RCU_SHT_base_less)
875 CPPUNIT_TEST(RCU_SHT_base_cmpmix)
876 CPPUNIT_TEST(RCU_SHT_base_ic)
877 CPPUNIT_TEST(RCU_SHT_member_cmp)
878 CPPUNIT_TEST(RCU_SHT_member_less)
879 CPPUNIT_TEST(RCU_SHT_member_cmpmix)
880 CPPUNIT_TEST(RCU_SHT_member_ic)
882 CPPUNIT_TEST(nogc_base_cmp)
883 CPPUNIT_TEST(nogc_base_less)
884 CPPUNIT_TEST(nogc_base_cmpmix)
885 CPPUNIT_TEST(nogc_base_ic)
886 CPPUNIT_TEST(nogc_member_cmp)
887 CPPUNIT_TEST(nogc_member_less)
888 CPPUNIT_TEST(nogc_member_cmpmix)
889 CPPUNIT_TEST(nogc_member_ic)
891 CPPUNIT_TEST_SUITE_END()
893 } // namespace ordlist