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
|
/* 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_STACK_H
#define COMMON_STACK_H
#include "common/scummsys.h"
#include "common/array.h"
namespace Common {
/**
* Extremly simple fixed size stack class.
*/
template<class T, int MAX_SIZE = 10>
class FixedStack {
protected:
T _stack[MAX_SIZE];
int _size;
public:
FixedStack<T, MAX_SIZE>() : _size(0) {}
bool empty() const {
return _size <= 0;
}
void clear() {
_size = 0;
}
void push(const T &x) {
assert(_size < MAX_SIZE);
_stack[_size++] = x;
}
const T &top() const {
assert(_size > 0);
return _stack[_size - 1];
}
T &top() {
assert(_size > 0);
return _stack[_size - 1];
}
T pop() {
T tmp = top();
--_size;
return tmp;
}
int size() const {
return _size;
}
T &operator[](int i) {
assert(0 <= i && i < MAX_SIZE);
return _stack[i];
}
const T &operator[](int i) const {
assert(0 <= i && i < MAX_SIZE);
return _stack[i];
}
};
/**
* Variable size stack class, implemented using our Array class.
*/
template<class T>
class Stack {
protected:
Array<T> _stack;
public:
Stack<T>() {}
Stack<T>(const Array<T> &stackContent) : _stack(stackContent) {}
Stack<T>& operator=(const Stack<T> &st) {
_stack = st._stack;
return *this;
}
bool empty() const {
return _stack.empty();
}
void clear() {
_stack.clear();
}
void push(const T &x) {
_stack.push_back(x);
}
T &top() {
const int s = size();
return _stack[s - 1];
}
const T &top() const {
const int s = size();
return _stack[s - 1];
}
T pop() {
T tmp = top();
_stack.remove_at(size() - 1);
return tmp;
}
int size() const {
return _stack.size();
}
T &operator[](int i) {
return _stack[i];
}
const T &operator[](int i) const {
return _stack[i];
}
};
} // End of namespace Common
#endif
|
