numberdeque.h

算法结构的编程

//student ID: 600259933
//student Name: Yang Da
//student Email: [e-mail]
#ifndef _NUMBERDEQUE_H
#define _NUMBERDEQUE_H


//using namespace std;

namespace NumberStructures {
const int DequeSize = 128;

class NumberDeque {
private:
    //an array of integers to store the data (use a size of 128 elements);
    int arrayStore[DequeSize];
    int firstElement;
    int lastElement;
protected:
    void ShuffleElements(int newFirst, int newLast);
    void BalanceFront();
    void BalanceRear();
public:
    NumberDeque();
    void PushFront(int value);
    void PushRear(int value);
    int PopFront();
    int PopRear();
    int Front();
    int Rear();
    bool Empty();
    bool Full();
    int Count();
};
}

#endif // _DEQUE_H