//**************************************
//     
// Name: Code examples of Vector Contain
//     ers, Stacks, Queues, and Lists.
// Description:This code demonstrates ho
//     w to use Vector Containers, Stacks, Queu
//     es, and Lists, using the STL in C++.
// By: Chris C.
//
//This code is copyrighted and has// limited warranties.Please see http://
//     www.Planet-Source-Code.com/vb/scripts/Sh
//     owCode.asp?txtCodeId=12144&lngWId=3//for details.//**************************************
//     

// Here we want to include the templated
//     classes included with the STL.
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <list>
// Here we declare our functions..
void VectorExample();
void StackExample();
void QueueExample();
void LinkedListExample();
// We want to use the std namespace to s
//     implify the code.
using namespace std;
// Our entry point function...
int main(int argc, char *argv[])


    {
    	// this variable will hold the user's selection.
    	int nSelection = -1;
    	// Welcome the user, and get input...
    	std::cout << "Welcome! Please select which demonstration you would like displayed:\n";
    	std::cout << "\n[0] Vector Containers\n[1] Stacks\n[2] Queues\n[3] Linked Lists\n[4] Exit\n\n";
    	
    	while((nSelection < 0) || (nSelection > 4))


        	{
        		std::cout << "Selection: ";
        		std::cin >> nSelection;
        		// if the user decides to exit, we return 0.
        		if (nSelection == 4)
        			return 0; 
        	}
        	switch(nSelection)


            	{
            	case 0:
            		// We are going to demonstrate Vector Containers
            		VectorExample();
            		break;
            	case 1:
            		// We are going to demonstrate Stacks
            		StackExample();
            		break;
            	case 2:
            		// We are going to demonstrate Queues
            		QueueExample();
            		break;
            	case 3:
            		// We are going to demonstrate Linked Lists
            		LinkedListExample();
            		break;
            	};
            	std::cout << "\n\nGoodbye!\n\n" << std::endl;
            	return 0;
        }

        void VectorExample()


            {
            	// Create a vector of integers
            	std::vector<int> MyVector;
            	
            	std::cout << "\n\nWelcome to the Vector Containers demonstration...\n";
            	std::cout << "You will be asked to enter 3 numbers.\n";
            	for (int i = 0; i < 3; i++)


                	{
                		int nTemp = 0;
                		std::cout << "\nEnter #" << i+1 << ": ";
                		std::cin >> nTemp;
                		// Here we "push" or add an item to the vector.
                		MyVector.push_back(nTemp);
                	}
                	for (int i = 0; i < 3; i++)


                    	{
                    		std::cout << "\nThe number you entered at #" << i+1 << " was: " << MyVector.at(i);
                    	}
                }

                void StackExample()


                    {
                    	// Create a stack of integers.
                    	std::stack<int> MyStack;
                    	
                    	std::cout << "\n\nWelcome to the Stacks demonstration...\n";
                    	std::cout << "You will be asked to enter 3 numbers.\n";
                    	for (int i = 0; i < 3; i++)


                        	{
                        		int nTemp = 0;
                        		std::cout << "\nEnter #" << i+1 << ": ";
                        		std::cin >> nTemp;
                        		// Here we "Push" or add an item to the stack.
                        		MyStack.push(nTemp);
                        	}
                        	// Because a stack is in FILO, we need to go backwords
                        	for (int i = 3; i > 0; i--)


                            	{
                            		std::cout << "\nThe number you entered at #" << i << " was: " << MyStack.top();
                            		// Write here we "pop" or remove the next item in the stack.
                            		MyStack.pop();
                            	}
                        }

                        void QueueExample()


                            {
                            	// Create a queue of integers.
                            	std::queue<int> MyQueue;
                            	
                            	std::cout << "\n\nWelcome to the Queues demonstration...\n";
                            	std::cout << "You will be asked to enter 3 numbers.\n";
                            	for (int i = 0; i < 3; i++)


                                	{
                                		int nTemp = 0;
                                		std::cout << "\nEnter #" << i+1 << ": ";
                                		std::cin >> nTemp;
                                		// Here we "Push" or add an item to the queue.
                                		MyQueue.push(nTemp);
                                	}
                                	for (int i = 0; i < 3; i++)


                                    	{
                                    		std::cout << "\nThe number you entered at #" << i+1 << " was: " << MyQueue.front();
                                    		// Write here we "pop" or remove the next item in the QUEUE.
                                    		MyQueue.pop();
                                    	}
                                }

                                void LinkedListExample()


                                    {
                                    	// Create a linked list of integers.
                                    	std::list<int> MyList;
                                    	
                                    	std::cout << "\n\nWelcome to the Linked Lists demonstration...\n";
                                    	std::cout << "You will be asked to enter 3 numbers.\n";
                                    	for (int i = 0; i < 3; i++)


                                        	{
                                        		int nTemp = 0;
                                        		std::cout << "\nEnter #" << i+1 << ": ";
                                        		std::cin >> nTemp;
                                        		// Here we "Push" or add an item to the queue.
                                        		MyList.push_back(nTemp);
                                        	}
                                        	list<int>::iterator nCounter = MyList.begin();
                                        	for (int i = 0; i < 3; i++)


                                            	{
                                            		std::cout << "\nThe number you entered at #" << i+1 << " was: " << *nCounter;
                                            		nCounter++;
                                            	}
                                        }