-
Notifications
You must be signed in to change notification settings - Fork 0
/
algo_all.hpp
132 lines (101 loc) · 3.35 KB
/
algo_all.hpp
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
#include <algorithm>
#include <iostream>
#include <vector>
namespace stdext {
namespace {
template <class InputIt, class T>
inline auto
_emplace_and_step(InputIt it, InputIt end, std::vector<T> &vec) {
if (it != end) {
vec.emplace_back(*it++);
}
return it;
}
};
/*
* @brief: Finds all elements in the range [first, last) that specifies specific criteria
* @first/last: The range of elements to examine
* @value: The value to compare the elements to
* @return: An std::vector<T> of elements that equal value
*/
template <class InputIt, class T>
auto
find_all(InputIt first, InputIt last, const T &value) {
std::vector<T> vec;
while (first != last) {
first = std::find(first, last, value);
first = _emplace_and_step(first, last, vec);
}
return vec;
}
/*
* @brief: Finds all elements in a container that specifies specific criteria
* @container: Container of elements to examine
* @value: The value to compare the elements to
* @return: An std::vector<T> of elements that equal value
* Note: Container must have begin and end iterators
*/
template <class Container, class T>
auto
find_all(const Container &container, const T &value) {
return find_all(container.begin(), container.end(), value);
}
/*
* @brief: Finds all elements in the range [first, last) that specifies specific criteria
* @first/last: The range of elements to examine
* @p: The unary predicate which returns true for the required element
* @return: An std::vector<T> of elements that equal value
*/
// STD::FIND_IF
template <class InputIt, class UnaryPredicate>
auto
find_all_if(InputIt first, InputIt last, UnaryPredicate p) {
std::vector<typename InputIt::value_type> vec;
while (first != last) {
first = std::find_if(first, last, p);
first = _emplace_and_step(first, last, vec);
}
return vec;
}
/*
* @brief: Finds all elements in a container that specifies specific criteria
* @container: Container of elements to examine
* @value: The value to compare the elements to
* @return: An std::vector<T> of elements that equal value
* Note: Container must have begin and end iterators
*/
template <class Container, class UnaryPredicate>
auto
find_all_if(const Container &container, UnaryPredicate p) {
return find_all_if(container.begin(), container.end(), p);
}
/*
* @brief: Finds all elements in the range [first, last) that specifies specific criteria
* @first/last: The range of elements to examine
* @p: The unary predicate which returns true for the required element
* @return: An std::vector<T> of elements that equal value
*/
// STD::FIND_IF_NOT
template <class InputIt, class UnaryPredicate>
auto
find_all_if_not(InputIt first, InputIt last, UnaryPredicate p) {
std::vector<typename InputIt::value_type> vec;
while (first != last) {
first = std::find_if_not(first, last, p);
first = _emplace_and_step(first, last, vec);
}
return vec;
}
/*
* @brief: Finds all elements in a container that specifies specific criteria
* @container: Container of elements to examine
* @value: The value to compare the elements to
* @return: An std::vector<T> of elements that equal value
* Note: Container must have begin and end iterators
*/
template <class Container, class UnaryPredicate>
auto
find_all_if_not(const Container &container, UnaryPredicate p) {
return find_all_if_not(container.begin(), container.end(), p);
}
}; // namespace stdext