lqueue.cpp

来自「data struct algorithm and application in」· C++ 代码 · 共 31 行

// test linked queue class

#include <iostream.h>
#include "lqueue.h"

void main(void)
{
   LinkedQueue<int> Q;
   int x;
   try {Q.Add(1).Add(2).Add(3).Add(4);
        cout << "No queue add failed" << endl;}
   catch (NoMem)
      {cout << "A queue add failed" << endl;}
   cout << "Queue is now 1234" << endl;
   Q.Delete(x);
   cout << "Deleted " << x << endl;
   cout << Q.First() << " is at front" << endl;
   cout << Q.Last() << " is at end" << endl;
   try {
      Q.Delete(x);
      cout << "Deleted " << x << endl;
      Q.Delete(x);
      cout << "Deleted " << x << endl;
      Q.Delete(x);
      cout << "Deleted " << x << endl;
      cout << "No queue delete failed " << endl;
      }
   catch (OutOfBounds)
      {cout << "A delete has failed" << endl;}
}