blob: cb29c590584b866182f1cf969e17c36eb209795d (
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
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
* $URL$
* $Id$
*/
#ifndef COMMON_QUEUE_H
#define COMMON_QUEUE_H
#include "common/scummsys.h"
#include "common/list.h"
namespace Common {
/**
* Variable size Queue class, implemented using our Array class.
*/
template<class T>
class Queue {
protected:
List<T> _queue;
public:
Queue<T>() {}
Queue<T>(const List<T> &queueContent) : _queue(queueContent) {}
bool empty() const {
return _queue.empty();
}
void clear() {
_queue.clear();
}
void push(const T &x) {
_queue.push_back(x);
}
T back() const {
return _queue.reverse_begin().operator*();
}
T front() const {
return _queue.begin().operator*();
}
T pop() {
T tmp = front();
_queue.pop_front();
return tmp;
}
int size() const {
return _queue.size();
}
};
} // End of namespace Common
#endif
|