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_MAP_TEST_MAP_RCU_H
32 #define CDSUNIT_MAP_TEST_MAP_RCU_H
38 class container_map_rcu: public container_map
40 typedef container_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 );
77 for ( auto it = m.begin(); it != m.end(); ++it ) {
78 EXPECT_EQ( it->second.nVal, 0 );
79 it->second.nVal = it->first.nKey * 2;
82 EXPECT_EQ( nCount, kkSize );
85 for ( auto it = m.cbegin(); it != m.cend(); ++it ) {
86 EXPECT_EQ( it->second.nVal, it->first.nKey * 2 );
89 EXPECT_EQ( nCount, kkSize );
91 typedef typename Map::exempt_ptr exempt_ptr;
92 typedef typename Map::raw_ptr raw_ptr;
93 typedef typename Map::rcu_lock rcu_lock;
96 shuffle( arrKeys.begin(), arrKeys.end() );
98 for ( auto const& i : arrKeys ) {
99 value_type const& val = arrVals.at( i.nKey );
105 rp = m.get( i.nKey );
107 EXPECT_EQ( rp->first.nKey, i.nKey );
108 rp->second.nVal = rp->first.nKey * 2;
112 EXPECT_EQ( rp->first.nKey, i.nKey );
113 EXPECT_EQ( rp->second.nVal, rp->first.nKey * 2 );
114 rp->second.nVal = rp->first.nKey * 3;
116 rp = m.get_with( other_item( i.nKey ), other_less());
118 EXPECT_EQ( rp->first.nKey, i.nKey );
119 EXPECT_EQ( rp->second.nVal, rp->first.nKey * 3 );
120 rp->second.nVal = rp->first.nKey;
124 if ( Map::c_bExtractLockExternal ) {
128 switch ( i.nKey % 4 ) {
130 xp = m.extract( i.nKey );
136 xp = m.extract( val.strVal );
139 xp = m.extract_with( other_item( i.nKey ), other_less() );
143 EXPECT_EQ( xp->first.nKey, i.nKey );
144 EXPECT_EQ( xp->second.nVal, xp->first.nKey );
151 switch ( i.nKey % 4 ) {
153 xp = m.extract( i.nKey );
159 xp = m.extract( val.strVal );
162 xp = m.extract_with( other_item( i.nKey ), other_less() );
169 switch ( i.nKey % 4 ) {
171 xp = m.extract( i.nKey );
177 xp = m.extract( val.strVal );
180 xp = m.extract_with( other_item( i.nKey ), other_less());
184 EXPECT_EQ( xp->first.nKey, i.nKey );
185 EXPECT_EQ( xp->second.nVal, xp->first.nKey );
187 switch ( i.nKey % 4 ) {
189 xp = m.extract( i.nKey );
195 xp = m.extract( val.strVal );
198 xp = m.extract_with( other_item( i.nKey ), other_less() );
208 rp = m.get( i.nKey );
212 rp = m.get_with( other_item( i.nKey ), other_less() );
217 ASSERT_TRUE( m.empty() );
218 ASSERT_CONTAINER_SIZE( m, 0 );
222 } // namespace cds_test
224 #endif // #ifndef CDSUNIT_MAP_TEST_MAP_H