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_KV_LIST_HP_H
32 #define CDSUNIT_LIST_TEST_KV_LIST_HP_H
34 #include "test_kv_list.h"
38 class kv_list_hp : public kv_list_common
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::key_type list_key_type;
49 typedef typename List::mapped_type list_mapped_type;
50 typedef typename List::value_type list_value_type;
51 typedef typename List::guarded_ptr guarded_ptr;
59 for ( size_t i = 0; i < nSize; ++i ) {
60 arr[i].key = static_cast<int>(i);
61 arr[i].val = arr[i].key * 10;
63 shuffle( arr, arr + nSize );
65 ASSERT_TRUE( l.empty() );
66 ASSERT_CONTAINER_SIZE( l, 0 );
72 for ( auto& i : arr ) {
75 gp = l.get_with( other_key( i.key ), other_less());
78 EXPECT_TRUE( l.insert( i.key, i.val ));
82 EXPECT_EQ( gp->first.nKey, i.key );
83 EXPECT_EQ( gp->second.val, gp->first.nKey * 10 );
84 gp->second.val = gp->first.nKey * 5;
86 gp = l.get_with( other_key( i.key ), other_less());
88 EXPECT_EQ( gp->first.nKey, i.key );
89 EXPECT_EQ( gp->second.val, gp->first.nKey * 5 );
90 gp->second.val = gp->first.nKey * 10;
93 ASSERT_FALSE( l.empty() );
94 ASSERT_CONTAINER_SIZE( l, nCount );
97 ASSERT_FALSE( l.empty() );
98 ASSERT_CONTAINER_SIZE( l, nSize );
101 for ( auto const& i : arr ) {
102 ASSERT_FALSE( l.empty() );
103 ASSERT_CONTAINER_SIZE( l, nCount );
108 EXPECT_EQ( gp->first.nKey, i.key );
110 switch ( i.key & 1 ) {
112 gp = l.extract( i.key );
115 gp = l.extract_with( other_key( i.key ), other_less());
119 EXPECT_EQ( gp->first.nKey, i.key );
120 EXPECT_EQ( gp->second.val, gp->first.nKey * 10 );
125 gp = l.extract( i.key );
127 gp = l.extract_with( other_key( i.key ), other_less());
131 ASSERT_TRUE( l.empty() );
132 ASSERT_CONTAINER_SIZE( l, 0 );
136 } // namespace cds_list
138 #endif // CDSUNIT_LIST_TEST_KV_LIST_HP_H