-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathslice.h
More file actions
197 lines (159 loc) · 5.09 KB
/
slice.h
File metadata and controls
197 lines (159 loc) · 5.09 KB
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
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
/*
* Chris Welshman 2014
*/
#ifndef INCLUDED_SLICE
#define INCLUDED_SLICE
#include <iterator>
#include <stdint.h>
template<typename Iterator>
struct step_iterator {
typedef typename std::iterator_traits<Iterator>::value_type original_value_type;
typedef typename std::iterator_traits<Iterator>::reference original_reference;
typedef typename std::iterator_traits<Iterator>::difference_type difference_type;
typedef typename std::iterator_traits<Iterator>::iterator_category iterator_category;
typedef original_value_type value_type;
typedef original_reference reference;
typedef Iterator pointer;
typedef std::pair<Iterator,Iterator> range_type;
step_iterator() = default;
explicit step_iterator( const Iterator& it ) : it(it), step(1) {}
step_iterator( const Iterator& it, difference_type step ) : it(it), step(step) {}
reference operator*() const {
return *it;
}
pointer operator->() const {
return it;
}
step_iterator<Iterator>& operator++() {
for(difference_type i=0;i<step;++i)
++it;
return *this;
}
step_iterator<Iterator> operator++(int) {
step_iterator<Iterator> temp = *this;
++(*this);
return temp;
}
step_iterator<Iterator>& operator--() {
for(difference_type i=0;i<step;++i)
--it;
return *this;
}
step_iterator<Iterator> operator--(int) {
step_iterator<Iterator> temp = *this;
--(*this);
return temp;
}
step_iterator<Iterator>& operator+=( difference_type offset ) {
it += offset * step;
return *this;
}
step_iterator<Iterator> operator+( difference_type offset ) const {
step_iterator<Iterator> temp = *this;
return temp += offset;
}
step_iterator<Iterator>& operator-=( difference_type offset ) {
return *this += -offset;
}
step_iterator<Iterator> operator-( difference_type offset ) const {
step_iterator<Iterator> temp = *this;
return temp -= offset;
}
difference_type operator-( const step_iterator<Iterator>& rhs ) const {
return std::distance( rhs.it, it ) / step;
}
reference operator[]( difference_type offset ) const {
return *(*this + offset);
}
bool operator==( const step_iterator<Iterator>& rhs ) const {
return it == rhs.it;
}
bool operator!=( const step_iterator<Iterator>& rhs ) const {
return !(*this == rhs);
}
bool operator<( const step_iterator<Iterator>& rhs ) const {
return rhs - *this > 0;
}
bool operator>( const step_iterator<Iterator>& rhs ) const {
return rhs < *this;
}
bool operator<=( const step_iterator<Iterator>& rhs ) const {
return !( *this > rhs );
}
bool operator>=( const step_iterator<Iterator>& rhs ) const {
return !( *this < rhs );
}
protected:
difference_type step;
Iterator it;
};
template<typename Iterator>
struct slice_range {
typedef typename std::iterator_traits<Iterator>::value_type value_type;
typedef typename std::iterator_traits<Iterator>::difference_type difference_type;
typedef Iterator original_iterator;
typedef step_iterator<original_iterator> iterator;
typedef std::reverse_iterator<iterator> reverse_iterator;
typedef std::pair<Iterator,Iterator> range_type;
slice_range( const range_type& range, difference_type skip, difference_type count, difference_type step ) : range(range), skip(skip), count(count), step(step) {
difference_type N = std::distance( range.first, range.second );
count = std::min( N - skip, count );
}
slice_range( const range_type& range, difference_type skip, difference_type count ) : slice_range(range,skip,count,1) {}
slice_range( const range_type& range, difference_type count ) : slice_range(range,0,count,1) {}
iterator begin() const {
return iterator( range.first + skip, step );
}
iterator end() const {
return iterator( range.first + (skip + count), step );
}
protected:
range_type range;
difference_type skip, count, step;
};
template<typename Iterator>
inline slice_range<Iterator> slice( Iterator&& first, Iterator&& last, uint32_t skip, uint32_t count, uint32_t step ) {
return slice_range<Iterator>(
std::make_pair(
std::forward<Iterator>(first),
std::forward<Iterator>(last)
), skip, count, step
);
}
template<typename Range>
inline auto slice( Range&& r, uint32_t skip, uint32_t count, uint32_t step ) {
return slice(
begin( std::forward<Range>(r) ),
end( std::forward<Range>(r) ),
skip, count, step
);
}
template<typename Range>
inline auto cslice( const Range& r, uint32_t skip, uint32_t count, uint32_t step ) {
return slice( cbegin(r), cend(r), skip, count, step );
}
template<typename Range>
inline auto slice( Range&& r, uint32_t skip, uint32_t count ) {
return slice(
begin( std::forward<Range>(r) ),
end( std::forward<Range>(r) ),
skip, count, 1
);
}
template<typename Range>
inline auto cslice( const Range& r, uint32_t skip, uint32_t count ) {
return slice( cbegin(r), cend(r), skip, count, 1 );
}
template<typename Range>
inline auto slice( Range&& r, uint32_t count ) {
return slice(
begin( std::forward<Range>(r) ),
end( std::forward<Range>(r) ),
0, count, 1
);
}
template<typename Range>
inline auto cslice( const Range& r, uint32_t count ) {
return slice( cbegin(r), cend(r), 0, count, 1 );
}
#endif