#include <iostream>
#include <string>
#include "stack.h"
#include "queue.h"
using namespace std;

int main()
{
	queue Q;
	Q.enqueue(1);
	Q.enqueue(2);
	Q.enqueue(3);
	Q.enqueue(4);

	cout << "dequeing: " << Q.dequeue() << endl; //1
	cout << "dequeing: " << Q.dequeue() << endl; //2
	cout << "dequeing: " << Q.dequeue() << endl; //3

	Q.enqueue(5);
	Q.enqueue(6);
	Q.enqueue(7);

	while(! Q.empty())
		cout << "dequeing: " << Q.dequeue() << endl; //4,5,6,7

	for (int i = 0; 1000; i++)
		Q.enqueue(i);

	while (!Q.empty())
		cout << "dequeing: " << Q.dequeue() << endl;

	stack<string> S;

	S.push("banana");
	S.push("choco");
	S.push("peanut");
	S.push("straw");

	cout << "Eating: " << S.pop() << endl; //straw

	S.push("pecan");
	S.push("butter");

	while (!S.empty())
		cout << "Eating: " << S.pop() << endl; //butter, pecan, peanut, choco, bananana

	//Let's push too many items
	stack<int> numberStack;

	int size = 1000;

	for (int i = 0; i < size; i++)
		numberStack.push(i);

	//while (!numberStack.empty())
	//	cout << "popping: " << numberStack.pop() << endl;



	return 0;
}