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_MAP_TEST_FELDMAN_HASHMAP_HP_H
32 #define CDSUNIT_MAP_TEST_FELDMAN_HASHMAP_HP_H
34 #include "test_feldman_hashmap.h"
38 class feldman_hashmap_hp: public feldman_hashmap
40 typedef feldman_hashmap 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 typedef typename Map::key_type key_type;
58 typedef typename Map::mapped_type value_type;
60 std::vector<key_type> arrKeys;
61 for ( int i = 0; i < static_cast<int>(kkSize); ++i )
62 arrKeys.push_back( key_type( i ));
63 shuffle( arrKeys.begin(), arrKeys.end());
65 std::vector< value_type > arrVals;
66 for ( size_t i = 0; i < kkSize; ++i ) {
68 val.nVal = static_cast<int>( i );
69 val.strVal = std::to_string( i );
70 arrVals.push_back( val );
73 for ( auto const& i : arrKeys )
74 ASSERT_TRUE( m.insert( i ));
75 ASSERT_FALSE( m.empty());
76 ASSERT_CONTAINER_SIZE( m, kkSize );
80 for ( auto it = m.begin(); it != m.end(); ++it ) {
81 EXPECT_EQ( it->second.nVal, 0 );
82 it->second.nVal = it->first.nKey * 2;
85 EXPECT_EQ( nCount, kkSize );
88 for ( auto it = m.cbegin(); it != m.cend(); ++it ) {
89 EXPECT_EQ( it->second.nVal, it->first.nKey * 2 );
92 EXPECT_EQ( nCount, kkSize );
95 for ( auto it = m.rbegin(); it != m.rend(); ++it ) {
96 EXPECT_EQ( it->second.nVal, it->first.nKey * 2 );
97 it->second.nVal = it->first.nKey * 4;
100 EXPECT_EQ( nCount, kkSize );
103 for ( auto it = m.crbegin(); it != m.crend(); ++it ) {
104 EXPECT_EQ( it->second.nVal, it->first.nKey * 4 );
107 EXPECT_EQ( nCount, kkSize );
110 typedef typename Map::guarded_ptr guarded_ptr;
113 for ( auto const& i : arrKeys ) {
114 value_type const& val = arrVals.at( i.nKey );
116 gp = m.get( i.nKey );
118 ASSERT_EQ( gp->first.nKey, i.nKey );
122 ASSERT_EQ( gp->first.nKey, i.nKey );
125 switch ( i.nKey % 3 ) {
127 gp = m.extract( i.nKey );
133 gp = m.extract( val.strVal );
137 ASSERT_EQ( gp->first.nKey, i.nKey );
140 gp = m.get( i.nKey );
145 ASSERT_TRUE( m.empty());
146 ASSERT_CONTAINER_SIZE( m, 0 );
148 // erase_at( iterator )
149 for ( auto const& i : arrKeys )
150 ASSERT_TRUE( m.insert( i ));
151 ASSERT_FALSE( m.empty());
152 ASSERT_CONTAINER_SIZE( m, kkSize );
155 for ( auto it = m.begin(); it != m.end(); ++it ) {
156 EXPECT_EQ( it->second.nVal, 0 );
157 ASSERT_TRUE( m.erase_at( it ));
160 EXPECT_EQ( nCount, kkSize );
161 ASSERT_TRUE( m.empty());
162 ASSERT_CONTAINER_SIZE( m, 0 );
164 // erase_at( reverse_iterator )
165 for ( auto const& i : arrKeys )
166 ASSERT_TRUE( m.insert( i ));
167 ASSERT_FALSE( m.empty());
168 ASSERT_CONTAINER_SIZE( m, kkSize );
171 for ( auto it = m.rbegin(); it != m.rend(); ++it ) {
172 EXPECT_EQ( it->second.nVal, 0 );
173 ASSERT_TRUE( m.erase_at( it ));
176 EXPECT_EQ( nCount, kkSize );
177 ASSERT_TRUE( m.empty());
178 ASSERT_CONTAINER_SIZE( m, 0 );
180 // erase_at( const_reverse_iterator )
181 for ( auto const& i : arrKeys )
182 ASSERT_TRUE( m.insert( i ));
183 ASSERT_FALSE( m.empty());
184 ASSERT_CONTAINER_SIZE( m, kkSize );
187 for ( auto it = m.crbegin(); it != m.crend(); ++it ) {
188 EXPECT_EQ( it->second.nVal, 0 );
189 ASSERT_TRUE( m.erase_at( it ));
192 EXPECT_EQ( nCount, kkSize );
193 ASSERT_TRUE( m.empty());
194 ASSERT_CONTAINER_SIZE( m, 0 );
196 // erase_at( const_iterator )
197 for ( auto const& i : arrKeys )
198 ASSERT_TRUE( m.insert( i ));
199 ASSERT_FALSE( m.empty());
200 ASSERT_CONTAINER_SIZE( m, kkSize );
203 for ( auto it = m.cbegin(); it != m.cend(); ++it ) {
204 EXPECT_EQ( it->second.nVal, 0 );
205 ASSERT_TRUE( m.erase_at( it ));
208 EXPECT_EQ( nCount, kkSize );
209 ASSERT_TRUE( m.empty());
210 ASSERT_CONTAINER_SIZE( m, 0 );
214 } // namespace cds_test
216 #endif // #ifndef CDSUNIT_MAP_TEST_FELDMAN_HASHMAP_HP_H