33 template <class T, size_t N>
98     T m_array[N];
105 template <class T, size_t N>
106 Queue<T, N>::Queue(void)  in Queue()
112 template <class T, size_t N>
113 Queue<T, N>::~Queue(void)  in ~Queue()
118 template <class T, size_t N>
119 bool Queue<T, N>::IsEmpty(void) const  in IsEmpty()
125 template <class T, size_t N>
126 size_t Queue<T, N>::Size(void) const  in Size()
128     return (m_back - m_front + N) % N;  in Size()
132 template <class T, size_t N>
133 void Queue<T, N>::Push(const T &value)  in Push()
135     ASSERTMSG((m_back + 1) % N != m_front, "You can not Push() anymore because queue is full.");  in Push()
138     m_back = (m_back + 1) % N;  in Push()
142 template <class T, size_t N>
143 void Queue<T, N>::Pop(void)  in Pop()
147     m_front = (m_front + 1) % N;  in Pop()
151 template <class T, size_t N>
152 const T& Queue<T, N>::Front(void) const  in Front()
158 template <class T, size_t N>
159 const T& Queue<T, N>::Back(void) const  in Back()
161     return m_array[(m_back - 1 + N) % N];  in Back()
165 template <class T, size_t N>
166 void Queue<T, N>::Clear(void)  in Clear()
174 template <class T, size_t N>
175 void Queue<T, N>::PrintDebugInfo(void) const  in PrintDebugInfo()
185             LOG("[%d] : %d\n", i, m_array[(m_front + i) % N]);  in PrintDebugInfo()