C++ 双向队列

#pragma once
#include 
#include 
using namespace std;
template 
class MyDeque
{
public:
	MyDeque() {}
	void push_back(_Ty data) { mem.push_back(data); }
	void push_front(_Ty data) { mem.push_front(data); }
	void pop_front() { mem.pop_front(); }
	void pop_back() { mem.pop_back(); }
	int size() { return mem.size(); }
	bool empty() { return mem.empty(); }
	_Ty front() { return mem.front(); }
	_Ty back() { return mem.back(); }
protected:
	list<_Ty> mem;
};

#include 
#include 
#include 
#include "myDeque.h"
using namespace std;
void testDeque() 
{
	deque data;
	data.push_back(1);
	data.push_front(2);
	data.push_back(3);
	cout << data.size() << endl;
	while (!data.empty()) 
	{
		cout << data.front() << "t";
		data.pop_front();
	}
	cout << endl;
	deque