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
|
// Copyright (C) 2004 Davis E. King (davis@dlib.net)
// License: Boost Software License See LICENSE.txt for the full license.
#ifndef DLIB_SLIDING_BUFFER_KERNEl_1_
#define DLIB_SLIDING_BUFFER_KERNEl_1_
#include "sliding_buffer_kernel_abstract.h"
#include "../algs.h"
#include "../interfaces/enumerable.h"
#include "../serialize.h"
namespace dlib
{
template <
typename T
>
class sliding_buffer_kernel_1 : public enumerable<T>
{
/*!
INITIAL VALUE
- buffer_size == 0
- buffer == 0
- buffer_start == 0
- current == 0
- at_start_ == true
CONVENTION
- buffer_size == size()
- element() == (*this)[current]
- current_element_valid() == (current < buffer_size) && at_start_ == false
- at_start() == at_start_
- if (buffer_size != 0) then
- buffer[(buffer_start+i)&(mask)] == operator[](i)
- mask == buffer_size-1
- else
- buffer == 0
- buffer_size == 0
!*/
public:
typedef T type;
sliding_buffer_kernel_1 (
) :
buffer_start(0),
buffer_size(0),
buffer(0),
current(0),
at_start_(true)
{}
virtual ~sliding_buffer_kernel_1 (
) { if (buffer) delete [] buffer; }
void clear(
)
{
buffer_size = 0;
if (buffer) delete [] buffer;
buffer = 0;
at_start_ = true;
current = 0;
}
void set_size (
unsigned long exp_size
)
{
at_start_ = true;
if (buffer) delete [] buffer;
buffer_size = 1;
while (exp_size != 0)
{
--exp_size;
buffer_size <<= 1;
}
mask = buffer_size-1;
try { buffer = new T[buffer_size]; }
catch (...) { buffer = 0; buffer_size = 0; throw; }
}
size_t size (
) const { return buffer_size; }
void rotate_left (
unsigned long amount
) { buffer_start = ((buffer_start-amount)&mask); at_start_ = true; }
void rotate_right (
unsigned long amount
) { buffer_start = ((buffer_start+amount)&mask); at_start_ = true;}
const T& operator[] (
unsigned long index
) const { return buffer[(buffer_start+index)&mask]; }
T& operator[] (
unsigned long index
) { return buffer[(buffer_start+index)&mask]; }
unsigned long get_element_id(
unsigned long index
) const { return ((buffer_start+index)&mask); }
unsigned long get_element_index (
unsigned long element_id
) const { return ((element_id-buffer_start)&mask);}
void swap (
sliding_buffer_kernel_1<T>& item
)
{
exchange(buffer_start,item.buffer_start);
exchange(buffer_size,item.buffer_size);
exchange(buffer,item.buffer);
exchange(mask,item.mask);
exchange(current,item.current);
exchange(at_start_,item.at_start_);
}
bool at_start (
) const { return at_start_; }
void reset (
) const { at_start_ = true; }
bool current_element_valid (
) const { return (current < buffer_size) && (at_start_ == false); }
const T& element (
) const { return (*this)[current]; }
T& element (
) { return (*this)[current]; }
bool move_next (
) const
{
if (at_start_ == false)
{
if (current+1 < buffer_size)
{
++current;
return true;
}
else
{
current = buffer_size;
return false;
}
}
else
{
at_start_ = false;
current = 0;
return (buffer_size != 0);
}
}
private:
// data members
unsigned long buffer_start;
unsigned long buffer_size;
T* buffer;
unsigned long mask;
mutable unsigned long current;
mutable bool at_start_;
// restricted functions
sliding_buffer_kernel_1(sliding_buffer_kernel_1<T>&); // copy constructor
sliding_buffer_kernel_1<T>& operator=(sliding_buffer_kernel_1<T>&); // assignment operator
};
template <
typename T
>
inline void swap (
sliding_buffer_kernel_1<T>& a,
sliding_buffer_kernel_1<T>& b
) { a.swap(b); }
template <
typename T
>
void deserialize (
sliding_buffer_kernel_1<T>& item,
std::istream& in
)
{
try
{
item.clear();
unsigned long size;
deserialize(size,in);
if (size > 0)
{
int count = 0;
while (size != 1)
{
size /= 2;
++count;
}
item.set_size(count);
for (unsigned long i = 0; i < item.size(); ++i)
deserialize(item[i],in);
}
}
catch (serialization_error& e)
{
item.clear();
throw serialization_error(e.info + "\n while deserializing object of type sliding_buffer_kernel_1");
}
}
}
#endif // DLIB_SLIDING_BUFFER_KERNEl_1_
|
