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
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
|
// 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_SET_TEST_FELDMAN_HASHSET_H
#define CDSUNIT_SET_TEST_FELDMAN_HASHSET_H
#include <cds_test/check_size.h>
#include <cds_test/fixture.h>
#include <cds/opt/hash.h>
// forward declaration
namespace cds { namespace container {}}
namespace co = cds::opt;
namespace cc = cds::container;
namespace cds_test {
class feldman_hashset : public fixture
{
public:
static size_t const kSize = 1000;
struct stat
{
unsigned int nFindCount;
unsigned int nUpdateNewCount;
unsigned int nUpdateCount;
stat()
{
clear_stat();
}
void clear_stat()
{
memset( this, 0, sizeof( *this ));
}
};
struct other_item {
int nKey;
explicit other_item( int k )
: nKey( k )
{}
int key() const
{
return nKey;
}
};
struct int_item: public stat
{
int nKey;
int nVal;
std::string strVal;
int_item()
: nKey( 0 )
, nVal( 0 )
{}
explicit int_item( int k )
: nKey( k )
, nVal( k * 2 )
{}
template <typename Q>
explicit int_item( Q const& src )
: nKey( src.key())
, nVal( 0 )
{}
int_item( int_item const& src )
: nKey( src.nKey )
, nVal( src.nVal )
, strVal( src.strVal )
{}
int_item( int_item&& src )
: nKey( src.nKey )
, nVal( src.nVal )
, strVal( std::move( src.strVal ))
{}
int_item( int k, std::string&& s )
: nKey( k )
, nVal( k * 2 )
, strVal( std::move( s ))
{}
explicit int_item( other_item const& s )
: nKey( s.key())
, nVal( s.key() * 2 )
{}
int key() const
{
return nKey;
}
};
struct key_val {
int nKey;
int nVal;
key_val()
{}
key_val( int key )
: nKey( key )
, nVal( key )
{}
key_val( int key, int val )
: nKey( key )
, nVal( val )
{}
key_val( key_val const& v )
: nKey( v.nKey )
, nVal( v.nVal )
{}
int key() const
{
return nKey;
}
};
struct int_item2: public key_val, public stat
{
std::string strVal;
int_item2()
{}
explicit int_item2( int key )
: key_val( key )
{}
int_item2( int key, int val )
: key_val( key, val )
{}
int_item2( int_item2 const& v )
: key_val( v )
, stat()
, strVal( v.strVal )
{}
int_item2( int_item2&& v )
: key_val( v )
, stat()
, strVal( std::move( v.strVal ))
{}
int_item2( int k, std::string&& s )
: key_val( k, k * 2 )
, strVal( std::move( s ))
{}
explicit int_item2( other_item const& s )
: key_val( s.key(), s.key() * 2 )
{}
};
struct get_hash {
int operator()( int_item const& i ) const
{
return i.key();
}
int operator()( other_item const& i ) const
{
return i.key();
}
int operator()( int i ) const
{
return i;
}
};
struct get_hash2 {
key_val const& operator()( int_item2 const& i ) const
{
return i;
}
key_val operator()( other_item const& i ) const
{
return key_val( i.key());
}
key_val operator()( int i ) const
{
return key_val( i );
}
};
struct simple_item_counter {
size_t m_nCount;
simple_item_counter()
: m_nCount( 0 )
{}
size_t operator ++()
{
return ++m_nCount;
}
size_t operator --()
{
return --m_nCount;
}
void reset()
{
m_nCount = 0;
}
operator size_t() const
{
return m_nCount;
}
};
struct cmp {
int operator ()( int v1, int v2 ) const
{
if ( v1 < v2 )
return -1;
return v1 > v2 ? 1 : 0;
}
};
struct cmp2 {
int operator ()( key_val const& v1, key_val const& v2 ) const
{
if ( v1.key() < v2.key())
return -1;
return v1.key() > v2.key() ? 1 : 0;
}
};
struct other_less {
template <typename Q, typename T>
bool operator()( Q const& lhs, T const& rhs ) const
{
return lhs.key() < rhs.key();
}
};
protected:
template <typename Set>
void test( Set& s )
{
// Precondition: set is empty
// Postcondition: set is empty
ASSERT_TRUE( s.empty());
ASSERT_CONTAINER_SIZE( s, 0 );
size_t const nSetSize = kSize;
typedef typename Set::value_type value_type;
std::vector< value_type > data;
std::vector< size_t> indices;
data.reserve( kSize );
indices.reserve( kSize );
for ( size_t key = 0; key < kSize; ++key ) {
data.push_back( value_type( static_cast<int>(key)));
indices.push_back( key );
}
shuffle( indices.begin(), indices.end());
// insert/find
for ( auto idx : indices ) {
auto& i = data[idx];
ASSERT_FALSE( s.contains( i.nKey ));
ASSERT_FALSE( s.find( i.nKey, []( value_type& ) {} ));
std::pair<bool, bool> updResult;
std::string str;
updResult = s.update( i.key(), []( value_type&, value_type * )
{
ASSERT_TRUE( false );
}, false );
EXPECT_FALSE( updResult.first );
EXPECT_FALSE( updResult.second );
switch ( idx % 8 ) {
case 0:
ASSERT_TRUE( s.insert( i ));
ASSERT_FALSE( s.insert( i ));
updResult = s.update( i, []( value_type& val, value_type * prev )
{
ASSERT_TRUE( prev != nullptr );
EXPECT_EQ( val.key(), prev->key());
}, false );
EXPECT_TRUE( updResult.first );
EXPECT_FALSE( updResult.second );
break;
case 1:
ASSERT_TRUE( s.insert( i.key()));
ASSERT_FALSE( s.insert( i.key()));
updResult = s.update( i.key(), []( value_type& val, value_type * prev )
{
ASSERT_TRUE( prev != nullptr );
EXPECT_EQ( val.key(), prev->key());
}, false );
EXPECT_TRUE( updResult.first );
EXPECT_FALSE( updResult.second );
break;
case 2:
ASSERT_TRUE( s.insert( i, []( value_type& v ) { ++v.nFindCount; } ));
ASSERT_FALSE( s.insert( i, []( value_type& v ) { ++v.nFindCount; } ));
ASSERT_TRUE( s.find( i.nKey, []( value_type const& v )
{
EXPECT_EQ( v.nFindCount, 1u );
}));
break;
case 3:
ASSERT_TRUE( s.insert( i.key(), []( value_type& v ) { ++v.nFindCount; } ));
ASSERT_FALSE( s.insert( i.key(), []( value_type& v ) { ++v.nFindCount; } ));
ASSERT_TRUE( s.find( i.nKey, []( value_type const& v )
{
EXPECT_EQ( v.nFindCount, 1u );
}));
break;
case 4:
updResult = s.update( i, []( value_type& v, value_type * prev )
{
EXPECT_TRUE( prev == nullptr );
++v.nUpdateNewCount;
});
EXPECT_TRUE( updResult.first );
EXPECT_TRUE( updResult.second );
updResult = s.update( i, []( value_type& v, value_type * prev )
{
ASSERT_TRUE( prev != nullptr );
EXPECT_EQ( prev->nUpdateNewCount, 1u );
EXPECT_EQ( v.key(), prev->key());
++v.nUpdateCount;
}, false );
EXPECT_TRUE( updResult.first );
EXPECT_FALSE( updResult.second );
ASSERT_TRUE( s.find( i.nKey, []( value_type const& v )
{
EXPECT_EQ( v.nUpdateCount, 1u );
EXPECT_EQ( v.nUpdateNewCount, 0u );
}));
break;
case 5:
updResult = s.update( i.key(), []( value_type& v, value_type * prev )
{
EXPECT_TRUE( prev == nullptr );
++v.nUpdateNewCount;
});
EXPECT_TRUE( updResult.first );
EXPECT_TRUE( updResult.second );
updResult = s.update( i.key(), []( value_type& v, value_type * prev )
{
ASSERT_TRUE( prev != nullptr );
EXPECT_EQ( v.key(), prev->key());
EXPECT_EQ( prev->nUpdateNewCount, 1u );
EXPECT_EQ( v.nUpdateNewCount, 0u );
++v.nUpdateNewCount;
}, false );
EXPECT_TRUE( updResult.first );
EXPECT_FALSE( updResult.second );
ASSERT_TRUE( s.find( i.key(), []( value_type const& v )
{
EXPECT_EQ( v.nUpdateNewCount, 1u );
} ));
break;
case 6:
ASSERT_TRUE( s.emplace( i.key()));
ASSERT_TRUE( s.contains( i.key()));
break;
case 7:
str = "Hello!";
ASSERT_TRUE( s.emplace( i.key(), std::move( str )));
EXPECT_TRUE( str.empty());
ASSERT_TRUE( s.find( i.key(), []( value_type const& v )
{
EXPECT_EQ( v.strVal, std::string( "Hello!" ));
} ));
break;
default:
// forgot anything?..
ASSERT_TRUE( false );
}
ASSERT_TRUE( s.contains( i.nKey ));
ASSERT_TRUE( s.find( i.nKey, []( value_type& ) {} ));
}
ASSERT_FALSE( s.empty());
ASSERT_CONTAINER_SIZE( s, nSetSize );
// erase
shuffle( indices.begin(), indices.end());
for ( auto idx : indices ) {
auto& i = data[idx];
ASSERT_TRUE( s.contains( i.nKey ));
ASSERT_TRUE( s.find( i.nKey, []( value_type& v )
{
v.nFindCount = 1;
} ));
int nKey = i.key() - 1;
switch ( idx % 2 ) {
case 0:
ASSERT_TRUE( s.erase( i.key()));
ASSERT_FALSE( s.erase( i.key()));
break;
case 1:
ASSERT_TRUE( s.erase( i.key(), [&nKey]( value_type const& v )
{
EXPECT_EQ( v.nFindCount, 1u );
nKey = v.key();
} ));
EXPECT_EQ( i.key(), nKey );
nKey = i.key() - 1;
ASSERT_FALSE( s.erase( i.key(), [&nKey]( value_type const& v )
{
nKey = v.key();
} ));
EXPECT_EQ( i.key(), nKey + 1 );
break;
}
ASSERT_FALSE( s.contains( i.nKey ));
ASSERT_FALSE( s.find( i.nKey, []( value_type const& ) {} ));
}
ASSERT_TRUE( s.empty());
ASSERT_CONTAINER_SIZE( s, 0u );
// clear
for ( auto& i : data ) {
ASSERT_TRUE( s.insert( i ));
}
{
typename Set::stat const& statistics = s.statistics();
CDS_UNUSED( statistics );
std::vector< typename Set::level_statistics > lstat;
s.get_level_statistics( lstat );
EXPECT_EQ( lstat[0].node_capacity, s.head_size());
for ( size_t i = 1; i < lstat.size(); ++i ) {
EXPECT_EQ( lstat[i].node_capacity, s.array_node_size());
}
}
ASSERT_FALSE( s.empty());
ASSERT_CONTAINER_SIZE( s, nSetSize );
s.clear();
ASSERT_TRUE( s.empty());
ASSERT_CONTAINER_SIZE( s, 0u );
ASSERT_TRUE( s.begin() == s.end());
ASSERT_TRUE( s.cbegin() == s.cend());
ASSERT_TRUE( s.rbegin() == s.rend());
ASSERT_TRUE( s.crbegin() == s.crend());
}
};
} // namespace cds_test
#endif // CDSUNIT_SET_TEST_FELDMAN_HASHSET_H
|
