queue.h

数据结构中有关栈的知识

#include <iostream>
using namespace std;

class queue
{
public:
	queue(void);
	~queue(void);
	friend istream& operator>>(istream& in,queue& l);
	friend ostream& operator<<(ostream& out,queue& l);
	void enqueue();
	void dequeue();
	bool isfull() {return (rear+1)%maxsize==front?1:0;}
	bool isempty() {return (rear==front)?1:0;}
	int length() {return (rear+maxsize-front)%maxsize;}
//protected:
	int rear,front;  //rear为下一个可用位置
	int *elements;
	int maxsize;
};