Searched refs:m_HeapLength (Results 1 – 4 of 4) sorted by relevance
48 m_Heap[kSmallest] = m_Heap[m_HeapLength--]; in RemoveSmallest()72 for (UINT32 j = k << 1; j <= m_HeapLength;) // j: left son of k in DownHeap()75 if (j < m_HeapLength && Smaller(m_Heap[j+1], m_Heap[j])) in DownHeap()223 m_HeapLength = 0; in BuildTree()229 m_Heap[++m_HeapLength] = aMaxCode = n; in BuildTree()240 while (m_HeapLength < 2) in BuildTree()242 int aNewNode = m_Heap[++m_HeapLength] = (aMaxCode < 2 ? ++aMaxCode : 0); in BuildTree()252 for (n = m_HeapLength / 2; n >= 1; n--) in BuildTree()276 while (m_HeapLength >= 2); in BuildTree()
29 UINT32 m_HeapLength; variable