数据结构的包装整理

1234567891011121314151617181920212223242526272829303132333435363738#include<bits/stdc++.h>
using namespace std;

template<typename T,int SIZE> 
class Stack {
	private:
		T stk[SIZE+5];
		int idx;
	public:
		Stack():idx(0){}
		bool empty() const {
			return !idx;
		}
		bool full() const {
			return idx==SIZE;
		}
		int size() const {
			return idx;
		} 
		T top() const {
        	if(empty()) {
				throw out_of_range("Stack is empty.");
			}
			return stk[idx];
		}
		void push(T x) {
			if(full()) {
				throw out_of_range("Stack is full.");
			}
			stk[++idx]=x;
		} 
		void pop() {
			idx--;
		}
		void clear() {
			idx=0;
		}
}; 

Stack<typename,SIZE> stk;

1234567891011121314151617181920212223242526272829303132333435363738394041424344#include<bits/stdc++.h>
using namespace std;

template<typename T,int SIZE>
class Queue {
	private:
		T q[SIZE+5];
		int front,back,cnt;
	public:
	    Queue():front(0),back(0),cnt(0){}
	    void push(T value) {
	        if(full()) {
	            throw overflow_error("Queue is full.");
	        }
	        q[back]=value;
	        back=(back+1)%SIZE;
	        cnt++;
	    }
	    void push() {
	        if(empty()) {
	            throw underflow_error("Queue is empty.");
	        }
	        front=(front+1)%SIZE;
	        cnt--;
	    }
	    T front() const {
	        if (empty()) {
	            throw underflow_error("Queue is empty");
	        }
	        return q[front];
	    }
	    bool empty() const {
	        return cnt==0;
	    }
	    bool full() const {
	        return cnt==SIZE;
	    }
	    int size() const {
	        return cnt;
	    }
	    void clear() {
	    	front=back=cnt=0;
	    }
};

Queue<typename,SIZE> q;