dlstack.cpp

来自「一本全面剖析C++数据结构算法的书籍」· C++ 代码 · 共 29 行

// test derived linked stack
#include <iostream.h>
#include "dlstack.h"

void main(void)
{
   int x;
   LinkedStack<int> S;
   try {S.Add(1).Add(2).Add(3).Add(4);}
   catch (NoMem) {
      cout << "Could not complete additions" << endl;
      }
   cout << "Stack should be 1234" << endl;
   cout << "Stack top is " << S.Top() << endl;
   try {
      S.Delete(x);
      cout << "Deleted " << x << endl;
      S.Delete(x);
      cout << "Deleted " << x << endl;
      S.Delete(x);
      cout << "Deleted " << x << endl;
      S.Delete(x);
      cout << "Deleted " << x << endl;
      }
   catch (OutOfBounds) {
      cout << "Last delete failed " << endl;
      }
}