Searched refs:huffNode (Results 1 – 1 of 1) sorted by relevance
545 if (huffNode[i].count > huffNode[i-1].count) { in HUF_isSorted()556 huffNode += low; in HUF_insertionSort()561 huffNode[j + 1] = huffNode[j]; in HUF_insertionSort()691 huffNode[nodeNb].count = huffNode[lowS].count + huffNode[lowS-1].count; in HUF_buildTree()692 huffNode[lowS].parent = huffNode[lowS-1].parent = (U16)nodeNb; in HUF_buildTree()699 int const n1 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++; in HUF_buildTree()700 int const n2 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++; in HUF_buildTree()701 huffNode[nodeNb].count = huffNode[n1].count + huffNode[n2].count; in HUF_buildTree()702 huffNode[n1].parent = huffNode[n2].parent = (U16)nodeNb; in HUF_buildTree()709 huffNode[n].nbBits = huffNode[ huffNode[n].parent ].nbBits + 1; in HUF_buildTree()[all …]