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_TREE_TEST_TREE_MAP_RCU_H
32 #define CDSUNIT_TREE_TEST_TREE_MAP_RCU_H
34 #include "test_tree_map.h"
38 class container_tree_map_rcu: public container_tree_map
40 typedef container_tree_map base_class;
46 // Precondition: map is empty
47 // Postcondition: map is empty
49 base_class::test( m );
51 ASSERT_TRUE( m.empty());
52 ASSERT_CONTAINER_SIZE( m, 0 );
54 typedef typename Map::value_type map_pair;
55 size_t const kkSize = base_class::kSize;
57 std::vector<key_type> arrKeys;
58 for ( int i = 0; i < static_cast<int>(kkSize); ++i )
59 arrKeys.push_back( key_type( i ));
60 shuffle( arrKeys.begin(), arrKeys.end());
62 std::vector< value_type > arrVals;
63 for ( size_t i = 0; i < kkSize; ++i ) {
65 val.nVal = static_cast<int>( i );
66 val.strVal = std::to_string( i );
67 arrVals.push_back( val );
70 for ( auto const& i : arrKeys )
71 ASSERT_TRUE( m.insert( i ) );
72 ASSERT_FALSE( m.empty() );
73 ASSERT_CONTAINER_SIZE( m, kkSize );
75 typedef typename Map::exempt_ptr exempt_ptr;
76 typedef typename Map::value_type * raw_ptr;
77 typedef typename Map::rcu_lock rcu_lock;
80 shuffle( arrKeys.begin(), arrKeys.end() );
83 for ( auto const& i : arrKeys ) {
84 value_type const& val = arrVals.at( i.nKey );
92 EXPECT_EQ( rp->first.nKey, i.nKey );
93 rp->second.nVal = rp->first.nKey * 2;
97 EXPECT_EQ( rp->first.nKey, i.nKey );
98 EXPECT_EQ( rp->second.nVal, rp->first.nKey * 2 );
99 rp->second.nVal = rp->first.nKey * 3;
101 rp = m.get_with( other_item( i.nKey ), other_less());
103 EXPECT_EQ( rp->first.nKey, i.nKey );
104 EXPECT_EQ( rp->second.nVal, rp->first.nKey * 3 );
105 rp->second.nVal = rp->first.nKey;
108 if ( Map::c_bExtractLockExternal ) {
112 switch ( i.nKey % 4 ) {
114 xp = m.extract( i.nKey );
120 xp = m.extract( val.strVal );
123 xp = m.extract_with( other_item( i.nKey ), other_less() );
127 EXPECT_EQ( xp->first.nKey, i.nKey );
128 EXPECT_EQ( xp->second.nVal, xp->first.nKey );
135 switch ( i.nKey % 4 ) {
137 xp = m.extract( i.nKey );
143 xp = m.extract( val.strVal );
146 xp = m.extract_with( other_item( i.nKey ), other_less() );
153 switch ( i.nKey % 4 ) {
155 xp = m.extract( i.nKey );
161 xp = m.extract( val.strVal );
164 xp = m.extract_with( other_item( i.nKey ), other_less());
168 EXPECT_EQ( xp->first.nKey, i.nKey );
169 EXPECT_EQ( xp->second.nVal, xp->first.nKey );
171 switch ( i.nKey % 4 ) {
173 xp = m.extract( i.nKey );
179 xp = m.extract( val.strVal );
182 xp = m.extract_with( other_item( i.nKey ), other_less() );
192 rp = m.get( i.nKey );
196 rp = m.get_with( other_item( i.nKey ), other_less() );
201 ASSERT_TRUE( m.empty() );
202 ASSERT_CONTAINER_SIZE( m, 0 );
206 for ( auto const& i : arrKeys )
207 ASSERT_TRUE( m.insert( i ) );
211 while ( !m.empty() ) {
212 xp = m.extract_min();
214 EXPECT_EQ( xp->first.nKey, nKey + 1 );
215 nKey = xp->first.nKey;
218 xp = m.extract_min();
220 xp = m.extract_max();
222 EXPECT_EQ( kkSize, nCount );
223 ASSERT_TRUE( m.empty() );
224 ASSERT_CONTAINER_SIZE( m, 0 );
227 xp = m.extract_min();
229 xp = m.extract_max();
232 for ( auto const& i : arrKeys )
233 ASSERT_TRUE( m.insert( i ) );
237 while ( !m.empty() ) {
238 xp = m.extract_max();
240 EXPECT_EQ( xp->first.nKey, nKey - 1 );
241 nKey = xp->first.nKey;
245 xp = m.extract_min();
247 xp = m.extract_max();
249 EXPECT_EQ( kkSize, nCount );
250 ASSERT_TRUE( m.empty() );
251 ASSERT_CONTAINER_SIZE( m, 0 );
255 } // namespace cds_test
257 #endif // #ifndef CDSUNIT_TREE_TEST_TREE_MAP_RCU_H