31 template <class T, size_t N>
62     void PushBack(const T &value);
72     const T& Front(void) const;
77           T& Front(void);
82     const T& Back(void) const;
87           T& Back(void);
92     const T& At(size_t n) const;
111     T m_array[N];
120 template <class T, size_t N>
121 Deque<T, N>::Deque(void)  in Deque()
128 template <class T, size_t N>
129 Deque<T, N>::~Deque(void)  in ~Deque()
134 template <class T, size_t N>
135 bool Deque<T, N>::IsEmpty(void) const  in IsEmpty()
141 template <class T, size_t N>
142 bool Deque<T, N>::IsFull(void) const  in IsFull()
148 template <class T, size_t N>
149 size_t Deque<T, N>::Size(void) const  in Size()
155 template <class T, size_t N>
156 void Deque<T, N>::PushBack(const T &value)  in PushBack()
165 template <class T, size_t N>
166 void Deque<T, N>::PopFront(void)  in PopFront()
174 template <class T, size_t N>
175 const T& Deque<T, N>::Front(void) const  in Front()
183 template <class T, size_t N>
184 T& Deque<T, N>::Front(void)  in Front()
192 template <class T, size_t N>
193 const T& Deque<T, N>::Back(void) const  in Back()
201 template <class T, size_t N>
202 T& Deque<T, N>::Back(void)  in Back()
210 template <class T, size_t N>
211 const T& Deque<T, N>::At(size_t n) const  in At()
219 template <class T, size_t N>
220 void Deque<T, N>::Clear(void)  in Clear()