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
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
|
// 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)
#include "map_type.h"
namespace map {
class Map_find_string: public cds_test::stress_fixture
{
public:
static size_t s_nThreadCount; // thread count
static size_t s_nMapSize; // map size (count of searching item)
static size_t s_nPercentExists; // percent of existing keys in searching sequence
static size_t s_nPassCount;
static size_t s_nMaxLoadFactor; // maximum load factor
static size_t s_nCuckooInitialSize; // initial size for CuckooMap
static size_t s_nCuckooProbesetSize; // CuckooMap probeset size (only for list-based probeset)
static size_t s_nCuckooProbesetThreshold; // CUckooMap probeset threshold (o - use default)
static size_t s_nFeldmanMap_HeadBits;
static size_t s_nFeldmanMap_ArrayBits;
static size_t s_nLoadFactor; // current load factor
typedef std::string key_type;
struct value_type {
std::string const* pKey;
bool bExists ; // true - key in map, false - key not in map
};
typedef std::vector<value_type> value_vector;
static std::vector<std::string> s_arrString;
static value_vector s_Data;
static void SetUpTestCase();
static void TearDownTestCase();
static void setup_test_case();
static std::vector<size_t> get_load_factors();
private:
template <typename Iterator, typename Map>
static bool check_result( Iterator const& it, Map const& map )
{
return it != map.end();
}
template <typename Map>
static bool check_result( bool b, Map const& )
{
return b;
}
template <class Map>
class Worker: public cds_test::thread
{
typedef cds_test::thread base_class;
Map& m_Map;
public:
struct Stat {
size_t nSuccess = 0;
size_t nFailed = 0;
};
Stat m_KeyExists;
Stat m_KeyNotExists;
public:
Worker( cds_test::thread_pool& pool, Map& map )
: base_class( pool )
, m_Map( map )
, m_KeyExists()
, m_KeyNotExists()
{}
Worker( Worker& src )
: base_class( src )
, m_Map( src.m_Map )
, m_KeyExists()
, m_KeyNotExists()
{}
virtual thread * clone()
{
return new Worker( *this );
}
virtual void test()
{
size_t const nPassCount = s_nPassCount;
Map& rMap = m_Map;
for ( size_t nPass = 0; nPass < nPassCount; ++nPass ) {
if ( id() & 1 ) {
auto itEnd = s_Data.cend();
for ( auto it = s_Data.cbegin(); it != itEnd; ++it ) {
auto bFound = rMap.contains( *(it->pKey));
if ( it->bExists ) {
if ( check_result(bFound, rMap))
++m_KeyExists.nSuccess;
else
++m_KeyExists.nFailed;
}
else {
if ( check_result(bFound, rMap))
++m_KeyNotExists.nFailed;
else
++m_KeyNotExists.nSuccess;
}
}
}
else {
auto itEnd = s_Data.crend();
for ( auto it = s_Data.crbegin(); it != itEnd; ++it ) {
auto bFound = rMap.contains( *(it->pKey));
if ( it->bExists ) {
if ( check_result(bFound, rMap))
++m_KeyExists.nSuccess;
else
++m_KeyExists.nFailed;
}
else {
if ( check_result( bFound, rMap ))
++m_KeyNotExists.nFailed;
else
++m_KeyNotExists.nSuccess;
}
}
}
}
}
};
protected:
template <typename Hash>
static void fill_string_array();
template <class Map>
void test( Map& testMap )
{
typedef Worker<Map> worker;
// Fill the map
for ( size_t i = 0; i < s_Data.size(); ++i ) {
// All keys in arrData are unique, insert() must be successful
if ( s_Data[i].bExists ) {
EXPECT_TRUE( check_result( testMap.insert( *(s_Data[i].pKey), s_Data[i] ), testMap ));
}
}
propout() << std::make_pair( "thread_count", s_nThreadCount )
<< std::make_pair( "map_size", s_nMapSize )
<< std::make_pair( "percent_exist", s_nPercentExists )
<< std::make_pair( "pass_count", s_nPassCount );
cds_test::thread_pool& pool = get_pool();
pool.add( new worker( pool, testMap ), s_nThreadCount );
std::chrono::milliseconds duration = pool.run();
propout() << std::make_pair( "duration", duration );
size_t nExistSuccess = 0;
size_t nExistFailed = 0;
size_t nMissingSuccess = 0;
size_t nMissingFailed = 0;
// Postcondition: the number of success searching == the number of map item
for ( size_t i = 0; i < pool.size(); ++i ) {
worker& w = static_cast<worker&>(pool.get( i ));
nExistSuccess += w.m_KeyExists.nSuccess;
nExistFailed += w.m_KeyExists.nFailed;
nMissingSuccess += w.m_KeyNotExists.nSuccess;
nMissingFailed += w.m_KeyNotExists.nFailed;
EXPECT_EQ( w.m_KeyExists.nSuccess, s_nMapSize * s_nPassCount ) << "thread " << i;
EXPECT_EQ( w.m_KeyExists.nFailed, 0u ) << "thread " << i;
EXPECT_EQ( w.m_KeyNotExists.nSuccess, (s_Data.size() - s_nMapSize) * s_nPassCount ) << "thread " << i;
EXPECT_EQ( w.m_KeyNotExists.nFailed, 0u ) << "thread " << i;
}
propout()
<< std::make_pair( "exist_found", nExistSuccess )
<< std::make_pair( "exist_not_found", nExistFailed ) // must = 0
<< std::make_pair( "missing_not_found", nMissingSuccess )
<< std::make_pair( "missing_found", nMissingFailed ); // must = 0
check_before_cleanup( testMap );
testMap.clear();
additional_check( testMap );
print_stat( propout(), testMap );
additional_cleanup( testMap );
}
template <class Map>
void run_test()
{
ASSERT_GT( s_Data.size(), 0u );
Map testMap( *this );
test( testMap );
}
};
class Map_find_string_stdhash: public Map_find_string
{
public:
static void SetUpTestCase();
template <class Map>
void run_test()
{
Map_find_string::run_test<Map>();
}
};
#if CDS_BUILD_BITS == 64
class Map_find_string_city32: public Map_find_string
{
public:
static void SetUpTestCase();
template <class Map>
void run_test()
{
Map_find_string::run_test<Map>();
}
};
class Map_find_string_city64: public Map_find_string
{
public:
static void SetUpTestCase();
template <class Map>
void run_test()
{
Map_find_string::run_test<Map>();
}
};
class Map_find_string_city128: public Map_find_string
{
public:
static void SetUpTestCase();
template <class Map>
void run_test()
{
Map_find_string::run_test<Map>();
}
};
#endif // #if CDS_BUILD_BITS == 64
class Map_find_string_LF: public Map_find_string
, public ::testing::WithParamInterface<size_t>
{
public:
template <class Map>
void run_test()
{
s_nLoadFactor = GetParam();
propout() << std::make_pair( "load_factor", s_nLoadFactor );
Map_find_string::run_test<Map>();
}
};
} // namespace map
|
