Stack.h

Go to the documentation of this file.

/***************************************************************
 
 Mini Grand Challenge 2010
 Pennsylvania State University - Robotics Club
 Learn more at www.psurobotics.org
 Protected by the GNU General Public License
 
 This source file is developed and maintained by:
 + Jeremy Bridon jgbridon@gmail.com
 
 File: Stack.h
 Desc: Custom-build data structure for use and support of the
 dictionary data structure.
 
***************************************************************/

// Inclusion guard
#ifndef __STACK_H_
#define __STACK_H_

// Includes
#include "Utilities.h"
#include "List.h"
#include "Queue.h"

template <typename Type> class Stack
{
public:

        Stack(int size = DEFAULT_PAGE_SIZE, int PageSize = DEFAULT_PAGE_SIZE)
                : data(size) // Create the list structure
        {
                // Set the page size
                pageSize = PageSize;
                if(pageSize <= 0)
                        pageSize = DEFAULT_PAGE_SIZE;

                // Set the default variables
                top = 0;
        }

        ~Stack()
        {
                // Nothing to do
        }

        void Push(Type newData)
        {
                // Resize if needed
                if(top >= data.GetSize())
                {
                        // Grow by a page
                        data.Resize(data.GetSize() + pageSize);
                }

                // Insert data
                memcpy((void*)&data[top++], (void*)&newData, sizeof(Type));
        }

        Type Pop()
        {
                // Return the top of the stack as well as recudes the count index
                Assert(top - 1 >= 0, "Attemted to pop off empty stack.");
                return data[--top];
        }

        Type Peek()
        {
                // Returns the top of the stack
                Assert(top >= 0, "Attemted to peek empty stack.");
                return data[top];
        }

        int GetSize()
        {
                return top;
        }

        bool IsEmpty()
        {
                if(top <= 0)
                        return true;
                else
                        return false;
        }

        void Flip()
        {
                // Flip data
                for(int i = 0; i < top / 2; i++)
                {
                        // Swap i with top - i
                        Type temp = data[i];
                        data[i] = data[top - i - 1];
                        data[top - i - 1] = temp;
                }
        }

private:

        static const int DEFAULT_PAGE_SIZE = 16;

        List< Type > data;      
        int top;                        
        int pageSize;           
};

#endif

---