2 This file is a part of libcds - Concurrent Data Structures library
4 (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
6 Source code repo: http://github.com/khizmax/libcds/
7 Download: http://sourceforge.net/projects/libcds/files/
9 Redistribution and use in source and binary forms, with or without
10 modification, are permitted provided that the following conditions are met:
12 * Redistributions of source code must retain the above copyright notice, this
13 list of conditions and the following disclaimer.
15 * Redistributions in binary form must reproduce the above copyright notice,
16 this list of conditions and the following disclaimer in the documentation
17 and/or other materials provided with the distribution.
19 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
20 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
23 FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
25 SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
26 CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
27 OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 #ifndef CDSUNIT_LIST_TEST_ITERABLE_LIST_HP_H
32 #define CDSUNIT_LIST_TEST_ITERABLE_LIST_HP_H
34 #include "test_iterable_list.h"
38 class iterable_list_hp : public iterable_list_test
41 template <typename List>
42 void test_hp( List& l )
44 // Precondition: list is empty
45 // Postcondition: list is empty
47 static const size_t nSize = 20;
48 typedef typename List::value_type value_type;
49 typedef typename List::guarded_ptr guarded_ptr;
50 value_type arr[nSize];
52 for ( size_t i = 0; i < nSize; ++i ) {
53 arr[i].nKey = static_cast<int>(i);
54 arr[i].nVal = arr[i].nKey * 10;
56 shuffle( arr, arr + nSize );
58 ASSERT_TRUE( l.empty() );
59 ASSERT_CONTAINER_SIZE( l, 0 );
65 for ( auto& i : arr ) {
68 gp = l.get_with( other_item( i.nKey ), other_less());
71 EXPECT_TRUE( l.insert( i ));
75 EXPECT_EQ( gp->nKey, i.nKey );
76 EXPECT_EQ( gp->nVal, gp->nKey * 10 );
77 gp->nVal = gp->nKey * 5;
79 gp = l.get_with( other_item( i.nKey ), other_less());
81 EXPECT_EQ( gp->nKey, i.nKey );
82 EXPECT_EQ( gp->nVal, gp->nKey * 5 );
83 gp->nVal = gp->nKey * 10;
86 ASSERT_FALSE( l.empty() );
87 ASSERT_CONTAINER_SIZE( l, nCount );
90 ASSERT_FALSE( l.empty() );
91 ASSERT_CONTAINER_SIZE( l, nSize );
94 for ( auto const& i : arr ) {
95 ASSERT_FALSE( l.empty() );
96 ASSERT_CONTAINER_SIZE( l, nCount );
101 EXPECT_EQ( gp->nKey, i.nKey );
103 switch ( i.nKey & 3 ) {
108 gp = l.extract_with( other_item( i.nKey ), other_less());
111 gp = l.extract( i.nKey );
115 EXPECT_EQ( gp->nKey, i.nKey );
116 EXPECT_EQ( gp->nVal, gp->nKey * 10 );
118 gp = l.get( i.nKey );
123 gp = l.extract_with( other_item( i.nKey ), other_less());
125 gp = l.extract( i.nKey );
129 ASSERT_TRUE( l.empty() );
130 ASSERT_CONTAINER_SIZE( l, 0 );
134 } // namespace cds_list
136 #endif // CDSUNIT_LIST_TEST_ITERABLE_LIST_HP_H