C++ 队列模拟实现

namespace my_queue
{
	template<class T, class Cont = list<T>>
	class queue
	{
	public:
		queue(){}
	public:
		void push(const T &x) 
		{
			c.push_back(x);
		}
		T& front()
		{
			return c.front();
		}
		void pop()
		{
			c.pop_front();
		}
		bool empty()const
		{
			return c.empty();
		}
		size_t size()
		{
			return _top;
		}
	private:
		Cont c;
	};
}