tests/test-hdr/ordered_list/hdr_lazy_kv.h

   1 //$$CDS-header$$
   2
   3 #ifndef CDSTEST_HDR_LAZY_KV_H
   4 #define CDSTEST_HDR_LAZY_KV_H
   5
   6 #include "cppunit/cppunit_proxy.h"
   7 #include <cds/container/details/lazy_list_base.h>
   8
   9 namespace ordlist {
  10     namespace cc = cds::container;
  11     namespace co = cds::container::opt;
  12
  13     class LazyKVListTestHeader: public CppUnitMini::TestCase
  14     {
  15     public:
  16         typedef int key_type;
  17         struct value_type {
  18             int m_val;
  19
  20             value_type()
  21                 : m_val(0)
  22             {}
  23
  24             value_type( int n )
  25                 : m_val( n )
  26             {}
  27         };
  28
  29         template <typename T>
  30         struct lt
  31         {
  32             bool operator ()(const T& v1, const T& v2 ) const
  33             {
  34                 return v1 < v2;
  35             }
  36         };
  37
  38         template <typename T>
  39         struct cmp {
  40             int operator ()(const T& v1, const T& v2 ) const
  41             {
  42                 if ( v1 < v2 )
  43                     return -1;
  44                 return v1 > v2 ? 1 : 0;
  45             }
  46         };
  47
  48         struct check_value {
  49             int     m_nExpected;
  50
  51             check_value( int nExpected )
  52                 : m_nExpected( nExpected )
  53             {}
  54
  55             template <typename T>
  56             void operator ()( T& pair )
  57             {
  58                 CPPUNIT_ASSERT_CURRENT( pair.second.m_val == m_nExpected );
  59             }
  60         };
  61
  62         struct insert_functor {
  63             template <typename T>
  64             void operator()( T& pair )
  65             {
  66                 pair.second.m_val = pair.first * 10;
  67             }
  68         };
  69
  70         struct ensure_functor {
  71             template <typename T>
  72             void operator()( bool /*bNew*/, T& pair )
  73             {
  74                 pair.second.m_val = pair.first * 50;
  75             }
  76         };
  77
  78         struct erase_functor {
  79             int     nKey;
  80             int     nVal;
  81
  82             erase_functor()
  83                 : nKey(0)
  84                 , nVal(0)
  85             {}
  86
  87             template <typename T>
  88             void operator()( T& i )
  89             {
  90                 nKey = i.first;
  91                 nVal = i.second.m_val;
  92             }
  93         };
  94
  95         typedef float other_key;
  96         struct other_less {
  97             bool operator()( float f, int i ) const
  98             {
  99                 return int(f) < i;
 100             }
 101             bool operator()( int i, float f ) const
 102             {
 103                 return i < int(f);
 104             }
 105         };
 106
 107     protected:
 108         template <class OrdList>
 109         void test_with( OrdList& l)
 110         {
 111             typedef typename OrdList::value_type    value_type;
 112
 113             typename OrdList::iterator itTest;
 114             typename OrdList::const_iterator citTest;
 115
 116             CPPUNIT_ASSERT( l.empty() );
 117
 118             // insert / find test
 119             CPPUNIT_ASSERT( !l.find( 100 ));
 120             CPPUNIT_ASSERT( l.insert( 100 ));
 121             CPPUNIT_ASSERT( !l.empty() );
 122             CPPUNIT_ASSERT( l.find( 100 ));
 123
 124             check_value chk(0);
 125             CPPUNIT_ASSERT( l.find( 100, std::ref( chk ) ) );
 126
 127             CPPUNIT_ASSERT( !l.find_with( 50, lt<key_type>() ));
 128             CPPUNIT_ASSERT( l.insert( 50, 500 ));
 129             CPPUNIT_ASSERT( l.find_with( 50, lt<key_type>() ));
 130             CPPUNIT_ASSERT( !l.insert( 50, 5 ));
 131             chk.m_nExpected = 500;
 132             CPPUNIT_ASSERT( l.find( 50, std::ref( chk ) ) );
 133             chk.m_nExpected = 0;
 134             CPPUNIT_ASSERT( l.find( 100, std::ref( chk ) ) );
 135             CPPUNIT_ASSERT( !l.empty() );
 136
 137             CPPUNIT_ASSERT( !l.find( 150 ));
 138             CPPUNIT_ASSERT( l.insert_with( 150, insert_functor() ));
 139             CPPUNIT_ASSERT( l.find( 150 ));
 140             chk.m_nExpected = 1500;
 141             CPPUNIT_ASSERT( l.find_with( 150, lt<key_type>(), std::ref( chk ) ) );
 142             chk.m_nExpected = 0;
 143             CPPUNIT_ASSERT( l.find( 100, std::ref( chk ) ) );
 144             chk.m_nExpected = 500;
 145             CPPUNIT_ASSERT( l.find( 50, std::ref( chk ) ) );
 146             CPPUNIT_ASSERT( !l.empty() );
 147
 148             // erase test
 149
 150             CPPUNIT_ASSERT( !l.erase( 500 ));
 151             CPPUNIT_ASSERT( !l.empty() );
 152
 153             CPPUNIT_ASSERT( l.find( 50 ));
 154             {
 155                 erase_functor ef;
 156                 l.erase( 50, std::ref( ef ) );
 157                 CPPUNIT_ASSERT( ef.nKey == 50 );
 158                 CPPUNIT_ASSERT( ef.nVal == 500 );
 159             }
 160             CPPUNIT_ASSERT( !l.find( 50 ));
 161
 162             // ensure test
 163             std::pair<bool, bool> bEnsureResult;
 164             bEnsureResult = l.ensure( 100, ensure_functor() );
 165             CPPUNIT_ASSERT( bEnsureResult.first );
 166             CPPUNIT_ASSERT( !bEnsureResult.second );
 167             chk.m_nExpected = 5000;
 168             CPPUNIT_ASSERT( l.find( 100, std::ref( chk ) ) );
 169
 170             {
 171                 ensure_functor ef;
 172                 bEnsureResult = l.ensure( 50, std::ref( ef ) );
 173             }
 174             CPPUNIT_ASSERT( bEnsureResult.first );
 175             CPPUNIT_ASSERT( bEnsureResult.second );
 176             chk.m_nExpected = 2500;
 177             CPPUNIT_ASSERT( l.find( 50, std::ref( chk ) ) );
 178
 179             // erase test
 180             CPPUNIT_ASSERT( !l.empty() );
 181             CPPUNIT_ASSERT( l.insert_with( 200, insert_functor() ));
 182             CPPUNIT_ASSERT( l.insert( 25 ));
 183             CPPUNIT_ASSERT( l.erase( 100 ));
 184             CPPUNIT_ASSERT( l.erase( 150 ));
 185             {
 186                 erase_functor ef;
 187                 CPPUNIT_ASSERT( l.erase_with( 200, lt<key_type>(), std::ref(ef)) );
 188                 CPPUNIT_ASSERT( ef.nKey == 200 );
 189                 CPPUNIT_ASSERT( ef.nVal == 2000 );
 190             }
 191             CPPUNIT_ASSERT( l.erase_with( 25, lt<key_type>()))
 192             CPPUNIT_ASSERT( l.erase( 50 ));
 193             CPPUNIT_ASSERT( l.empty() );
 194
 195             // clear empty list
 196             l.clear();
 197             CPPUNIT_ASSERT( l.empty() );
 198
 199             // insert test
 200             CPPUNIT_ASSERT( l.emplace( 501 ) );
 201             CPPUNIT_ASSERT( l.emplace( 251, 152 ));
 202
 203             // insert failed - such key exists
 204             CPPUNIT_ASSERT( !l.emplace( 501, 2 ) );
 205             CPPUNIT_ASSERT( !l.emplace( 251, 10) );
 206
 207             check_value cv(0);
 208             CPPUNIT_ASSERT( l.find( 501, std::ref(cv) ));
 209             cv.m_nExpected = 152;
 210             CPPUNIT_ASSERT( l.find( 251, std::ref(cv) ));
 211
 212             l.clear();
 213             CPPUNIT_ASSERT( l.empty() );
 214
 215             // Iterator test
 216             {
 217                 int nCount = 100;
 218                 for ( int i = 0; i < nCount; ++i )
 219                     CPPUNIT_ASSERT( l.insert(i, i * 2 ) );
 220
 221                 {
 222                     typename OrdList::iterator it( l.begin() );
 223                     typename OrdList::const_iterator cit( l.cbegin() );
 224                     CPPUNIT_CHECK( it == cit );
 225                     CPPUNIT_CHECK( it != l.end() );
 226                     CPPUNIT_CHECK( it != l.cend() );
 227                     CPPUNIT_CHECK( cit != l.end() );
 228                     CPPUNIT_CHECK( cit != l.cend() );
 229                     ++it;
 230                     CPPUNIT_CHECK( it != cit );
 231                     CPPUNIT_CHECK( it != l.end() );
 232                     CPPUNIT_CHECK( it != l.cend() );
 233                     CPPUNIT_CHECK( cit != l.end() );
 234                     CPPUNIT_CHECK( cit != l.cend() );
 235                     ++cit;
 236                     CPPUNIT_CHECK( it == cit );
 237                     CPPUNIT_CHECK( it != l.end() );
 238                     CPPUNIT_CHECK( it != l.cend() );
 239                     CPPUNIT_CHECK( cit != l.end() );
 240                     CPPUNIT_CHECK( cit != l.cend() );
 241                 }
 242
 243                 int i = 0;
 244                 for ( typename OrdList::iterator it = l.begin(), itEnd = l.end(); it != itEnd; ++it, ++i ) {
 245                     CPPUNIT_ASSERT( it.key() == i );
 246                     CPPUNIT_ASSERT( it.val().m_val == i * 2 );
 247                     it.val().m_val = i * 3;
 248                 }
 249
 250                 // Check that we have visited all items
 251                 for ( int i = 0; i < nCount; ++i ) {
 252                     chk.m_nExpected = i * 3;
 253                     CPPUNIT_ASSERT( l.find( i, std::ref( chk ) ) );
 254                 }
 255
 256                 l.clear();
 257                 CPPUNIT_ASSERT( l.empty() );
 258
 259                 // Const iterator
 260                 for ( int i = 0; i < nCount; ++i )
 261                     CPPUNIT_ASSERT( l.insert(i, i * 7) );
 262
 263                 i = 0;
 264                 const OrdList& rl = l;
 265                 for ( typename OrdList::const_iterator it = rl.begin(), itEnd = rl.end(); it != itEnd; ++it, ++i ) {
 266                     CPPUNIT_ASSERT( it.key() == i );
 267                     CPPUNIT_ASSERT( it.val().m_val == i * 7 );
 268                 }
 269
 270                 // Check that we have visited all items
 271                 for ( int i = nCount; i > 0; --i ) {
 272                     chk.m_nExpected = (i - 1) * 7;
 273                     CPPUNIT_ASSERT( l.find_with( i - 1, lt<key_type>(), std::ref( chk ) ) );
 274                 }
 275
 276                 l.clear();
 277                 CPPUNIT_ASSERT( l.empty() );
 278             }
 279         }
 280
 281         template <class OrdList>
 282         void test()
 283         {
 284             OrdList l;
 285             test_with(l);
 286
 287             typedef typename OrdList::guarded_ptr guarded_ptr;
 288
 289             static int const nLimit = 20;
 290             int arr[nLimit];
 291             for ( int i = 0; i < nLimit; i++ )
 292                 arr[i] = i;
 293             std::random_shuffle( arr, arr + nLimit );
 294
 295             // extract/get
 296             for ( int i = 0; i < nLimit; ++i )
 297                 l.insert( arr[i], arr[i] * 2 );
 298             {
 299                 guarded_ptr gp;
 300                 for ( int i = 0; i < nLimit; ++i ) {
 301                     int nKey = arr[i];
 302
 303                     gp = l.get( nKey );
 304                     CPPUNIT_ASSERT( gp );
 305                     CPPUNIT_ASSERT( !gp.empty());
 306                     CPPUNIT_CHECK( gp->first == nKey );
 307                     CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
 308                     gp.release();
 309
 310                     gp = l.extract( nKey );
 311                     CPPUNIT_ASSERT( gp );
 312                     CPPUNIT_ASSERT( !gp.empty());
 313                     CPPUNIT_CHECK( gp->first == nKey );
 314                     CPPUNIT_CHECK( gp->second.m_val == nKey*2 );
 315                     gp.release();
 316
 317                     gp = l.get( nKey );
 318                     CPPUNIT_CHECK( !gp );
 319                     CPPUNIT_CHECK( gp.empty());
 320                     CPPUNIT_CHECK( !l.extract( nKey));
 321                     CPPUNIT_CHECK( gp.empty());
 322                 }
 323                 CPPUNIT_ASSERT( l.empty());
 324                 CPPUNIT_CHECK( !l.get(arr[0]));
 325                 CPPUNIT_CHECK( gp.empty());
 326                 CPPUNIT_CHECK( !l.extract( arr[0]));
 327                 CPPUNIT_CHECK( gp.empty());
 328             }
 329
 330             // extract_with/get_with
 331             for ( int i = 0; i < nLimit; ++i )
 332                 l.insert( arr[i], arr[i] * 2 );
 333             {
 334                 guarded_ptr gp;
 335                 for ( int i = 0; i < nLimit; ++i ) {
 336                     int nKey = arr[i];
 337                     other_key key = float(nKey + 0.3);
 338
 339                     gp = l.get_with( key, other_less() );
 340                     CPPUNIT_ASSERT( gp );
 341                     CPPUNIT_ASSERT( !gp.empty());
 342                     CPPUNIT_CHECK( gp->first == nKey );
 343                     CPPUNIT_CHECK( gp->second.m_val == nKey * 2 );
 344                     gp.release();
 345
 346                     gp = l.extract_with( key, other_less() );
 347                     CPPUNIT_ASSERT( gp );
 348                     CPPUNIT_ASSERT( !gp.empty());
 349                     CPPUNIT_CHECK( gp->first == nKey );
 350                     CPPUNIT_CHECK( gp->second.m_val == nKey*2 );
 351                     gp.release();
 352
 353                     gp = l.get_with( key, other_less() );
 354                     CPPUNIT_CHECK( !gp );
 355                     CPPUNIT_CHECK( gp.empty());
 356                     CPPUNIT_CHECK( !l.extract_with( key, other_less()));
 357                     CPPUNIT_CHECK( gp.empty());
 358                 }
 359                 CPPUNIT_ASSERT( l.empty());
 360                 CPPUNIT_CHECK( !l.get_with(3.4f, other_less()));
 361                 CPPUNIT_CHECK( gp.empty());
 362                 CPPUNIT_CHECK( !l.extract_with( 3.4f, other_less()));
 363                 CPPUNIT_CHECK( gp.empty());
 364             }
 365         }
 366
 367         template <class OrdList>
 368         void test_rcu()
 369         {
 370             OrdList l;
 371             test_with(l);
 372
 373             static int const nLimit = 20;
 374
 375             typedef typename OrdList::rcu_lock rcu_lock;
 376             typedef typename OrdList::value_type value_type;
 377             typedef typename OrdList::gc rcu_type;
 378
 379             {
 380                 int a[nLimit];
 381                 for (int i = 0; i < nLimit; ++i)
 382                     a[i]=i;
 383                 std::random_shuffle( a, a + nLimit );
 384
 385                 // extract/get
 386                 for ( int i = 0; i < nLimit; ++i )
 387                     CPPUNIT_ASSERT( l.insert( a[i], a[i]*2 ) );
 388
 389                 typename OrdList::exempt_ptr ep;
 390
 391                 for ( int i = 0; i < nLimit; ++i ) {
 392                     {
 393                         rcu_lock lock;
 394                         value_type * pGet = l.get( a[i] );
 395                         CPPUNIT_ASSERT( pGet != nullptr );
 396                         CPPUNIT_CHECK( pGet->first == a[i] );
 397                         CPPUNIT_CHECK( pGet->second.m_val == a[i] * 2 );
 398
 399                         ep = l.extract( a[i] );
 400                         CPPUNIT_ASSERT( ep );
 401                         CPPUNIT_ASSERT( !ep.empty() );
 402                         CPPUNIT_CHECK( ep->first == a[i] );
 403                         CPPUNIT_CHECK( (*ep).second.m_val == a[i] * 2 );
 404                     }
 405                     ep.release();
 406                     {
 407                         rcu_lock lock;
 408                         CPPUNIT_CHECK( l.get( a[i] ) == nullptr );
 409                         ep = l.extract( a[i] );
 410                         CPPUNIT_CHECK( !ep );
 411                         CPPUNIT_CHECK( ep.empty() );
 412                     }
 413                 }
 414                 CPPUNIT_ASSERT( l.empty() );
 415
 416                 {
 417                     rcu_lock lock;
 418                     CPPUNIT_CHECK( l.get( a[0] ) == nullptr );
 419                     CPPUNIT_CHECK( !l.extract( a[0] ) );
 420                 }
 421
 422                 // extract_with/get_with
 423                 for ( int i = 0; i < nLimit; ++i ) {
 424                     CPPUNIT_ASSERT( l.insert( a[i], a[i]*2 ) );
 425                 }
 426
 427                 for ( int i = 0; i < nLimit; ++i ) {
 428                     float itm = a[i] + 0.3f;
 429                     {
 430                         rcu_lock lock;
 431                         value_type * pGet = l.get_with( itm, other_less() );
 432                         CPPUNIT_ASSERT( pGet != nullptr );
 433                         CPPUNIT_CHECK( pGet->first == a[i] );
 434                         CPPUNIT_CHECK( pGet->second.m_val == a[i] * 2 );
 435
 436                         ep = l.extract_with( itm, other_less() );
 437                         CPPUNIT_ASSERT( ep );
 438                         CPPUNIT_ASSERT( !ep.empty() );
 439                         CPPUNIT_CHECK( ep->first == a[i] );
 440                         CPPUNIT_CHECK( ep->second.m_val == a[i] * 2 );
 441                     }
 442                     ep.release();
 443                     {
 444                         rcu_lock lock;
 445                         CPPUNIT_CHECK( l.get_with( itm, other_less()) == nullptr );
 446                         ep = l.extract_with( itm, other_less() );
 447                         CPPUNIT_CHECK( !ep );
 448                         CPPUNIT_CHECK( ep.empty() );
 449                     }
 450                 }
 451                 CPPUNIT_ASSERT( l.empty() );
 452
 453                 {
 454                     rcu_lock lock;
 455                     CPPUNIT_CHECK( l.get_with( 3.14f, other_less() ) == nullptr );
 456                     CPPUNIT_CHECK( !l.extract_with( 3.14f, other_less() ));
 457                     CPPUNIT_CHECK( ep.empty() );
 458                 }
 459             }
 460         }
 461
 462         template <class OrdList>
 463         void nogc_test()
 464         {
 465             typedef typename OrdList::value_type    value_type;
 466             typedef typename OrdList::iterator      iterator;
 467
 468             {
 469                 OrdList l;
 470                 iterator it;
 471
 472                 CPPUNIT_ASSERT( l.empty() );
 473
 474                 // insert / find test
 475                 CPPUNIT_ASSERT( l.find( 100 ) == l.end() );
 476                 CPPUNIT_ASSERT( l.insert( 100 ) != l.end() );
 477                 CPPUNIT_ASSERT( !l.empty() );
 478                 it = l.find( 100 );
 479                 CPPUNIT_ASSERT( it != l.end() );
 480                 CPPUNIT_ASSERT( it.key() == 100 );
 481                 CPPUNIT_ASSERT( it.val().m_val == 0 );
 482
 483                 CPPUNIT_ASSERT( l.find_with( 50, lt<key_type>() ) == l.end() );
 484                 CPPUNIT_ASSERT( l.insert( 50, 500 ) != l.end());
 485                 it = l.find( 50 );
 486                 CPPUNIT_ASSERT( it != l.end() );
 487                 CPPUNIT_ASSERT( it.key() == 50 );
 488                 CPPUNIT_ASSERT( it.val().m_val == 500 );
 489
 490                 CPPUNIT_ASSERT( l.insert( 50, 5 ) == l.end() );
 491                 it = l.find( 50 );
 492                 CPPUNIT_ASSERT( it != l.end() );
 493                 CPPUNIT_ASSERT( it.key() == 50 );
 494                 CPPUNIT_ASSERT( it.val().m_val == 500 );
 495                 CPPUNIT_ASSERT( !l.empty() );
 496
 497                 CPPUNIT_ASSERT( l.find( 150 ) == l.end() );
 498                 CPPUNIT_ASSERT( l.insert_with( 150, insert_functor() ) != l.end() );
 499                 it = l.find( 150 );
 500                 CPPUNIT_ASSERT( it != l.end() );
 501                 CPPUNIT_ASSERT( it.key() == 150 );
 502                 CPPUNIT_ASSERT( it.val().m_val == 1500 );
 503                 it = l.find( 100 );
 504                 CPPUNIT_ASSERT( it != l.end() );
 505                 CPPUNIT_ASSERT( it.key() == 100 );
 506                 CPPUNIT_ASSERT( it.val().m_val == 0 );
 507                 it = l.find( 50 );
 508                 CPPUNIT_ASSERT( it != l.end() );
 509                 CPPUNIT_ASSERT( it.key() == 50 );
 510                 CPPUNIT_ASSERT( it.val().m_val == 500 );
 511                 it.val().m_val = 25;
 512                 it = l.find( 50 );
 513                 CPPUNIT_ASSERT( it != l.end() );
 514                 CPPUNIT_ASSERT( it.key() == 50 );
 515                 CPPUNIT_ASSERT( it.val().m_val == 25 );
 516                 CPPUNIT_ASSERT( !l.empty() );
 517
 518                 // ensure existing item
 519                 std::pair<iterator, bool> ensureResult;
 520                 ensureResult = l.ensure( 100 );
 521                 CPPUNIT_ASSERT( !ensureResult.second );
 522                 CPPUNIT_ASSERT( ensureResult.first.key() == 100 );
 523                 CPPUNIT_ASSERT( ensureResult.first.val().m_val == 0   );
 524                 ensureResult.first.val().m_val = 5;
 525                 it = l.find( 100 );
 526                 CPPUNIT_ASSERT( it != l.end() );
 527                 CPPUNIT_ASSERT( it.key() == 100 );
 528                 CPPUNIT_ASSERT( it.val().m_val == 5 );
 529
 530                 CPPUNIT_ASSERT( !l.empty() );
 531
 532                 // ensure new item
 533                 ensureResult = l.ensure( 1000 );
 534                 CPPUNIT_ASSERT( ensureResult.second );
 535                 CPPUNIT_ASSERT( ensureResult.first.key() == 1000 );
 536                 CPPUNIT_ASSERT( ensureResult.first.val().m_val == 0   );
 537                 ensureResult.first.val().m_val = 33;
 538                 ensureResult = l.ensure( 1000 );
 539                 CPPUNIT_ASSERT( !ensureResult.second );
 540                 CPPUNIT_ASSERT( ensureResult.first.key() == 1000 );
 541                 CPPUNIT_ASSERT( ensureResult.first.val().m_val == 33   );
 542
 543                 // clear test
 544                 l.clear();
 545                 CPPUNIT_ASSERT( l.empty() );
 546
 547                 // insert test
 548                 CPPUNIT_ASSERT( l.emplace( 501 ) != l.end());
 549                 CPPUNIT_ASSERT( l.emplace( 251, 152 ) != l.end());
 550
 551                 // insert failed - such key exists
 552                 CPPUNIT_ASSERT( l.emplace( 501, 2 ) == l.end());
 553                 CPPUNIT_ASSERT( l.emplace( 251, 10) == l.end());
 554
 555                 it = l.find(501);
 556                 CPPUNIT_ASSERT( it != l.end() );
 557                 CPPUNIT_ASSERT( it.key() == 501 );
 558                 CPPUNIT_ASSERT( it.val().m_val == 0 );
 559
 560                 it = l.find(251);
 561                 CPPUNIT_ASSERT( it != l.end() );
 562                 CPPUNIT_ASSERT( it.key() == 251 );
 563                 CPPUNIT_ASSERT( it.val().m_val == 152 );
 564
 565                 l.clear();
 566                 CPPUNIT_ASSERT( l.empty() );
 567
 568                 // Iterator test
 569                 {
 570                     int nCount = 100;
 571                     for ( int i = 0; i < nCount; ++i )
 572                         CPPUNIT_ASSERT( l.insert(i, i * 2 ) != l.end() );
 573
 574                     {
 575                         typename OrdList::iterator it( l.begin() );
 576                         typename OrdList::const_iterator cit( l.cbegin() );
 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() );
 582                         ++it;
 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() );
 588                         ++cit;
 589                         CPPUNIT_CHECK( it == cit );
 590                         CPPUNIT_CHECK( it != l.end() );
 591                         CPPUNIT_CHECK( it != l.cend() );
 592                         CPPUNIT_CHECK( cit != l.end() );
 593                         CPPUNIT_CHECK( cit != l.cend() );
 594                     }
 595
 596                     int i = 0;
 597                     for ( typename OrdList::iterator iter = l.begin(), itEnd = l.end(); iter != itEnd; ++iter, ++i ) {
 598                         CPPUNIT_ASSERT( iter.key() == i );
 599                         CPPUNIT_ASSERT( iter->first == i );
 600                         CPPUNIT_ASSERT( (*iter).first == i );
 601
 602                         CPPUNIT_ASSERT( iter.val().m_val == i * 2 );
 603                         CPPUNIT_ASSERT( iter->second.m_val == i * 2 );
 604                         CPPUNIT_ASSERT( (*iter).second.m_val == i * 2 );
 605
 606                         iter.val().m_val = i * 3;
 607                     }
 608
 609                     // Check that we have visited all items
 610                     for ( int i = 0; i < nCount; ++i ) {
 611                         it = l.find( i );
 612                         CPPUNIT_ASSERT( it != l.end() );
 613                         CPPUNIT_ASSERT( it.key() == i );
 614                         CPPUNIT_ASSERT( it.val().m_val == i * 3 );
 615                     }
 616
 617                     l.clear();
 618                     CPPUNIT_ASSERT( l.empty() );
 619
 620                     // Const iterator
 621                     for ( int i = 0; i < nCount; ++i )
 622                         CPPUNIT_ASSERT( l.insert(i, i * 7) != l.end() );
 623
 624                     i = 0;
 625                     const OrdList& rl = l;
 626                     for ( typename OrdList::const_iterator iter = rl.begin(), itEnd = rl.end(); iter != itEnd; ++iter, ++i ) {
 627                         CPPUNIT_ASSERT( iter.key() == i );
 628                         CPPUNIT_ASSERT( iter->first == i );
 629                         CPPUNIT_ASSERT( (*iter).first == i );
 630
 631                         CPPUNIT_ASSERT( iter.val().m_val == i * 7 );
 632                         CPPUNIT_ASSERT( iter->second.m_val == i * 7 );
 633                         CPPUNIT_ASSERT( (*iter).second.m_val == i * 7 );
 634                         // it.val().m_val = i * 3    ; // error: const-iterator
 635                     }
 636
 637                     l.clear();
 638                     CPPUNIT_ASSERT( l.empty() );
 639                 }
 640
 641             }
 642         }
 643
 644         void HP_cmp();
 645         void HP_less();
 646         void HP_cmpmix();
 647         void HP_ic();
 648
 649         void DHP_cmp();
 650         void DHP_less();
 651         void DHP_cmpmix();
 652         void DHP_ic();
 653
 654         void RCU_GPI_cmp();
 655         void RCU_GPI_less();
 656         void RCU_GPI_cmpmix();
 657         void RCU_GPI_ic();
 658
 659         void RCU_GPB_cmp();
 660         void RCU_GPB_less();
 661         void RCU_GPB_cmpmix();
 662         void RCU_GPB_ic();
 663
 664         void RCU_GPT_cmp();
 665         void RCU_GPT_less();
 666         void RCU_GPT_cmpmix();
 667         void RCU_GPT_ic();
 668
 669         void RCU_SHB_cmp();
 670         void RCU_SHB_less();
 671         void RCU_SHB_cmpmix();
 672         void RCU_SHB_ic();
 673
 674         void RCU_SHT_cmp();
 675         void RCU_SHT_less();
 676         void RCU_SHT_cmpmix();
 677         void RCU_SHT_ic();
 678
 679         void NOGC_cmp();
 680         void NOGC_less();
 681         void NOGC_cmpmix();
 682         void NOGC_ic();
 683
 684         CPPUNIT_TEST_SUITE(LazyKVListTestHeader)
 685             CPPUNIT_TEST(HP_cmp)
 686             CPPUNIT_TEST(HP_less)
 687             CPPUNIT_TEST(HP_cmpmix)
 688             CPPUNIT_TEST(HP_ic)
 689
 690             CPPUNIT_TEST(DHP_cmp)
 691             CPPUNIT_TEST(DHP_less)
 692             CPPUNIT_TEST(DHP_cmpmix)
 693             CPPUNIT_TEST(DHP_ic)
 694
 695             CPPUNIT_TEST(RCU_GPI_cmp)
 696             CPPUNIT_TEST(RCU_GPI_less)
 697             CPPUNIT_TEST(RCU_GPI_cmpmix)
 698             CPPUNIT_TEST(RCU_GPI_ic)
 699
 700             CPPUNIT_TEST(RCU_GPB_cmp)
 701             CPPUNIT_TEST(RCU_GPB_less)
 702             CPPUNIT_TEST(RCU_GPB_cmpmix)
 703             CPPUNIT_TEST(RCU_GPB_ic)
 704
 705             CPPUNIT_TEST(RCU_GPT_cmp)
 706             CPPUNIT_TEST(RCU_GPT_less)
 707             CPPUNIT_TEST(RCU_GPT_cmpmix)
 708             CPPUNIT_TEST(RCU_GPT_ic)
 709
 710             CPPUNIT_TEST(RCU_SHB_cmp)
 711             CPPUNIT_TEST(RCU_SHB_less)
 712             CPPUNIT_TEST(RCU_SHB_cmpmix)
 713             CPPUNIT_TEST(RCU_SHB_ic)
 714
 715             CPPUNIT_TEST(RCU_SHT_cmp)
 716             CPPUNIT_TEST(RCU_SHT_less)
 717             CPPUNIT_TEST(RCU_SHT_cmpmix)
 718             CPPUNIT_TEST(RCU_SHT_ic)
 719
 720             CPPUNIT_TEST(NOGC_cmp)
 721             CPPUNIT_TEST(NOGC_less)
 722             CPPUNIT_TEST(NOGC_cmpmix)
 723             CPPUNIT_TEST(NOGC_ic)
 724         CPPUNIT_TEST_SUITE_END()
 725     };
 726
 727 }   // namespace ordlist
 728
 729 #endif // #ifndef CDSTEST_HDR_LAZY_KV_H