# include <iostream>
// #include <string> 
// #include <cmath>
// #include <cstdlib>
// #include <iomanip>
// #include <fstream>
 #include <vector>
//#include "queue_stack_old.h"
#include "queue_stack.h"

using namespace std;

// treenode* SearchTree (treenode* root, int val){
// 	
// }

int main(){
	
	// treenode* root = new treenode;
	// root->setvalue (100);
	// root->parent=NULL;
	// root->lchild=root->rchild=NULL;

	int* a1 = new int ;*a1=1;
	int* a2 = new int; *a2= 2;
	myqueue q1("queue1");

	cout<<"\nEnqueue a1, a2 into q1:\n";
	q1.enqueue(a1);
	q1.enqueue(a2);
//	cout<<"\n\nTerminating program...\n"; return 0;


	int* b1 = new int ; *b1=10;
	int* b2 = new int; *b2=20;
	int* b3 = new int; *b3=30;

	
	myqueue q2("queue2");
	cout<<"\n\nEnqueue b1, b2, b3 into q2:\n";
	q2.enqueue(b1);
	q2.enqueue(b2);
	q2.enqueue(b3);	
	cout<<"\nNow (1) we have total enqueued objects = "<<q1.get_no_objects()<<"\n";
//return 0;

	
	cout<<"\n\n\nNew queue q10=q2:\n";
	myqueue q10=q2;
	cout<<"\nNow (2) we have total enqueued objects = "<<myqueue::get_no_objects()<<"\n";
// return 0;
	
	
	
	cout<<"\n\n\n\n\n  NOW DEQUEUING q10 UNTIL EMPTY:\n";
	int*x;
	while(x=(int*)q10.dequeue()) {cout<<" val="<<*x<<endl;}		
	cout<<"\nNow (3) we have total enqueued objects = "<<q1.get_no_objects()<<"\n";
//return 0;
	
	

	cout<<"\ndisplaying q1:\n"; cout <<q1;
	cout<<"\ndisplaying q2:\n"; cout<<q2;			
//return 0;











///////////////////////////////////////////////////////////
	myqueue q3("queue3");
	q3 = q1+q2;	
	
	cout<<"\nNow (4) we have total enqueued objects = "<<q3.get_no_objects()<<"\n";
//	return 0;
	
	cout<<"\n\n\n OPERATOR+: NOW DEQUEUING q3 UNTIL EMPTY:\n";
	while(x=(int*)q3.dequeue()) {cout<<" val="<<*x<<endl;}
	cout<<"\nNow (5) we have total enqueued objects = "<<q2.get_no_objects()<<"\n";
	
	cout<<" listing q2:"<<q2<<endl;
//	return 0;

	
	cout<<"\n\n\nTHE < OPERATOR\n";
	if(q1<q2) cout<<"\n q1  shorter than q2"; 
	else cout<<"\n q1 NOT shorter than q2";
	cout<<endl;
//	return 0;
	

	cout<<"THE STREAM OPERATOR\n listing q3:"<< q3 <<endl<<endl;
//	return 0;



	cout<<"\n\n\n OPERATOR+=\n";
	myqueue q4("queue4");
	int ax=17; q4.enqueue(&ax);
	q4+=q2;
	q4+=q1;
	cout<<"\n: NOW DEQUEUING q4 UNTIL EMPTY:\n";
	while(x=(int*)q4.dequeue()) {cout<<" val="<<*x<<endl;}
//	return 0;


	int i=1;
	int* y= (int*) (q1[i]);
	cout << "\n\nCOUT OPERATOR[]:\n q1["<<i<<"]="<<y; if(y!=NULL){cout<<"     val="<<*y<<endl;}
	return 0;
}