Lines Matching refs:root
3222 int root, leaf, next, avbl, used, dpth;
3230 root = 0;
3233 if (leaf >= n || A[root].m_key < A[leaf].m_key) {
3234 A[next].m_key = A[root].m_key;
3235 A[root++].m_key = (mz_uint16)next;
3238 if (leaf >= n || (root < next && A[root].m_key < A[leaf].m_key)) {
3239 A[next].m_key = (mz_uint16)(A[next].m_key + A[root].m_key);
3240 A[root++].m_key = (mz_uint16)next;
3249 root = n - 2;
3252 while (root >= 0 && (int)A[root].m_key == dpth) {
3254 root--;
5002 int child, root = start;
5004 if ((child = (root << 1) + 1) >= size) break;
5010 pIndices[root], pIndices[child]))
5012 MZ_SWAP_UINT32(pIndices[root], pIndices[child]);
5013 root = child;
5020 int child, root = 0;
5023 if ((child = (root << 1) + 1) >= end) break;
5029 pIndices[root], pIndices[child]))
5031 MZ_SWAP_UINT32(pIndices[root], pIndices[child]);
5032 root = child;
8461 // The last node left on the heap is the root of the tree. For each
8462 // leaf node, the distance between the root and the leaf is the length
8466 // the distances of the leaves from the root on the fly. When a new
8469 // lengths of the descendants (that is, their distance from the root