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_MAP_HP_H
32 #define CDSUNIT_TREE_TEST_TREE_MAP_HP_H
34 #include "test_tree_map.h"
38 class container_tree_map_hp: 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 size_t const kkSize = base_class::kSize;
56 std::vector<key_type> arrKeys;
57 for ( int i = 0; i < static_cast<int>(kkSize); ++i )
58 arrKeys.push_back( key_type( i ));
59 shuffle( arrKeys.begin(), arrKeys.end());
61 std::vector< value_type > arrVals;
62 for ( size_t i = 0; i < kkSize; ++i ) {
64 val.nVal = static_cast<int>( i );
65 val.strVal = std::to_string( i );
66 arrVals.push_back( val );
69 for ( auto const& i : arrKeys )
70 ASSERT_TRUE( m.insert( i ));
71 ASSERT_FALSE( m.empty());
72 ASSERT_CONTAINER_SIZE( m, kkSize );
75 typedef typename Map::guarded_ptr guarded_ptr;
78 for ( auto const& i : arrKeys ) {
79 value_type const& val = arrVals.at( i.nKey );
83 ASSERT_EQ( gp->first.nKey, i.nKey );
87 ASSERT_EQ( gp->first.nKey, i.nKey );
89 gp = m.get_with( other_item( i.nKey ), other_less());
91 ASSERT_EQ( gp->first.nKey, i.nKey );
93 switch ( i.nKey % 4 ) {
95 gp = m.extract( i.nKey );
101 gp = m.extract( val.strVal );
104 gp = m.extract_with( other_item( i.nKey ), other_less());
108 ASSERT_EQ( gp->first.nKey, i.nKey );
111 gp = m.get( i.nKey );
115 gp = m.get_with( other_item( i.nKey ), other_less());
118 ASSERT_TRUE( m.empty());
119 ASSERT_CONTAINER_SIZE( m, 0 );
121 gp = m.extract_min();
123 gp = m.extract_max();
126 for ( auto const& i : arrKeys )
127 ASSERT_TRUE( m.insert( i ));
128 ASSERT_FALSE( m.empty());
129 ASSERT_CONTAINER_SIZE( m, kkSize );
134 while ( !m.empty()) {
135 gp = m.extract_min();
137 EXPECT_EQ( gp->first.nKey, nKey + 1 );
138 nKey = gp->first.nKey;
141 ASSERT_TRUE( m.empty());
142 ASSERT_CONTAINER_SIZE( m, 0 );
143 EXPECT_EQ( nCount, kkSize );
146 for ( auto const& i : arrKeys )
147 ASSERT_TRUE( m.insert( i ));
148 ASSERT_FALSE( m.empty());
149 ASSERT_CONTAINER_SIZE( m, kkSize );
153 while ( !m.empty()) {
154 gp = m.extract_max();
156 EXPECT_EQ( gp->first.nKey, nKey - 1 );
157 nKey = gp->first.nKey;
160 ASSERT_TRUE( m.empty());
161 ASSERT_CONTAINER_SIZE( m, 0 );
162 EXPECT_EQ( nCount, kkSize );
164 ASSERT_TRUE( m.check_consistency());
168 } // namespace cds_test
170 #endif // #ifndef CDSUNIT_TREE_TEST_TREE_MAP_HP_H