-
Notifications
You must be signed in to change notification settings - Fork 85
Expand file tree
/
Copy patherase_if.cpp
More file actions
150 lines (119 loc) · 3.54 KB
/
erase_if.cpp
File metadata and controls
150 lines (119 loc) · 3.54 KB
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
// Copyright 2021-2022 Christian Mazakas.
// Copyright 2025 Joaquin M Lopez Munoz.
// 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)
#include "../helpers/unordered.hpp"
#include "../helpers/test.hpp"
#include <boost/config.hpp>
#include <string>
#define UNORDERED_LVALUE_QUAL &
namespace test {
struct is_even
{
bool operator()(std::pair<std::string const, int>& key_value)
{
int const v = key_value.second;
return (v % 2 == 0);
}
bool operator()(int const& value)
{
int const v = value;
return (v % 2 == 0);
}
};
struct is_too_large
{
bool operator()(std::pair<std::string const, int>& key_value)
{
int const v = key_value.second;
return v >= 1000;
}
bool operator()(int const& value)
{
int const v = value;
return v >= 1000;
}
};
template <class T>
struct non_const_pred;
template<class T, class U>
struct non_const_pred<std::pair<const T, U> >
{
bool operator()(std::pair<const T, U>& x) const
{
U u = std::move(x.second);
(void)u;
return true;
}
};
} // namespace test
template <class UnorderedMap> void test_map_nonconst_erase_if()
{
typedef UnorderedMap map_type;
typedef typename map_type::value_type value_type;
typedef typename map_type::size_type size_type;
map_type m;
m.insert(value_type());
size_type num_erased = erase_if(m, test::non_const_pred<value_type>());
BOOST_TEST(m.empty());
BOOST_TEST_EQ(num_erased, 1u);
}
template <class UnorderedMap> void test_map_erase_if()
{
typedef UnorderedMap map_type;
typedef typename map_type::size_type size_type;
map_type map;
size_type num_erased = erase_if(map, test::is_even());
BOOST_TEST(map.empty());
BOOST_TEST_EQ(num_erased, 0u);
map.emplace("a", 1);
map.emplace("b", 2);
map.emplace("b", 4);
map.emplace("b", 8);
map.emplace("b", 16);
map.emplace("c", 3);
size_type size = map.size();
num_erased = erase_if(map, test::is_too_large());
BOOST_TEST_EQ(map.size(), size);
BOOST_TEST_EQ(num_erased, 0u);
num_erased = erase_if(map, test::is_even());
BOOST_TEST_EQ(map.size(), 2u);
BOOST_TEST_EQ(num_erased, size - map.size());
test_map_nonconst_erase_if<map_type>();
}
template <class UnorderedSet> void test_set_erase_if()
{
typedef UnorderedSet set_type;
typedef typename set_type::size_type size_type;
set_type set;
size_type num_erased = erase_if(set, test::is_even());
BOOST_TEST(set.empty());
BOOST_TEST_EQ(num_erased, 0u);
set.emplace(1);
set.emplace(2);
set.emplace(2);
set.emplace(2);
set.emplace(2);
set.emplace(3);
size_type size = set.size();
num_erased = erase_if(set, test::is_too_large());
BOOST_TEST_EQ(set.size(), size);
BOOST_TEST_EQ(num_erased, 0u);
num_erased = erase_if(set, test::is_even());
BOOST_TEST_EQ(set.size(), 2u);
BOOST_TEST_EQ(num_erased, size - set.size());
}
UNORDERED_AUTO_TEST (unordered_erase_if) {
#ifdef BOOST_UNORDERED_FOA_TESTS
test_map_erase_if<boost::unordered_flat_map<std::string, int> >();
test_set_erase_if<boost::unordered_flat_set<int> >();
test_map_erase_if<boost::unordered_node_map<std::string, int> >();
test_set_erase_if<boost::unordered_node_set<int> >();
#else
test_map_erase_if<boost::unordered_map<std::string, int> >();
test_map_erase_if<boost::unordered_multimap<std::string, int> >();
test_set_erase_if<boost::unordered_set<int> >();
test_set_erase_if<boost::unordered_multiset<int> >();
#endif
}
RUN_TESTS()