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
|
#include "testing/testing.hpp"
#include "base/stl_helpers.hpp"
#include "std/algorithm.hpp"
#include "std/deque.hpp"
#include "std/utility.hpp"
#include "std/vector.hpp"
namespace
{
class Int
{
public:
explicit Int(int v) : m_v(v) {}
inline int Get() const { return m_v; }
private:
int m_v;
};
template <template <typename...> class Cont>
void TestSortUnique()
{
{
Cont<int> actual = {1, 2, 1, 4, 3, 5, 2, 7, 1};
my::SortUnique(actual);
Cont<int> const expected = {1, 2, 3, 4, 5, 7};
TEST_EQUAL(actual, expected, ());
}
{
using Value = int;
using Pair = pair<Value, int>;
Cont<Pair> d =
{{1, 22}, {2, 33}, {1, 23}, {4, 54}, {3, 34}, {5, 23}, {2, 23}, {7, 32}, {1, 12}};
my::SortUnique(d, my::LessBy(&Pair::first), my::EqualsBy(&Pair::first));
Cont<Value> const expected = {1, 2, 3, 4, 5, 7};
TEST_EQUAL(d.size(), expected.size(), ());
for (size_t i = 0; i < d.size(); ++i)
TEST_EQUAL(d[i].first, expected[i], (i));
}
{
using Value = double;
using Pair = pair<Value, int>;
Cont<Pair> d =
{{0.5, 11}, {1000.99, 234}, {0.5, 23}, {1234.56789, 54}, {1000.99, 34}};
my::SortUnique(d, my::LessBy(&Pair::first), my::EqualsBy(&Pair::first));
Cont<Value> const expected = {0.5, 1000.99, 1234.56789};
TEST_EQUAL(d.size(), expected.size(), ());
for (size_t i = 0; i < d.size(); ++i)
TEST_EQUAL(d[i].first, expected[i], (i));
}
}
template <template <typename...> class Cont>
void TestEqualsBy()
{
{
using Value = pair<int, int>;
Cont<Value> actual = {{1, 2}, {1, 3}, {2, 100}, {3, 7}, {3, 8}, {2, 500}};
actual.erase(unique(actual.begin(), actual.end(), my::EqualsBy(&Value::first)), actual.end());
Cont<int> const expected = {{1, 2, 3, 2}};
TEST_EQUAL(expected.size(), actual.size(), ());
for (size_t i = 0; i < actual.size(); ++i)
TEST_EQUAL(expected[i], actual[i].first, ());
}
{
Cont<Int> actual;
for (auto const v : {0, 0, 1, 2, 2, 0})
actual.emplace_back(v);
actual.erase(unique(actual.begin(), actual.end(), my::EqualsBy(&Int::Get)), actual.end());
Cont<int> const expected = {{0, 1, 2, 0}};
TEST_EQUAL(expected.size(), actual.size(), ());
for (size_t i = 0; i < actual.size(); ++i)
TEST_EQUAL(expected[i], actual[i].Get(), ());
}
}
UNIT_TEST(LessBy)
{
{
using Value = pair<int, int>;
vector<Value> v = {{2, 2}, {0, 4}, {3, 1}, {4, 0}, {1, 3}};
sort(v.begin(), v.end(), my::LessBy(&Value::first));
for (size_t i = 0; i < v.size(); ++i)
TEST_EQUAL(i, v[i].first, ());
vector<Value const *> pv;
for (auto const & p : v)
pv.push_back(&p);
sort(pv.begin(), pv.end(), my::LessBy(&Value::second));
for (size_t i = 0; i < pv.size(); ++i)
TEST_EQUAL(i, pv[i]->second, ());
}
{
vector<Int> v;
for (int i = 9; i >= 0; --i)
v.emplace_back(i);
sort(v.begin(), v.end(), my::LessBy(&Int::Get));
for (size_t i = 0; i < v.size(); ++i)
TEST_EQUAL(v[i].Get(), static_cast<int>(i), ());
}
}
UNIT_TEST(EqualsBy_VectorTest)
{
TestEqualsBy<vector>();
TestEqualsBy<deque>();
}
UNIT_TEST(SortUnique_VectorTest)
{
TestSortUnique<vector>();
TestSortUnique<deque>();
}
UNIT_TEST(IgnoreFirstArgument)
{
{
int s = 0;
auto f1 = [&](int a, int b) { s += a + b; };
auto f2 = [&](int a, int b) { s -= a + b; };
auto f3 = my::MakeIgnoreFirstArgument(f2);
f1(2, 3);
TEST_EQUAL(s, 5, ());
f3(1, 2, 3);
TEST_EQUAL(s, 0, ());
}
{
auto f1 = [](int a, int b) -> int { return a + b; };
auto f2 = my::MakeIgnoreFirstArgument(f1);
auto const x = f1(2, 3);
auto const y = f2("ignored", 2, 3);
TEST_EQUAL(x, y, ());
}
}
} // namespace
|
