Logo Search packages:      
Sourcecode: scummvm version File versions  Download package

stack.h

/* 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: https://scummvm.svn.sourceforge.net/svnroot/scummvm/scummvm/tags/release-1-1-0/common/stack.h $
 * $Id: stack.h 40867 2009-05-24 15:17:42Z lordhoto $
 */

#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>
00037 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>
00085 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();
      }
      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

Generated by  Doxygen 1.6.0   Back to index