33 template <class T, size_t N>
64     void PushBack(const T &value);
74     const T& Front(void) const;
79           T& Front(void);
84     const T& Back(void) const;
89           T& Back(void);
94     const T& At(size_t n) const;
113     T m_array[N];
122 template <class T, size_t N>
123 Deque<T, N>::Deque(void)  in Deque()
130 template <class T, size_t N>
131 Deque<T, N>::~Deque(void)  in ~Deque()
136 template <class T, size_t N>
137 bool Deque<T, N>::IsEmpty(void) const  in IsEmpty()
143 template <class T, size_t N>
144 bool Deque<T, N>::IsFull(void) const  in IsFull()
150 template <class T, size_t N>
151 size_t Deque<T, N>::Size(void) const  in Size()
157 template <class T, size_t N>
158 void Deque<T, N>::PushBack(const T &value)  in PushBack()
167 template <class T, size_t N>
168 void Deque<T, N>::PopFront(void)  in PopFront()
176 template <class T, size_t N>
177 const T& Deque<T, N>::Front(void) const  in Front()
185 template <class T, size_t N>
186 T& Deque<T, N>::Front(void)  in Front()
194 template <class T, size_t N>
195 const T& Deque<T, N>::Back(void) const  in Back()
203 template <class T, size_t N>
204 T& Deque<T, N>::Back(void)  in Back()
212 template <class T, size_t N>
213 const T& Deque<T, N>::At(size_t n) const  in At()
221 template <class T, size_t N>
222 void Deque<T, N>::Clear(void)  in Clear()