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
|
// 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_TREE_SET_HP_H
#define CDSUNIT_SET_TEST_TREE_SET_HP_H
#include "test_tree_set.h"
namespace cds_test {
class container_tree_set_hp: public container_tree_set
{
typedef container_tree_set base_class;
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 );
base_class::test( s );
typedef typename Set::value_type value_type;
size_t const nSetSize = kSize;
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());
for ( auto i : indices ) {
ASSERT_TRUE( s.insert( data[i] ));
}
ASSERT_FALSE( s.empty());
ASSERT_CONTAINER_SIZE( s, nSetSize );
typedef typename Set::guarded_ptr guarded_ptr;
guarded_ptr gp;
// get()
for ( auto idx : indices ) {
auto& i = data[idx];
ASSERT_TRUE( !gp );
switch ( idx % 3 ) {
case 0:
gp = s.get( i.key());
ASSERT_FALSE( !gp );
break;
case 1:
gp = s.get( i );
ASSERT_FALSE( !gp );
break;
case 2:
gp = s.get_with( other_item( i.key()), other_less());
ASSERT_FALSE( !gp );
}
EXPECT_EQ( gp->key(), i.key());
gp->nFindCount = gp->key() * 3;
gp.release();
}
// extract()
for ( auto idx : indices ) {
auto& i = data[idx];
ASSERT_TRUE( !gp );
switch ( idx % 3 ) {
case 0:
gp = s.extract( i.key());
ASSERT_FALSE( !gp );
break;
case 1:
gp = s.extract( i );
ASSERT_FALSE( !gp );
break;
case 2:
gp = s.extract_with( other_item( i.key()), other_less());
ASSERT_FALSE( !gp );
break;
}
EXPECT_EQ( gp->key(), i.key());
EXPECT_EQ( gp->nFindCount, static_cast<size_t>( i.key() * 3 ));
switch ( idx % 3 ) {
case 0:
gp = s.extract( i.key());
break;
case 1:
gp = s.extract( i );
break;
case 2:
gp = s.extract_with( other_item( i.key()), other_less());
break;
}
ASSERT_TRUE( !gp );
}
ASSERT_TRUE( s.empty());
ASSERT_CONTAINER_SIZE( s, 0 );
for ( auto i : indices ) {
ASSERT_TRUE( s.insert( data[i] ));
}
ASSERT_FALSE( s.empty());
ASSERT_CONTAINER_SIZE( s, nSetSize );
// extract_min
size_t nCount = 0;
int nKey = -1;
while ( !s.empty()) {
gp = s.extract_min();
ASSERT_FALSE( !gp );
EXPECT_EQ( nKey + 1, gp->key());
++nCount;
nKey = gp->key();
}
gp.release();
EXPECT_EQ( nCount, nSetSize );
ASSERT_TRUE( s.empty());
ASSERT_CONTAINER_SIZE( s, 0 );
// extract_max
for ( auto i : indices ) {
ASSERT_TRUE( s.insert( data[i] ));
}
ASSERT_FALSE( s.empty());
ASSERT_CONTAINER_SIZE( s, nSetSize );
nCount = 0;
nKey = nSetSize;
while ( !s.empty()) {
gp = s.extract_max();
ASSERT_FALSE( !gp );
EXPECT_EQ( nKey - 1, gp->key());
++nCount;
nKey = gp->key();
}
gp.release();
EXPECT_EQ( nCount, nSetSize );
ASSERT_TRUE( s.empty());
ASSERT_CONTAINER_SIZE( s, 0 );
}
};
} // namespace cds_test
#endif // CDSUNIT_SET_TEST_TREE_SET_HP_H
|
