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
|
/****************************************************************************
* Copyright (C) from 2009 to Present EPAM Systems.
*
* This file is part of Indigo toolkit.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
***************************************************************************/
#ifndef __queue_h__
#define __queue_h__
#include "base_c/defs.h"
#include "base_cpp/array.h"
#include "base_cpp/exception.h"
namespace indigo
{
DECL_EXCEPTION(QueueError);
// Queue with fixed max length
template <typename T> class Queue
{
public:
DECL_TPL_ERROR(QueueError);
explicit Queue(void)
{
_start = 0;
_end = 0;
}
void setLength(int max_size)
{
_array.resize(max_size);
}
void clear(void)
{
_start = 0;
_end = 0;
}
bool isEmpty(void)
{
return _start == _end;
}
T& push(const T& elem)
{
int idx = (_end + 1) % _array.size();
if (idx == _start)
throw Error("queue is full");
int end = _end;
_array[_end] = elem;
_end = idx;
return _array[end];
}
T& pop(void)
{
if (isEmpty())
throw Error("queue is empty");
int idx = _start;
_start = (_start + 1) % _array.size();
return _array[idx];
}
protected:
Array<T> _array;
int _start, _end;
private:
Queue(const Queue&); // no implicit copy
};
} // namespace indigo
#endif // __queue_h__
|
