#include "QLinkedList.h" #include #include void main() { Queue myq; int item; /* insert a little, remove a little, insert a little, ... */ for (int i = 1; i<= 3 ; i++) { cout << " inserting " << i; if (myq.insert(i)) cout << " successfully" << endl; else cout << " unsuccesful insert attempt" << endl; } myq.printQueue(); for (i = 1; i<=2; i++) { if ( myq.remove( item ) ) cout << item << " removed" << endl; else cout << "Underflow: remove failed" << endl; } myq.printQueue(); for (i = 1; i<4; i++) { cout << " inserting " << i+10; if (myq.insert(i+10)) cout << " successfully" << endl; else cout << " unsuccesful insert attempt" << endl; } myq.printQueue(); // try 2 inserts now, as the queue should be full */ for (i = 1; i<=2; i++) { cout << " inserting " << i+20; if (myq.insert(i+20)) cout << " successfully" << endl; else cout << " unsuccesful insert attempt" << endl; } myq.printQueue(); // now try removing 3 items for (i = 1; i<=3; i++) { if ( myq.remove( item ) ) cout << item << " removed" << endl; else cout << "Underflow: remove failed" << endl; } myq.printQueue(); // now try removing 3 more (should reach underflow ) for (i = 1; i<=5; i++) { if ( myq.remove( item ) ) cout << item << " removed" << endl; else cout << "Underflow: remove failed" << endl; myq.printQueue(); } }