aboutsummaryrefslogtreecommitdiff
path: root/common
diff options
context:
space:
mode:
authorMax Horn2004-03-29 22:28:57 +0000
committerMax Horn2004-03-29 22:28:57 +0000
commite8adb5e62830292eb0a3111ae985d2777ef9f492 (patch)
tree42c17753e20f3c7758086aee8977c1fa4e18d7a0 /common
parentb6d911a6164d488f1d7fd978f132de11f8d150e5 (diff)
downloadscummvm-rg350-e8adb5e62830292eb0a3111ae985d2777ef9f492.tar.gz
scummvm-rg350-e8adb5e62830292eb0a3111ae985d2777ef9f492.tar.bz2
scummvm-rg350-e8adb5e62830292eb0a3111ae985d2777ef9f492.zip
very simpled and limited stack class (fixed size even)
svn-id: r13429
Diffstat (limited to 'common')
-rw-r--r--common/stack.h68
1 files changed, 68 insertions, 0 deletions
diff --git a/common/stack.h b/common/stack.h
new file mode 100644
index 0000000000..926c61f592
--- /dev/null
+++ b/common/stack.h
@@ -0,0 +1,68 @@
+/* ScummVM - Scumm Interpreter
+ * Copyright (C) 2002-2004 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+ *
+ * $Header$
+ */
+
+#ifndef COMMON_STACK_H
+#define COMMON_STACK_H
+
+#include "common/scummsys.h"
+#include <assert.h>
+
+namespace Common {
+
+/**
+ * Extremly simple fixed size stack class.
+ */
+template <class T, int MAX_SIZE = 10>
+class Stack {
+protected:
+ T _stack[MAX_SIZE];
+ int _size;
+public:
+ Stack<T, MAX_SIZE>() : _size(0) {}
+
+ bool empty() const {
+ return _size <= 0;
+ }
+ void push(T x) {
+ assert(_size < MAX_SIZE);
+ _stack[_size++] = x;
+ }
+ T top() const {
+ if (_size > 0)
+ return _stack[_size - 1];
+ else
+ return 0;
+ }
+ void pop() {
+ assert(_size > 0);
+ _stack[--_size] = 0;
+ }
+ int size() const {
+ return _size;
+ }
+ T operator [](int i) {
+ assert(0 <= i && i < MAX_SIZE);
+ return _stack[i];
+ }
+};
+
+} // End of namespace Common
+
+#endif