boost_unordered 0.1.0

Boost C++ library boost_unordered packaged using Zanbil
Documentation 
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


// Copyright 2008-2009 Daniel James.
// Copyright 2022-2023 Christian Mazakas.
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

// clang-format off
#include "../helpers/prefix.hpp"
#ifdef BOOST_UNORDERED_FOA_TESTS
#include <boost/unordered/unordered_flat_set_fwd.hpp>
#include <boost/unordered/unordered_node_set_fwd.hpp>
#include <boost/unordered/detail/implementation.hpp>
#else
#include <boost/unordered/unordered_set_fwd.hpp>
#endif
#include "../helpers/postfix.hpp"
// clang-format on

struct true_type
{
  char x[100];
};
struct false_type
{
  char x;
};

false_type is_unordered_set_impl(void*);

#ifdef BOOST_UNORDERED_FOA_TESTS
template <class Value, class Hash, class Pred, class Alloc>
true_type is_unordered_set_impl(
  boost::unordered_flat_set<Value, Hash, Pred, Alloc>*);

template <class Value, class Hash, class Pred, class Alloc>
true_type is_unordered_set_impl(
  boost::unordered_node_set<Value, Hash, Pred, Alloc>*);

template <typename T>
void call_swap(boost::unordered_flat_set<T>& x, boost::unordered_flat_set<T>& y)
{
  swap(x, y);
}

template <typename T>
void call_swap(boost::unordered_node_set<T>& x, boost::unordered_node_set<T>& y)
{
  swap(x, y);
}

template <typename T>
bool call_equals(
  boost::unordered_flat_set<T>& x, boost::unordered_flat_set<T>& y)
{
  return x == y;
}

template <typename T>
bool call_equals(
  boost::unordered_node_set<T>& x, boost::unordered_node_set<T>& y)
{
  return x == y;
}

template <typename T>
bool call_not_equals(
  boost::unordered_flat_set<T>& x, boost::unordered_flat_set<T>& y)
{
  return x != y;
}

template <typename T>
bool call_not_equals(
  boost::unordered_node_set<T>& x, boost::unordered_node_set<T>& y)
{
  return x != y;
}
#else
template <class Value, class Hash, class Pred, class Alloc>
true_type is_unordered_set_impl(
  boost::unordered_set<Value, Hash, Pred, Alloc>*);

template <typename T>
void call_swap(boost::unordered_set<T>& x, boost::unordered_set<T>& y)
{
  swap(x, y);
}

template <typename T>
bool call_equals(boost::unordered_set<T>& x, boost::unordered_set<T>& y)
{
  return x == y;
}

template <typename T>
bool call_not_equals(boost::unordered_set<T>& x, boost::unordered_set<T>& y)
{
  return x != y;
}
#endif

#ifndef BOOST_UNORDERED_FOA_TESTS
template <typename T>
void call_swap(boost::unordered_multiset<T>& x, boost::unordered_multiset<T>& y)
{
  swap(x, y);
}

template <typename T>
bool call_equals(
  boost::unordered_multiset<T>& x, boost::unordered_multiset<T>& y)
{
  return x == y;
}

template <typename T>
bool call_not_equals(
  boost::unordered_multiset<T>& x, boost::unordered_multiset<T>& y)
{
  return x != y;
}
#endif

#include "../helpers/test.hpp"

#ifdef BOOST_UNORDERED_FOA_TESTS
typedef boost::unordered_flat_set<int> int_set;
typedef boost::unordered_node_set<int> int_node_set;
#else
typedef boost::unordered_set<int> int_set;
typedef boost::unordered_multiset<int> int_multiset;
#endif

UNORDERED_AUTO_TEST (use_fwd_declared_trait_without_definition) {
  BOOST_TEST(sizeof(is_unordered_set_impl((int_set*)0)) == sizeof(true_type));
#ifdef BOOST_UNORDERED_FOA_TESTS
  BOOST_TEST(
    sizeof(is_unordered_set_impl((int_node_set*)0)) == sizeof(true_type));
#endif
}

#ifdef BOOST_UNORDERED_FOA_TESTS
#include <boost/unordered/unordered_flat_set.hpp>
#include <boost/unordered/unordered_node_set.hpp>
#else
#include <boost/unordered_set.hpp>
#endif

UNORDERED_AUTO_TEST (use_fwd_declared_trait) {
  int_set x;
  BOOST_TEST(sizeof(is_unordered_set_impl(&x)) == sizeof(true_type));
  BOOST_TEST(sizeof(is_unordered_set_impl((int*)0)) == sizeof(false_type));
}

#ifdef BOOST_UNORDERED_FOA_TESTS
UNORDERED_AUTO_TEST (use_node_fwd_declared_trait) {
  int_node_set x;
  BOOST_TEST(sizeof(is_unordered_set_impl(&x)) == sizeof(true_type));
  BOOST_TEST(sizeof(is_unordered_set_impl((int*)0)) == sizeof(false_type));
}
#endif

UNORDERED_AUTO_TEST (use_set_fwd_declared_function) {
  int_set x, y;
  x.insert(1);
  y.insert(2);
  call_swap(x, y);

  BOOST_TEST(y.find(1) != y.end());
  BOOST_TEST(y.find(2) == y.end());

  BOOST_TEST(x.find(1) == x.end());
  BOOST_TEST(x.find(2) != x.end());

  BOOST_TEST(!call_equals(x, y));
  BOOST_TEST(call_not_equals(x, y));
}

#ifdef BOOST_UNORDERED_FOA_TESTS
UNORDERED_AUTO_TEST (use_node_set_fwd_declared_function) {
  int_node_set x, y;
  x.insert(1);
  y.insert(2);
  call_swap(x, y);

  BOOST_TEST(y.find(1) != y.end());
  BOOST_TEST(y.find(2) == y.end());

  BOOST_TEST(x.find(1) == x.end());
  BOOST_TEST(x.find(2) != x.end());

  BOOST_TEST(!call_equals(x, y));
  BOOST_TEST(call_not_equals(x, y));
}
#endif

#ifndef BOOST_UNORDERED_FOA_TESTS
UNORDERED_AUTO_TEST (use_multiset_fwd_declared_function) {
  int_multiset x, y;
  call_swap(x, y);
  BOOST_TEST(call_equals(x, y));
  BOOST_TEST(!call_not_equals(x, y));
}
#endif

RUN_TESTS()