Searched refs:largestBits (Results 1 – 1 of 1) sorted by relevance
361 * @pre The sum of the ranks of each symbol == 2^largestBits,362 * where largestBits == huffNode[lastNonNull].nbBits.363 * @post The sum of the ranks of each symbol == 2^largestBits,364 * where largestBits is the return value (expected <= targetNbBits).376 const U32 largestBits = huffNode[lastNonNull].nbBits; in HUF_setMaxHeight() local 378 if (largestBits <= targetNbBits) return largestBits; in HUF_setMaxHeight() 384 const U32 baseCost = 1 << (largestBits - targetNbBits); in HUF_setMaxHeight() 389 * we are over 2^largestBits after adjust the offending ranks. in HUF_setMaxHeight() 392 totalCost += baseCost - (1 << (largestBits in HUF_setMaxHeight() [all...]