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
|
/* ScummVM - Scumm Interpreter
* Copyright (C) 2002-2006 The ScummVM project
*
* 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 <assert.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;
}
T top() const {
if (_size > 0)
return _stack[_size - 1];
else
return 0;
}
T pop() {
T tmp;
assert(_size > 0);
tmp = _stack[_size - 1];
_stack[--_size] = 0;
return tmp;
}
int size() const {
return _size;
}
T operator [](int i) {
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>() {}
bool empty() const {
return _stack.isEmpty();
}
void clear() {
_stack.clear();
}
void push(const T& x) {
_stack.push_back(x);
}
T top() const {
const int s = size();
if (s > 0)
return _stack[s - 1];
else
return 0;
}
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];
}
};
} // End of namespace Common
#endif
|
