stack.h

我作编译原理课程设计时写的一个图形化的小型开发环境

#ifndef _STACK_H_
#define _STACK_H_
#include <stdlib.h> // malloc

//  类link用来构造栈 
template<class t>
class ll_link  {
public:
   t      data;
   ll_link *next;
};

//  stack类 
template<class t>
class Stack  {
public:
   Stack()   {llstart = NULL; n = 0;}
   ~Stack()  {Empty();}
   void Empty();           // 清空栈
   void Push (t node);     // 项目入栈 
   t Pop ();               // 项目出栈
   inline t GetTop ()         {return llstart->data;}
   t GetNo (int e);        // 从栈中取出项目编号 
   void DoForAll(void (*process) (t));
   void DoForAllArg(void (*process) (t, void *), void *arg);
   inline int  Len ()         {return n;}
   inline bool IsEmpty ()     {return n==0;}
   friend inline void operator << (Stack<t> &stack, t node);   // =Push
   friend inline t operator << (t &node, Stack<t> &stack);              // =Pop
private:
   ll_link<t> *llstart;    // Start link (last in)
   int n;                  // Number of links
};

template<class t>
void Stack<t>::Empty ()  {
   ll_link<t> *search, *del;

   search = llstart;
   while (search != NULL)    {
      del = search;
      search = search->next;
      delete del;
   }
   llstart = NULL; n = 0;
}

template<class t>
void Stack<t>::DoForAll (void (*process) (t))  {
   ll_link<t> *search;

   search = llstart;
   while (search != NULL)    {
      process (search->data);
      search = search->next;
   }
}

template<class t>
void Stack<t>::DoForAllArg (void (*process) (t, void *), void *arg)  {
   ll_link<t> *search;

   search = llstart;///
   while (search != NULL)    {
      process (search->data, arg);
      search = search->next;
   }
}

template<class t>
t Stack<t>::Pop ()   {
   t rv; ll_link<t> *del;
   rv = llstart->data;
   del = llstart;
   llstart = llstart->next; n--;
   delete del;
   return rv;
}

template <class t>
inline void operator <<(Stack<t> &stack, t node)  
{
   stack.Push(node);
}

template <class t>
inline void operator <<(t &node, Stack<t> &stack)
{
   node=stack.Pop();
}

template<class t>
t Stack<t>::GetNo (int e)  {
   int i;
   ll_link<t> *link;

   link = llstart;
   i = n - e - 1;
   while (i > 0)   {link = link->next; i--;}
   return link->data;
}

template<class t>
void Stack<t>::Push (t node)   {
   ll_link<t> *newlink;

   newlink = (ll_link<t> *)malloc (sizeof (ll_link<t>));
   newlink->data  = node;
   newlink->next  = llstart;
   llstart        = newlink;
   n++;
}


#endif