// File: HQtest1.cpp
//
// Testing a heterogeneous FIFO queue

#include <iostream>
#include "HQueue.h"
#include "IntNode.h"
#include "StringNode.h"
#include "DoubleNode.h"

using namespace std ;

int main() {
   HQueue Q ;

   Q.enqueue(new IntNode(1)) ;
   Q.enqueue(new StringNode("one")) ;
   Q.enqueue(new DoubleNode(1.5)) ;
   Q.enqueue(new IntNode(2)) ;
   Q.enqueue(new StringNode("two")) ;
   Q.enqueue(new DoubleNode(2.5)) ;
   Q.enqueue(new IntNode(3)) ;
   Q.enqueue(new StringNode("three")) ;
   Q.enqueue(new DoubleNode(3.5)) ;
   Q.enqueue(new IntNode(4)) ;
   Q.enqueue(new StringNode("four")) ;
   Q.enqueue(new DoubleNode(4.5)) ;
   Q.enqueue(new IntNode(5)) ;
   Q.enqueue(new StringNode("five")) ;
   Q.enqueue(new DoubleNode(5.5)) ;

   cout << "Queue Q: " << Q << "\n" ;
   cout << "   size = " << Q.size() << "\n" ;

   Q.dequeue() ;
   Q.dequeue() ;
   Q.dequeue() ;
   cout << "Top of the stack: " ;
   Q.front()->print() ; cout << "\n" ;

   cout << "Queue Q: " << Q << "\n" ;
   cout << "   size = " << Q.size() << "\n" ;
}