scummvm/common/stack.h

127 lines
2.5 KiB
C
Raw Normal View History

/* 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.
*/
2008-05-03 23:02:05 +00:00
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;
}
2008-05-03 23:02:05 +00:00
void push(const T &x) {
assert(_size < MAX_SIZE);
_stack[_size++] = x;
}
2008-05-03 23:02:05 +00:00
const T &top() const {
assert(_size > 0);
return _stack[_size - 1];
}
2008-05-03 23:02:05 +00:00
T &top() {
assert(_size > 0);
return _stack[_size - 1];
}
T pop() {
T tmp = top();
--_size;
return tmp;
}
int size() const {
return _size;
}
2008-05-03 23:02:05 +00:00
T &operator[](int i) {
assert(0 <= i && i < MAX_SIZE);
return _stack[i];
}
2008-05-03 23:02:05 +00:00
const T &operator[](int i) const {
assert(0 <= i && i < MAX_SIZE);
return _stack[i];
}
};
/**
* Variable size stack class, implemented using our Array class.
*/
2008-05-03 23:02:05 +00:00
template<class T>
class Stack {
private:
Array<T> _stack;
public:
Stack<T>() {}
Stack<T>(const Array<T> &stackContent) : _stack(stackContent) {}
bool empty() const {
return _stack.empty();
}
void clear() {
_stack.clear();
}
2008-05-03 23:02:05 +00:00
void push(const T &x) {
_stack.push_back(x);
}
T &top() {
return _stack.back();
}
const T &top() const {
return _stack.back();
}
T pop() {
T tmp = _stack.back();
_stack.pop_back();
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