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
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
|
// Copyright (C) 2003 Davis E. King (davis@dlib.net)
// License: Boost Software License See LICENSE.txt for the full license.
#ifndef DLIB_SEQUENCE_KERNEl_C_
#define DLIB_SEQUENCE_KERNEl_C_
#include "sequence_kernel_abstract.h"
#include "../algs.h"
#include "../assert.h"
namespace dlib
{
template <
typename seq_base
>
class sequence_kernel_c : public seq_base
{
typedef typename seq_base::type T;
public:
void add (
unsigned long pos,
T& item
);
void remove (
unsigned long pos,
T& item
);
const T& operator[] (
unsigned long pos
) const;
T& operator[] (
unsigned long pos
);
void cat (
sequence_kernel_c& item
);
const T& element (
) const;
T& element (
);
void remove_any (
T& item
);
};
template <
typename seq_base
>
inline void swap (
sequence_kernel_c<seq_base>& a,
sequence_kernel_c<seq_base>& b
) { a.swap(b); }
// ----------------------------------------------------------------------------------------
// ----------------------------------------------------------------------------------------
// member function definitions
// ----------------------------------------------------------------------------------------
// ----------------------------------------------------------------------------------------
template <
typename seq_base
>
void sequence_kernel_c<seq_base>::
add(
unsigned long pos,
T& item
)
{
// make sure requires clause is not broken
DLIB_CASSERT(( pos <= this->size() ),
"\tvoid sequence::add"
<< "\n\tpos must be >= 0 and <= size()"
<< "\n\tpos: " << pos
<< "\n\tsize(): " << this->size()
<< "\n\tthis: " << this
);
// call the real function
seq_base::add(pos,item);
}
// ----------------------------------------------------------------------------------------
template <
typename seq_base
>
void sequence_kernel_c<seq_base>::
cat (
sequence_kernel_c<seq_base>& item
)
{
// make sure requires clause is not broken
DLIB_CASSERT(&item != this,
"\tvoid sequence::cat"
<< "\n\tyou can't concatenate a sequence onto itself"
<< "\n\t&item: " << &item
<< "\n\tthis: " << this
);
// call the real function
seq_base::cat(item);
}
// ----------------------------------------------------------------------------------------
template <
typename seq_base
>
void sequence_kernel_c<seq_base>::
remove (
unsigned long pos,
T& item
)
{
// make sure requires clause is not broken
DLIB_CASSERT(( pos < this->size() ),
"\tvoid sequence::remove"
<< "\n\tpos must be >= 0 and < size()"
<< "\n\tpos: " << pos
<< "\n\tsize(): " << this->size()
<< "\n\tthis: " << this
);
// call the real function
seq_base::remove(pos,item);
}
// ----------------------------------------------------------------------------------------
template <
typename seq_base
>
const typename seq_base::type& sequence_kernel_c<seq_base>::
operator[] (
unsigned long pos
) const
{
// make sure requires clause is not broken
DLIB_CASSERT(( pos < this->size() ),
"\tconst T& sequence::operator[]"
<< "\n\tpos must be >= 0 and < size()"
<< "\n\tpos: " << pos
<< "\n\tsize(): " << this->size()
<< "\n\tthis: " << this
);
// call the real function
return seq_base::operator[](pos);
}
// ----------------------------------------------------------------------------------------
template <
typename seq_base
>
typename seq_base::type& sequence_kernel_c<seq_base>::
operator[] (
unsigned long pos
)
{
// make sure requires clause is not broken
DLIB_CASSERT(( pos < this->size() ),
"\tT& sequence::operator[]"
<< "\n\tpos must be >= 0 and < size()"
<< "\n\tpos: " << pos
<< "\n\tsize(): " << this->size()
<< "\n\tthis: " << this
);
// call the real function
return seq_base::operator[](pos);
}
// ----------------------------------------------------------------------------------------
template <
typename seq_base
>
const typename seq_base::type& sequence_kernel_c<seq_base>::
element (
) const
{
DLIB_CASSERT(this->current_element_valid() == true,
"\tconst T& sequence::element() const"
<< "\n\tyou can't access the current element if it doesn't exist"
<< "\n\tthis: " << this
);
return seq_base::element();
}
// ----------------------------------------------------------------------------------------
template <
typename seq_base
>
typename seq_base::type& sequence_kernel_c<seq_base>::
element (
)
{
DLIB_CASSERT(this->current_element_valid() == true,
"\tT& sequence::element()"
<< "\n\tyou can't access the current element if it doesn't exist"
<< "\n\tthis: " << this
);
return seq_base::element();
}
// ----------------------------------------------------------------------------------------
template <
typename seq_base
>
void sequence_kernel_c<seq_base>::
remove_any (
T& item
)
{
// make sure requires clause is not broken
DLIB_CASSERT( (this->size() > 0),
"\tvoid sequence::remove_any"
<< "\n\tsize() must be greater than zero if something is going to be removed"
<< "\n\tsize(): " << this->size()
<< "\n\tthis: " << this
);
// call the real function
seq_base::remove_any(item);
}
// ----------------------------------------------------------------------------------------
}
#endif // DLIB_SEQUENCE_KERNEl_C_
|
