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_SET_TEST_INTRUSIVE_SPLIT_ITERABLE_SET_HP_H
32 #define CDSUNIT_SET_TEST_INTRUSIVE_SPLIT_ITERABLE_SET_HP_H
34 #include "test_intrusive_split_iterable_set.h"
36 // forward declaration
37 namespace cds { namespace intrusive {}}
41 namespace ci = cds::intrusive;
42 namespace co = cds::opt;
44 class intrusive_split_iterable_set_hp: public intrusive_split_iterable_set
46 typedef intrusive_split_iterable_set base_class;
53 // Precondition: set is empty
54 // Postcondition: set is empty
56 base_class::test( s );
58 ASSERT_TRUE( s.empty());
59 ASSERT_CONTAINER_SIZE( s, 0 );
61 typedef typename Set::value_type value_type;
63 std::vector< value_type > data;
64 std::vector< size_t> indices;
65 data.reserve( kSize );
66 indices.reserve( kSize );
67 for ( size_t key = 0; key < kSize; ++key ) {
68 data.push_back( value_type( static_cast<int>(key)));
69 indices.push_back( key );
71 shuffle( indices.begin(), indices.end());
73 typename Set::guarded_ptr gp;
75 // get/extract from empty set
76 for ( auto idx : indices ) {
83 gp = s.get_with( other_item( i.key()), other_less());
88 gp = s.extract( i.key());
90 gp = s.extract_with( other_item( i.key()), other_less());
95 for ( auto& i : data ) {
97 ASSERT_TRUE( s.insert( i ));
101 for ( auto idx : indices ) {
104 EXPECT_EQ( i.nFindCount, 0u );
108 EXPECT_EQ( i.nFindCount, 1u );
110 gp = s.get( i.key());
113 EXPECT_EQ( i.nFindCount, 2u );
115 gp = s.get_with( other_item( i.key()), other_less());
118 EXPECT_EQ( i.nFindCount, 3u );
120 EXPECT_EQ( i.nEraseCount, 0u );
121 switch ( i.key() % 3 ) {
123 gp = s.extract( i.key());
129 gp = s.extract_with( other_item( i.key()), other_less());
134 EXPECT_EQ( i.nEraseCount, 1u );
138 gp = s.extract( i.key());
140 gp = s.extract_with( other_item( i.key()), other_less());
146 ASSERT_TRUE( s.empty());
147 ASSERT_CONTAINER_SIZE( s, 0 );
149 // Force retiring cycle
150 Set::gc::force_dispose();
151 for ( auto& i : data ) {
152 EXPECT_EQ( i.nDisposeCount, 1u );
158 } // namespace cds_test
160 #endif // #ifndef CDSUNIT_SET_TEST_INTRUSIVE_SPLIT_ITERABLE_SET_HP_H