gstack.imp

Gambit 是一个游戏库理论软件

//
// $Source: /home/gambit/CVS/gambit/sources/base/gstack.imp,v $
// $Date: 2002/08/26 05:49:59 $
// $Revision: 1.3 $
//
// DESCRIPTION:
// Implementation of a generic stack class
//
// This file is part of Gambit
// Copyright (c) 2002, The Gambit 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.
//

#include "gstack.h"

template <class T> gStack<T>::gStack(int md) : depth(0), max_depth(md)
{
  if (md <= 0)   throw StackUnderflow();
  contents = new T[md];
}

template <class T> gStack<T>::~gStack()
{
  delete [] contents;
}

template <class T> int gStack<T>::Depth(void) const
{ return depth; }

template <class T> int gStack<T>::MaxDepth(void) const
{ return max_depth; }

template <class T> void gStack<T>::Push(T new_el)
{
  if (depth >= max_depth)
    Resize(max_depth + 10);

  contents[depth++] = new_el;
}

template <class T> T gStack<T>::Pop(void)
{
  if (depth <= 0)   throw StackUnderflow();
  return contents[--depth];
}

template <class T> T& gStack<T>::Peek(void)
{
  if (depth <= 0)   throw StackUnderflow();
  return contents[depth - 1];
}

template <class T> T gStack<T>::Peek(void) const
{
  if (depth <= 0)   throw StackUnderflow();
  return contents[depth - 1];
}

template <class T> void gStack<T>::Flush(void)
{
  depth = 0;
}

template <class T> void gStack<T>::Resize(int new_max_depth)
{
  if (new_max_depth > depth)   {
    T *new_contents = new T[new_max_depth];
    for (int i = 0; i < depth; i++)
      new_contents[i] = contents[i];
    delete [] contents;
    contents = new_contents;
    max_depth = new_max_depth;
  }
}