2 This file is a part of libcds - Concurrent Data Structures library
4 (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
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_SET_RCU_H
32 #define CDSUNIT_TREE_TEST_TREE_SET_RCU_H
34 #include "test_tree_set.h"
38 class container_tree_set_rcu: public container_tree_set
40 typedef container_tree_set base_class;
43 template <typename Set>
46 // Precondition: set is empty
47 // Postcondition: set is empty
49 ASSERT_TRUE( s.empty());
50 ASSERT_CONTAINER_SIZE( s, 0 );
52 base_class::test( s );
54 typedef typename Set::value_type value_type;
56 size_t const nSetSize = kSize;
57 std::vector< value_type > data;
58 std::vector< size_t> indices;
59 data.reserve( kSize );
60 indices.reserve( kSize );
61 for ( size_t key = 0; key < kSize; ++key ) {
62 data.push_back( value_type( static_cast<int>(key)));
63 indices.push_back( key );
65 shuffle( indices.begin(), indices.end());
67 for ( auto i : indices ) {
68 ASSERT_TRUE( s.insert( data[i] ));
70 ASSERT_FALSE( s.empty());
71 ASSERT_CONTAINER_SIZE( s, nSetSize );
73 typedef typename Set::exempt_ptr exempt_ptr;
74 typedef value_type * raw_ptr;
75 typedef typename Set::rcu_lock rcu_lock;
78 for ( auto idx : indices ) {
95 rp = s.get_with( other_item( i.key()), other_less());
98 EXPECT_EQ( rp->key(), i.key());
99 rp->nFindCount = rp->key() * 3;
105 for ( auto idx : indices ) {
109 if ( Set::c_bExtractLockExternal ) {
115 xp = s.extract( i.key());
123 xp = s.extract_with( other_item( i.key()), other_less());
127 EXPECT_EQ( xp->key(), i.key());
128 EXPECT_EQ( xp->nFindCount, static_cast<unsigned>( i.key() * 3 ));
137 xp = s.extract( i.key());
143 xp = s.extract_with( other_item( i.key()), other_less());
152 xp = s.extract( i.key());
160 xp = s.extract_with( other_item( i.key()), other_less());
164 EXPECT_EQ( xp->key(), i.key());
165 EXPECT_EQ( xp->nFindCount, static_cast<unsigned>( i.key() * 3 ));
169 xp = s.extract( i.key());
175 xp = s.extract_with( other_item( i.key()), other_less());
182 ASSERT_TRUE( s.empty());
183 ASSERT_CONTAINER_SIZE( s, 0 );
185 for ( auto i : indices ) {
186 ASSERT_TRUE( s.insert( data[i] ));
188 ASSERT_FALSE( s.empty());
189 ASSERT_CONTAINER_SIZE( s, nSetSize );
194 while ( !s.empty()) {
195 xp = s.extract_min();
197 EXPECT_EQ( nKey + 1, xp->key());
202 EXPECT_EQ( nCount, nSetSize );
204 ASSERT_TRUE( s.empty());
205 ASSERT_CONTAINER_SIZE( s, 0 );
208 for ( auto i : indices ) {
209 ASSERT_TRUE( s.insert( data[i] ));
211 ASSERT_FALSE( s.empty());
212 ASSERT_CONTAINER_SIZE( s, nSetSize );
216 while ( !s.empty()) {
217 xp = s.extract_max();
219 EXPECT_EQ( nKey - 1, xp->key());
224 EXPECT_EQ( nCount, nSetSize );
226 ASSERT_TRUE( s.empty());
227 ASSERT_CONTAINER_SIZE( s, 0 );
231 } // namespace cds_test
233 #endif // CDSUNIT_TREE_TEST_TREE_SET_RCU_H