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
|
// 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_SET_DATA_H
#define CDSUNIT_SET_TEST_SET_DATA_H
#include <cds_test/check_size.h>
#include <cds_test/fixture.h>
#include <cds/opt/hash.h>
// forward declaration
namespace cds { namespace container {}}
namespace cds_test {
namespace co = cds::opt;
class container_set_data : public fixture
{
public:
static size_t const kSize = 1000;
struct stat
{
unsigned int nFindCount;
unsigned int nUpdateNewCount;
unsigned int nUpdateCount;
mutable unsigned int nEraseCount;
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 hash_int {
size_t operator()( int i ) const
{
return co::v::hash<int>()(i);
}
template <typename Item>
size_t operator()( const Item& i ) const
{
return (*this)(i.key());
}
};
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 less
{
bool operator ()( int_item const& v1, int_item const& v2 ) const
{
return v1.key() < v2.key();
}
template <typename Q>
bool operator ()( int_item const& v1, const Q& v2 ) const
{
return v1.key() < v2;
}
template <typename Q>
bool operator ()( const Q& v1, int_item const& v2 ) const
{
return v1 < v2.key();
}
};
struct cmp {
int operator ()( int_item const& v1, int_item const& v2 ) const
{
if ( v1.key() < v2.key())
return -1;
return v1.key() > v2.key() ? 1 : 0;
}
template <typename T>
int operator ()( T const& v1, int v2 ) const
{
if ( v1.key() < v2 )
return -1;
return v1.key() > v2 ? 1 : 0;
}
template <typename T>
int operator ()( int v1, T const& v2 ) const
{
if ( v1 < v2.key())
return -1;
return v1 > 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();
}
};
};
} // namespace cds_test
#endif // CDSUNIT_SET_TEST_SET_DATA_H
|
