33 template <class T, size_t N>
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()
146     return (m_back + 1) % N == m_front;  in IsFull()
150 template <class T, size_t N>
151 size_t Deque<T, N>::Size(void) const  in Size()
153     return (m_back - m_front + N) % N;  in Size()
157 template <class T, size_t N>
158 void Deque<T, N>::PushBack(const T &value)  in PushBack()
163     m_back = (m_back + 1) % N;  in PushBack()
167 template <class T, size_t N>
168 void Deque<T, N>::PopFront(void)  in PopFront()
172     m_front = (m_front + 1) % N;  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()
199     return m_array[(m_back - 1 + N) % N];  in Back()
203 template <class T, size_t N>
204 T& Deque<T, N>::Back(void)  in Back()
208     return m_array[(m_back - 1 + N) % N];  in Back()
212 template <class T, size_t N>
213 const T& Deque<T, N>::At(size_t n) const  in At()
217     return m_array[(m_front + n) % N];  in At()
221 template <class T, size_t N>
222 void Deque<T, N>::Clear(void)  in Clear()