---

stack.h

Go to the documentation of this file.

/***************************************************************************
    stack.h  -  Definition of Stack template class.
                             -------------------
    begin                : June 21 2002
    copyright            : (C) 2003 by Vojtìch Toman
    email                : vtoman@lit.cz
 ***************************************************************************/

/***************************************************************************
 *                                                                         *
 *   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.                                   *
 *                                                                         *
 ***************************************************************************/

#ifndef STACK_H
#define STACK_H


#include "defs.h"
#include "collection.h"
#include "debug.h"


template<class T_> struct StackLinkedList
{
  struct StackLinkedList<T_> *prev_;
  
  T_ *data_;

}; //StackLinkedList


template<class T_> class Stack : public Collection<T_>
{
public:
  Stack(void) : Collection<T_>() { initStack(); }

  virtual ~Stack(void) { clear(); }



  virtual T_ *top(void)
  { 
    if (!topNode_)
      return 0;
    else
      {
        return topNode_->data_;
      }
  }



  virtual void push(T_ *item)
  {
    StackLinkedList<T_> *pom;

    NEW(pom, StackLinkedList<T_>);

    pom->data_ = item;

    if (!topNode_)
      pom->prev_ = 0;
    else
      pom->prev_ = topNode_;

    topNode_ = pom;

    cnt_++;
  }



  virtual T_ *pop(void)
  {
    if (!topNode_)
      return 0;
    else
      {
        StackLinkedList<T_> *pom;
        T_ *data;
        
        pom = topNode_;
        data = topNode_->data_;

        topNode_ = topNode_->prev_;

        cnt_--;

        DELETE(pom);
        return data;
      }
  }



  virtual void clear(void)
  {
    StackLinkedList<T_> *pom;

    while (topNode_)
      {
        pom = topNode_;
        topNode_ = topNode_->prev_;

        if (autoDelete_)
          DELETE(pom->data_);

        DELETE(pom);
      }

    topNode_ = 0;
    cnt_ = 0;
  }


  

protected:
  struct StackLinkedList<T_> *topNode_;

  virtual void initStack(void)
  {
    topNode_ = 0;
  }

}; //Stack


#endif //STACK_H

---