C++LinkDeQueue

#pragma once
#ifndef _LINKDEQUEUE_H_
#define _LINKDEQUEUE_H_

#include "linklist.h"

template<typename T, typename _Container = linklist<T>>
class linkdequeue{
protected:
using uint = unsigned int;
_Container c;
public:

linkdequeue() :c(){ }
explicit linkdequeue(const _Container &c) :c(c){ }
bool empty()const{ return c.empty(); }
uint size()const{ return c.size(); }
const _Container &getContainer() const{ return c; }
void push_back(const T &value){ c.push_back(value); }
void pop_back(){ c.pop_back(); }
void push_front(const T &value){ c.push_front(value); }
void pop_front(){ c.pop_front(); }
void clear(){ c.clear(); }
const T &front()const{ return c.front(); }
const T &back()const{ return c.back(); }
T &front(){ return c.front(); }
T &back(){ return c.back(); }

};

 

#endif // !_LINKQUEUE_H_

 

转载于:https://www.cnblogs.com/MasterYan576356467/p/11167367.html