1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
|
// Copyright (c) 2006-2018 Maxim Khizhinsky
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)
#ifndef CDSUNIT_MAP_TEST_FELDMAN_HASHMAP_HP_H
#define CDSUNIT_MAP_TEST_FELDMAN_HASHMAP_HP_H
#include "test_feldman_hashmap.h"
namespace cds_test {
class feldman_hashmap_hp: public feldman_hashmap
{
typedef feldman_hashmap base_class;
protected:
template <class Map>
void test( Map& m )
{
// Precondition: map is empty
// Postcondition: map is empty
base_class::test( m );
ASSERT_TRUE( m.empty());
ASSERT_CONTAINER_SIZE( m, 0 );
//typedef typename Map::value_type map_pair;
size_t const kkSize = base_class::kSize;
typedef typename Map::key_type key_type;
typedef typename Map::mapped_type value_type;
std::vector<key_type> arrKeys;
for ( int i = 0; i < static_cast<int>(kkSize); ++i )
arrKeys.push_back( key_type( i ));
shuffle( arrKeys.begin(), arrKeys.end());
std::vector< value_type > arrVals;
for ( size_t i = 0; i < kkSize; ++i ) {
value_type val;
val.nVal = static_cast<int>( i );
val.strVal = std::to_string( i );
arrVals.push_back( val );
}
for ( auto const& i : arrKeys )
ASSERT_TRUE( m.insert( i ));
ASSERT_FALSE( m.empty());
ASSERT_CONTAINER_SIZE( m, kkSize );
// iterators
size_t nCount = 0;
for ( auto it = m.begin(); it != m.end(); ++it ) {
EXPECT_EQ( it->second.nVal, 0 );
it->second.nVal = it->first.nKey * 2;
++nCount;
}
EXPECT_EQ( nCount, kkSize );
nCount = 0;
for ( auto it = m.cbegin(); it != m.cend(); ++it ) {
EXPECT_EQ( it->second.nVal, it->first.nKey * 2 );
++nCount;
}
EXPECT_EQ( nCount, kkSize );
nCount = 0;
for ( auto it = m.rbegin(); it != m.rend(); ++it ) {
EXPECT_EQ( it->second.nVal, it->first.nKey * 2 );
it->second.nVal = it->first.nKey * 4;
++nCount;
}
EXPECT_EQ( nCount, kkSize );
nCount = 0;
for ( auto it = m.crbegin(); it != m.crend(); ++it ) {
EXPECT_EQ( it->second.nVal, it->first.nKey * 4 );
++nCount;
}
EXPECT_EQ( nCount, kkSize );
// get/extract
typedef typename Map::guarded_ptr guarded_ptr;
guarded_ptr gp;
for ( auto const& i : arrKeys ) {
value_type const& val = arrVals.at( i.nKey );
gp = m.get( i.nKey );
ASSERT_FALSE( !gp );
ASSERT_EQ( gp->first.nKey, i.nKey );
gp.release();
gp = m.get( i );
ASSERT_FALSE( !gp );
ASSERT_EQ( gp->first.nKey, i.nKey );
gp.release();
switch ( i.nKey % 3 ) {
case 0:
gp = m.extract( i.nKey );
break;
case 1:
gp = m.extract( i );
break;
case 2:
gp = m.extract( val.strVal );
break;
}
ASSERT_FALSE( !gp );
ASSERT_EQ( gp->first.nKey, i.nKey );
gp.release();
gp = m.get( i.nKey );
ASSERT_TRUE( !gp );
gp = m.get( i );
ASSERT_TRUE( !gp );
}
ASSERT_TRUE( m.empty());
ASSERT_CONTAINER_SIZE( m, 0 );
// erase_at( iterator )
for ( auto const& i : arrKeys )
ASSERT_TRUE( m.insert( i ));
ASSERT_FALSE( m.empty());
ASSERT_CONTAINER_SIZE( m, kkSize );
nCount = 0;
for ( auto it = m.begin(); it != m.end(); ++it ) {
EXPECT_EQ( it->second.nVal, 0 );
ASSERT_TRUE( m.erase_at( it ));
++nCount;
}
EXPECT_EQ( nCount, kkSize );
ASSERT_TRUE( m.empty());
ASSERT_CONTAINER_SIZE( m, 0 );
// erase_at( reverse_iterator )
for ( auto const& i : arrKeys )
ASSERT_TRUE( m.insert( i ));
ASSERT_FALSE( m.empty());
ASSERT_CONTAINER_SIZE( m, kkSize );
nCount = 0;
for ( auto it = m.rbegin(); it != m.rend(); ++it ) {
EXPECT_EQ( it->second.nVal, 0 );
ASSERT_TRUE( m.erase_at( it ));
++nCount;
}
EXPECT_EQ( nCount, kkSize );
ASSERT_TRUE( m.empty());
ASSERT_CONTAINER_SIZE( m, 0 );
// erase_at( const_reverse_iterator )
for ( auto const& i : arrKeys )
ASSERT_TRUE( m.insert( i ));
ASSERT_FALSE( m.empty());
ASSERT_CONTAINER_SIZE( m, kkSize );
nCount = 0;
for ( auto it = m.crbegin(); it != m.crend(); ++it ) {
EXPECT_EQ( it->second.nVal, 0 );
ASSERT_TRUE( m.erase_at( it ));
++nCount;
}
EXPECT_EQ( nCount, kkSize );
ASSERT_TRUE( m.empty());
ASSERT_CONTAINER_SIZE( m, 0 );
// erase_at( const_iterator )
for ( auto const& i : arrKeys )
ASSERT_TRUE( m.insert( i ));
ASSERT_FALSE( m.empty());
ASSERT_CONTAINER_SIZE( m, kkSize );
nCount = 0;
for ( auto it = m.cbegin(); it != m.cend(); ++it ) {
EXPECT_EQ( it->second.nVal, 0 );
ASSERT_TRUE( m.erase_at( it ));
++nCount;
}
EXPECT_EQ( nCount, kkSize );
ASSERT_TRUE( m.empty());
ASSERT_CONTAINER_SIZE( m, 0 );
}
};
} // namespace cds_test
#endif // #ifndef CDSUNIT_MAP_TEST_FELDMAN_HASHMAP_HP_H
|
