forked from ryanhaining/cppitertools
-
Notifications
You must be signed in to change notification settings - Fork 0
/
sliding_window.hpp
126 lines (105 loc) · 3.33 KB
/
sliding_window.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
#ifndef ITER_SLIDING_WINDOW_HPP_
#define ITER_SLIDING_WINDOW_HPP_
#include "internal/iterator_wrapper.hpp"
#include "internal/iteratoriterator.hpp"
#include "internal/iterbase.hpp"
#include <deque>
#include <iterator>
#include <memory>
#include <utility>
namespace iter {
namespace impl {
template <typename Container>
class WindowSlider;
using SlidingWindowFn = IterToolFnBindSizeTSecond<WindowSlider>;
}
constexpr impl::SlidingWindowFn sliding_window{};
}
template <typename Container>
class iter::impl::WindowSlider {
private:
Container container_;
std::size_t window_size_;
friend SlidingWindowFn;
WindowSlider(Container&& container, std::size_t win_sz)
: container_(std::forward<Container>(container)), window_size_{win_sz} {}
template <typename T>
using IndexVector = std::deque<IteratorWrapper<T>>;
template <typename T>
using DerefVec = IterIterWrapper<IndexVector<T>>;
public:
WindowSlider(WindowSlider&&) = default;
template <typename ContainerT>
class Iterator {
private:
template <typename>
friend class Iterator;
std::shared_ptr<DerefVec<ContainerT>> window_ =
std::make_shared<DerefVec<ContainerT>>();
IteratorWrapper<ContainerT> sub_iter_;
public:
using iterator_category = std::input_iterator_tag;
using value_type = DerefVec<ContainerT>;
using difference_type = std::ptrdiff_t;
using pointer = value_type*;
using reference = value_type&;
Iterator(IteratorWrapper<ContainerT>&& sub_iter,
IteratorWrapper<ContainerT>&& sub_end, std::size_t window_sz)
: sub_iter_(std::move(sub_iter)) {
std::size_t i{0};
while (i < window_sz && sub_iter_ != sub_end) {
window_->get().push_back(sub_iter_);
++i;
if (i != window_sz) {
++sub_iter_;
}
}
}
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);
}
DerefVec<ContainerT>& operator*() {
return *window_;
}
DerefVec<ContainerT>* operator->() {
return window_.get();
}
Iterator& operator++() {
++sub_iter_;
window_->get().pop_front();
window_->get().push_back(sub_iter_);
return *this;
}
Iterator operator++(int) {
auto ret = *this;
++*this;
return ret;
}
};
Iterator<Container> begin() {
return {
(window_size_ != 0 ? IteratorWrapper<Container>{get_begin(container_)}
: IteratorWrapper<Container>{get_end(container_)}),
get_end(container_), window_size_};
}
Iterator<Container> end() {
return {get_end(container_), get_end(container_), window_size_};
}
Iterator<AsConst<Container>> begin() const {
return {(window_size_ != 0 ? IteratorWrapper<AsConst<Container>>{get_begin(
std::as_const(container_))}
: IteratorWrapper<AsConst<Container>>{get_end(
std::as_const(container_))}),
get_end(std::as_const(container_)), window_size_};
}
Iterator<AsConst<Container>> end() const {
return {get_end(std::as_const(container_)),
get_end(std::as_const(container_)), window_size_};
}
};
#endif