C++配列実装のループキュー

#include
#include <string>

/*
  ：         ，C++  ，    
*/

using namespace std;

template 
class Myloopqueue{
private:
T *queue;//      
int capacity;//    
int head;//    
int tail;//    
public:
Myloopqueue(int a);//    
Myloopqueue();//    
~Myloopqueue();//  
bool isEmpty();//   
int getSize();//    
bool push(T a);//  
bool pop();//  
T top();//    
};

template
Myloopqueue::Myloopqueue(int a) :head(0), tail(0), capacity(a), queue(nullptr){
queue = new T[capacity];
}

template
Myloopqueue::Myloopqueue() : Myloopqueue(10){};

template
Myloopqueue::~Myloopqueue(){
delete[] queue;
}

template
bool Myloopqueue::isEmpty(){
if (head == tail)
return true;
else
return false;
}

template
int Myloopqueue::getSize(){
return (tail - head + capacity) % capacity;
}

template
bool Myloopqueue::push(T a){
if ((tail - head + capacity) % capacity == capacity)
return false;
queue[tail] = a;
tail = (tail + 1) % capacity;
return true;
}

template
bool Myloopqueue::pop(){
if ((tail - head + capacity) % capacity == 0)
return false;
head = (head + 1) % capacity;
return true;
}

template
T Myloopqueue::top(){
return queue[head%capacity];
}


int main()
{
Myloopqueue<string> queue(6);
queue.push("one");
queue.push("two");
queue.push("three");
queue.push("four");
queue.push("five");
cout << "    " << queue.getSize() << endl;
while (!queue.isEmpty())
{
cout << queue.top() << endl;
queue.pop();
}
getchar();
return 0;

}

 
転載先:https://www.cnblogs.com/jizhji/p/5879641.html