Searched refs:m_front (Results 1 – 2 of 2) sorted by relevance
97 size_t m_front; // Index indicating start elements variable119 return m_front==m_back; in IsEmpty()126 return (m_back - m_front + N) % N; in Size()133 ASSERTMSG((m_back + 1) % N != m_front, "You can not Push() anymore because queue is full."); in Push()145 m_front = (m_front + 1) % N; in Pop()152 return m_array[m_front]; in Front()166 m_front = 0; in Clear()183 LOG("[%d] : %d\n", i, m_array[(m_front + i) % N]); in PrintDebugInfo()
112 size_t m_front; // Index indicating start elements variable137 return m_front==m_back; in IsEmpty()144 return (m_back + 1) % N == m_front; in IsFull()151 return (m_back - m_front + N) % N; in Size()170 m_front = (m_front + 1) % N; in PopFront()179 return m_array[m_front]; in Front()188 return m_array[m_front]; in Front()215 return m_array[(m_front + n) % N]; in At()222 m_front = 0; in Clear()