236     /* Prepare base value per rank */  in HUF_readCTable()
254         /* determine stating value per rank */  in HUF_readCTable()
258                 valPerRank[n] = min;     /* get starting value within each rank */  in HUF_readCTable()
262         /* assign value within rank, symbol order */  in HUF_readCTable()
340             /* Get pos of last (smallest = lowest cum. count) symbol per rank */  in HUF_setMaxHeight()
352                  * gain back half the rank.  in HUF_setMaxHeight()
367 …/* only triggered when no more rank 1 symbol left => find closest one (note : there is necessarily…  in HUF_setMaxHeight()
373                 /* Increase the number of bits to gain back half the rank cost. */  in HUF_setMaxHeight()
377                 /* Fix up the new rank.  in HUF_setMaxHeight()
378                  * If the new rank was empty, this symbol is now its smallest.  in HUF_setMaxHeight()
379                  * Otherwise, this symbol will be the largest in the new rank so no adjustment.  in HUF_setMaxHeight()
383                 /* Fix up the old rank.  in HUF_setMaxHeight()
385                  * it must be the only symbol in its rank, so the old rank now has no symbols.  in HUF_setMaxHeight()
387 …             * the smallest node in the rank. If the previous position belongs to a different rank,  in HUF_setMaxHeight()
388                  * then the rank is now empty.  in HUF_setMaxHeight()
395                         rankLast[nBitsToDecrease] = noSymbol;   /* this rank is now empty */  in HUF_setMaxHeight()
400              * To avoid overshooting again, we only adjust the smallest rank.  in HUF_setMaxHeight()
401              * We take the largest nodes from the lowest rank 0 and move them  in HUF_setMaxHeight()
402              * to rank 1. There's guaranteed to be enough rank 0 symbols because  in HUF_setMaxHeight()
406                 /* special case : no rank 1 symbol (using maxNbBits-1);  in HUF_setMaxHeight()
407                  * let's create one from largest rank 0 (using maxNbBits).  in HUF_setMaxHeight()
552      * For symbol s let lowerRank = HUF_getIndex(count[n]) and rank = lowerRank + 1.  in HUF_sort()
555      * each rank begins in the output, so for rank R we want to count ranks R+1 and above.  in HUF_sort()
663     /* determine starting value per rank */  in HUF_buildCTableFromTree()
666             valPerRank[n] = min;      /* get starting value within each rank */  in HUF_buildCTableFromTree()
673 …HUF_setValue(ct + n, valPerRank[HUF_getNbBits(ct[n])]++);   /* assign value within rank, symbol or…  in HUF_buildCTableFromTree()