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_SET_TEST_TREE_SET_HP_H
32 #define CDSUNIT_SET_TEST_TREE_SET_HP_H
34 #include "test_tree_set.h"
38 class container_tree_set_hp: 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::guarded_ptr guarded_ptr;
77 for ( auto idx : indices ) {
83 gp = s.get( i.key() );
91 gp = s.get_with( other_item( i.key() ), other_less() );
94 EXPECT_EQ( gp->key(), i.key() );
95 gp->nFindCount = gp->key() * 3;
101 for ( auto idx : indices ) {
107 gp = s.extract( i.key() );
115 gp = s.extract_with( other_item( i.key() ), other_less() );
119 EXPECT_EQ( gp->key(), i.key() );
120 EXPECT_EQ( gp->nFindCount, i.key() * 3 );
124 gp = s.extract( i.key() );
130 gp = s.extract_with( other_item( i.key() ), other_less() );
136 ASSERT_TRUE( s.empty() );
137 ASSERT_CONTAINER_SIZE( s, 0 );
139 for ( auto i : indices ) {
140 ASSERT_TRUE( s.insert( data[i] ) );
142 ASSERT_FALSE( s.empty() );
143 ASSERT_CONTAINER_SIZE( s, nSetSize );
148 while ( !s.empty() ) {
149 gp = s.extract_min();
151 EXPECT_EQ( nKey + 1, gp->key() );
156 EXPECT_EQ( nCount, nSetSize );
158 ASSERT_TRUE( s.empty() );
159 ASSERT_CONTAINER_SIZE( s, 0 );
162 for ( auto i : indices ) {
163 ASSERT_TRUE( s.insert( data[i] ));
165 ASSERT_FALSE( s.empty() );
166 ASSERT_CONTAINER_SIZE( s, nSetSize );
170 while ( !s.empty() ) {
171 gp = s.extract_max();
173 EXPECT_EQ( nKey - 1, gp->key() );
178 EXPECT_EQ( nCount, nSetSize );
180 ASSERT_TRUE( s.empty() );
181 ASSERT_CONTAINER_SIZE( s, 0 );
186 } // namespace cds_test
188 #endif // CDSUNIT_SET_TEST_TREE_SET_HP_H