使用对象实现栈和队列.doc

用类定义stack #ifndef STACK_H_ #define STACK_H_ typedef unsigned long Item; class Stack { private: enum{MAX=10}; Item items[MAX]; int top; public: Stack(); bool isempty()const; bool isfull()const; //push()returns false if stack already is full,true otherwise bool push(const Item item);//add item to stack //pop()returns false if stack already is empty ,true otherwise bool pop(Item item); }; //stack.cpp--stack member functions //#includeiostream #includestack.h Stack::Stack() { top=0; } bool Stack::isempty()const { return top==0; } bool Stack::isfull()const { return top==MAX; } bool Stack::push(const Item item) { if(topMAX) { items[top++]=item; return true; } else return false; } bool Stack::pop(Item item) { if(top0) { item=items[--top]; return true; } else return false; } 用类实现队列 #ifndef QUEUE_H_ #define QUEUE_H_ //This queue will contain customer items class Customer { private: long arrive; //arrival time for customer int processtime;//processing time for customer public: Customer(){arrive=processtime=0;} void set(long when); long when()const{return arrive;} int ptime()const{return processtime;} }; typedef Customer Item; class Queue { private: //class scope definitions //node is a,nested structure definition local to this class struct Node{ Item item; struct Node *next; }; enum{Q_SIZE=10}; //private class members Node *front;//pointer to front of queue Node *rear; //pointer to rear of queue int items; //current number of items in queue const int qsize;//maximum number of items in queue //preemptive definitions to prevent public copying Queue(const Queue q):qsize(0){ } Queue operator=(const Queue q){return *this;} public: Queue (int qs=Q_SIZE);//create queue with a qs limit ~Queue(); bool isempty()const; bool isfull()const; int queuecount()const; bool enqueue(const Item item);//add item to end bool dequeue(Item item); }; #endif //queue.cpp--queue and Customer methods #includeiostream #inc