-
Notifications
You must be signed in to change notification settings - Fork 0
/
blind_test.cpp
116 lines (105 loc) · 2.76 KB
/
blind_test.cpp
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
#include "blind.hpp"
#include <iostream>
#include <functional>
#include <algorithm>
#include <vector>
#include <deque>
#include <string>
#include <sstream>
#include <cassert>
std::ostream& print(std::ostream& os) {
return os;
}
template<typename H, typename... Rest>
std::ostream& print(std::ostream& os, H&& h, Rest&&... rest) {
os << std::forward<H>(h);
return print(os, std::forward<Rest>(rest)...);
}
struct foo {
void operator()(int delta, int& x) const { x += delta; }
int operator()(int delta, const int& x) const { return x + delta; }
int operator()(int delta, int&& x) const { return x + delta; }
};
struct foo2 {
template<typename T> void operator()( T& x, int delta) const { x += delta; }
template<typename T> T operator()(const T& x, int delta) const { return x + delta; }
template<typename T> T operator()( T&& x, int delta) const { return x + delta; }
};
template<typename T, typename U> auto bar(const T& a, const U& b) { return a + b; }
int main(const int argc, const char** argv) {
using namespace std;
using namespace com::masaers::blind;
using namespace std::placeholders;
{
const auto f = blind(foo(), 1);
int i = 2;
int j = f(cref(i));
f(i);
assert(i == 3);
assert(j == 3);
}
{
const auto f = blind(foo2(), _1, 1);
int i = 2;
int j = f(cref(i));
f(i);
assert(i == 3);
assert(j == 3);
}
{
const auto rsort = blind(BLIND_FUNC(sort), _1, _2, [](auto&& a, auto&& b) { return a > b; });
vector<int> vec{ 1, 2, 3, 4 };
rsort(begin(vec), end(vec));
{
auto it = begin(vec);
assert(*it++ == 4);
assert(*it++ == 3);
assert(*it++ == 2);
assert(*it++ == 1);
assert(it == end(vec));
}
deque<string> dq{ "a", "b", "c", "d" };
rsort(begin(dq), end(dq));
{
auto it = begin(dq);
assert(*it++ == "d");
assert(*it++ == "c");
assert(*it++ == "b");
assert(*it++ == "a");
assert(it == end(dq));
}
}
{
ostringstream os;
const auto p = blind(BLIND_FUNC(print), ref(os));
p(1, 1.0, '1', "1") << 2;
assert(os.str() == "11112");
}
{
vector<int> vec{ 1, 2, 3, 4 };
auto sort_vec = blind(BLIND_FUNC(sort), begin(vec), end(vec));
sort_vec([](auto&& a, auto&& b) { return a > b; });
{
auto it = begin(vec);
assert(*it++ == 4);
assert(*it++ == 3);
assert(*it++ == 2);
assert(*it++ == 1);
assert(it == end(vec));
}
sort_vec();
{
auto it = begin(vec);
assert(*it++ == 1);
assert(*it++ == 2);
assert(*it++ == 3);
assert(*it++ == 4);
assert(it == end(vec));
}
}
{
auto f = blind(BLIND_FUNC(bar<int, int>), _1, 1);
assert(f(2) == 3);
}
return EXIT_SUCCESS;
}