队列是软件开发中最常见的一种数据结构,先来先服务,以及任务调度的一种最基本的方式。
#include<iostream>
using namespace std;
template<class T>
class my_queue
{
public:
my_queue(int size = 0);
~my_queue();
int size(void)const;
bool empty(void)const;
bool full(void)const;
bool push(const T& element);
bool pop(T&element);
private:
int max_size;
int m_size;
int tail;
int front;
T* array;
};
template<class T>
my_queue<T>::my_queue(int size)
{
if(size > 0)
{
array = new T[size];
if(array == NULL)
{
exit(0);
}
else
{
max_size = size;
}
}
else
{
array = NULL;
max_size = 0;
exit(0);
}
m_size = 0;
tail = 0;
front = 0;
}
template<class T>
my_queue<T>::~my_queue()
{
delete []array;
}
template<class T>
bool my_queue<T>::empty(void)const
{
return m_size <= 0 ? true: false;
}
template<class T>
bool my_queue<T>::full(void)const
{
return m_size >= max_size ? true : false;
}
template<class T>
bool my_queue<T>::push(const T& element)
{
if(full())
{
return false;
}
else
{
array[front % max_size] = element;
front = (front+1)% max_size;
m_size++;
return true;
}
}
template<class T>
bool my_queue<T>::pop(T &element)
{
if(empty())
{
return false;
}
else
{
element = array[tail%max_size];
tail = (tail+1)% max_size;
m_size--;
return true;
}
}
int main()
{
my_queue<int> q(10);
for(int i = 0; i < 10; i++)
{
q.push(i);
}
for(int j = 0; j < 10; j++)
{
int t = -1;
q.pop(t);
cout<<t<<endl;
}
return 0;
}