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
|
// Copyright (C) 2003 Davis E. King (davis@dlib.net)
// License: Boost Software License See LICENSE.txt for the full license.
#ifndef DLIB_QUEUE_KERNEl_C_
#define DLIB_QUEUE_KERNEl_C_
#include "queue_kernel_abstract.h"
#include "../algs.h"
#include "../assert.h"
namespace dlib
{
template <
typename queue_base // is an implementation of queue_kernel_abstract.h
>
class queue_kernel_c : public queue_base
{
typedef typename queue_base::type T;
public:
void dequeue (
T& item
);
T& current (
);
const T& current (
) const;
const T& element (
) const;
T& element (
);
void remove_any (
T& item
);
};
template <
typename queue_base
>
inline void swap (
queue_kernel_c<queue_base>& a,
queue_kernel_c<queue_base>& b
) { a.swap(b); }
// ----------------------------------------------------------------------------------------
// ----------------------------------------------------------------------------------------
// member function definitions
// ----------------------------------------------------------------------------------------
// ----------------------------------------------------------------------------------------
template <
typename queue_base
>
void queue_kernel_c<queue_base>::
dequeue (
T& item
)
{
// make sure requires clause is not broken
DLIB_CASSERT(this->size() != 0,
"\tvoid queue::dequeue"
<< "\n\tsize of queue should not be zero"
<< "\n\tthis: " << this
);
// call the real function
queue_base::dequeue(item);
}
// ----------------------------------------------------------------------------------------
template <
typename queue_base
>
const typename queue_base::type& queue_kernel_c<queue_base>::
current (
) const
{
// make sure requires clause is not broken
DLIB_CASSERT(this->size() != 0,
"\tconst T& queue::current"
<< "\n\tsize of queue should not be zero"
<< "\n\tthis: " << this
);
// call the real function
return queue_base::current();
}
// ----------------------------------------------------------------------------------------
template <
typename queue_base
>
typename queue_base::type& queue_kernel_c<queue_base>::
current (
)
{
// make sure requires clause is not broken
DLIB_CASSERT(this->size() != 0,
"\tT& queue::current"
<< "\n\tsize of queue should not be zero"
<< "\n\tthis: " << this
);
// call the real function
return queue_base::current();
}
// ----------------------------------------------------------------------------------------
template <
typename queue_base
>
const typename queue_base::type& queue_kernel_c<queue_base>::
element (
) const
{
// make sure requires clause is not broken
DLIB_CASSERT(this->current_element_valid() == true,
"\tconst T& queue::element"
<< "\n\tyou can't access the current element if it doesn't exist"
<< "\n\tthis: " << this
);
// call the real function
return queue_base::element();
}
// ----------------------------------------------------------------------------------------
template <
typename queue_base
>
typename queue_base::type& queue_kernel_c<queue_base>::
element (
)
{
// make sure requires clause is not broken
DLIB_CASSERT(this->current_element_valid() == true,
"\tT& queue::element"
<< "\n\tyou can't access the current element if it doesn't exist"
<< "\n\tthis: " << this
);
// call the real function
return queue_base::element();
}
// ----------------------------------------------------------------------------------------
template <
typename queue_base
>
void queue_kernel_c<queue_base>::
remove_any (
T& item
)
{
// make sure requires clause is not broken
DLIB_CASSERT( (this->size() > 0),
"\tvoid queue::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
queue_base::remove_any(item);
}
// ----------------------------------------------------------------------------------------
}
#endif // DLIB_QUEUE_KERNEl_C_
|
