forked from ryanhaining/cppitertools
-
Notifications
You must be signed in to change notification settings - Fork 0
/
filter.hpp
142 lines (116 loc) · 3.4 KB
/
filter.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
133
134
135
136
137
138
139
140
141
142
#ifndef ITER_FILTER_H_
#define ITER_FILTER_H_
#include "internal/iterator_wrapper.hpp"
#include "internal/iterbase.hpp"
#include <functional>
#include <initializer_list>
#include <iterator>
#include <utility>
namespace iter {
namespace impl {
template <typename FilterFunc, typename Container>
class Filtered;
struct BoolTester {
template <typename T>
constexpr bool operator()(const T& item_) const {
return bool(item_);
}
};
using FilterFn = IterToolFnOptionalBindFirst<Filtered, BoolTester>;
}
constexpr impl::FilterFn filter{};
}
template <typename FilterFunc, typename Container>
class iter::impl::Filtered {
private:
Container container_;
mutable FilterFunc filter_func_;
friend FilterFn;
protected:
// Value constructor for use only in the filter function
Filtered(FilterFunc filter_func, Container&& container)
: container_(std::forward<Container>(container)),
filter_func_(filter_func) {}
public:
Filtered(Filtered&&) = default;
template <typename ContainerT>
class Iterator {
private:
template <typename>
friend class Iterator;
using Holder = DerefHolder<iterator_deref<ContainerT>>;
IteratorWrapper<ContainerT> sub_iter_;
IteratorWrapper<ContainerT> sub_end_;
Holder item_;
FilterFunc* filter_func_;
void inc_sub_iter() {
++sub_iter_;
if (sub_iter_ != sub_end_) {
item_.reset(*sub_iter_);
}
}
// increment until the iterator points to is true on the
// predicate. Called by constructor and operator++
void skip_failures() {
while (
sub_iter_ != sub_end_ && !std::invoke(*filter_func_, item_.get())) {
inc_sub_iter();
}
}
public:
using iterator_category = std::input_iterator_tag;
using value_type = iterator_traits_deref<ContainerT>;
using difference_type = std::ptrdiff_t;
using pointer = value_type*;
using reference = value_type&;
Iterator(IteratorWrapper<ContainerT>&& sub_iter,
IteratorWrapper<ContainerT>&& sub_end, FilterFunc& filter_func)
: sub_iter_{std::move(sub_iter)},
sub_end_{std::move(sub_end)},
filter_func_(&filter_func) {
if (sub_iter_ != sub_end_) {
item_.reset(*sub_iter_);
}
skip_failures();
}
typename Holder::reference operator*() {
return item_.get();
}
typename Holder::pointer operator->() {
return item_.get_ptr();
}
Iterator& operator++() {
inc_sub_iter();
skip_failures();
return *this;
}
Iterator operator++(int) {
auto ret = *this;
++*this;
return ret;
}
template <typename T>
bool operator!=(const Iterator<T>& other) const {
return sub_iter_ != other.sub_iter_;
}
template <typename T>
bool operator==(const Iterator<T>& other) const {
return !(*this != other);
}
};
Iterator<Container> begin() {
return {get_begin(container_), get_end(container_), filter_func_};
}
Iterator<Container> end() {
return {get_end(container_), get_end(container_), filter_func_};
}
Iterator<AsConst<Container>> begin() const {
return {get_begin(std::as_const(container_)),
get_end(std::as_const(container_)), filter_func_};
}
Iterator<AsConst<Container>> end() const {
return {get_end(std::as_const(container_)),
get_end(std::as_const(container_)), filter_func_};
}
};
#endif