blob: b55f235ededcbc48fe34eeb18e610f8c4ceac2fc (
plain)
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
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
|
#ifndef __RANGE_H
#define __RANGE_H
/*
Group: Range concepts
*/
/*
Concept: concept_empty
template<class T>
struct range
{
bool empty() const;
};
*/
struct concept_empty
{
template<typename T> static void check(T &t) { if(0) t.empty(); };
};
/*
Concept: concept_index
template<class T>
struct range
{
T &index(size_t);
};
*/
struct concept_index
{
template<typename T> static void check(T &t) { if(0) t.index(0); };
};
/*
Concept: concept_size
template<class T>
struct range
{
size_t size();
};
*/
struct concept_size
{
template<typename T> static void check(T &t) { if(0) t.size(); };
};
/*
Concept: concept_slice
template<class T>
struct range
{
range slice(size_t start, size_t count);
};
*/
struct concept_slice
{
template<typename T> static void check(T &t) { if(0) t.slice(0, 0); };
};
/*
Concept: concept_sorted
template<class T>
struct range
{
void sorted();
};
*/
struct concept_sorted
{
template<typename T> static void check(T &t) { if(0) t.sorted(); };
};
/*
Concept: concept_forwarditeration
Checks for the front and pop_front methods
template<class T>
struct range
{
void pop_front();
T &front() const;
};
*/
struct concept_forwarditeration
{
template<typename T> static void check(T &t) { if(0) { t.front(); t.pop_front(); } };
};
/*
Concept: concept_backwarditeration
Checks for the back and pop_back methods
template<class T>
struct range
{
void pop_back();
T &back() const;
};
*/
struct concept_backwarditeration
{
template<typename T> static void check(T &t) { if(0) { t.back(); t.pop_back(); } };
};
/*
Group: Range classes
*/
/*
Class: plain_range
Concepts:
<concept_empty>
<concept_index>
<concept_slice>
<concept_forwardinteration>
<concept_backwardinteration>
*/
template<class T>
class plain_range
{
public:
typedef T type;
plain_range()
{
begin = 0x0;
end = 0x0;
}
plain_range(const plain_range &r)
{
*this = r;
}
plain_range(T *b, T *e)
{
begin = b;
end = e;
}
bool empty() const { return begin >= end; }
void pop_front() { assert(!empty()); begin++; }
void pop_back() { assert(!empty()); end--; }
T& front() { assert(!empty()); return *begin; }
T& back() { assert(!empty()); return *(end-1); }
T& index(unsigned i) { assert(i >= 0 && i < (unsigned)(end-begin)); return begin[i]; }
unsigned size() const { return (unsigned)(end-begin); }
plain_range slice(unsigned startindex, unsigned endindex)
{
return plain_range(begin+startindex, begin+endindex);
}
protected:
T *begin;
T *end;
};
/*
Class: plain_range_sorted
Concepts:
Same as <plain_range> but with these additions:
<concept_sorted>
*/
template<class T>
class plain_range_sorted : public plain_range<T>
{
typedef plain_range<T> parent;
public:
/* sorted concept */
void sorted() const { }
plain_range_sorted()
{}
plain_range_sorted(const plain_range_sorted &r)
{
*this = r;
}
plain_range_sorted(T *b, T *e)
: parent(b, e)
{}
plain_range_sorted slice(unsigned start, unsigned count)
{
return plain_range_sorted(parent::begin+start, parent::begin+start+count);
}
};
template<class R>
class reverse_range
{
private:
reverse_range() {}
public:
typedef typename R::type type;
reverse_range(R r)
{
range = r;
}
reverse_range(const reverse_range &other) { range = other.range; }
bool empty() const { return range.empty(); }
void pop_front() { range.pop_back(); }
void pop_back() { range.pop_front(); }
type& front() { return range.back(); }
type& back() { return range.front(); }
R range;
};
template<class R> reverse_range<R> reverse(R range) {
return reverse_range<R>(range);
}
template<class R> R reverse(reverse_range<R> range) {
return range.range;
}
#endif
|