Lines Matching full:rank
233 /* Prepare base value per rank */ in HUF_readCTable_wksp()
261 /* determine stating value per rank */ in HUF_readCTable_wksp()
267 valPerRank[n] = min; /* get starting value within each rank */ in HUF_readCTable_wksp()
272 /* assign value within rank, symbol order */ in HUF_readCTable_wksp()
319 /* Get pos of last (smallest) symbol per rank */ in HUF_setMaxHeight()
347 …/* only triggered when no more rank 1 symbol left => find closest one (note : there is necessarily… in HUF_setMaxHeight()
353 rankLast[nBitsToDecrease - 1] = rankLast[nBitsToDecrease]; /* this rank is no longer empty */ in HUF_setMaxHeight()
360 rankLast[nBitsToDecrease] = noSymbol; /* this rank is now empty */ in HUF_setMaxHeight()
365 …st[1] == noSymbol) { /* special case : no rank 1 symbol (using maxNbBits-1); let's create one from… in HUF_setMaxHeight()
391 rankPos rank[32]; in HUF_sort() local
394 memset(rank, 0, sizeof(rank)); in HUF_sort()
397 rank[r].base++; in HUF_sort()
400 rank[n - 1].base += rank[n].base; in HUF_sort()
402 rank[n].curr = rank[n].base; in HUF_sort()
406 U32 pos = rank[r].curr++; in HUF_sort()
407 while ((pos > rank[r].base) && (c > huffNode[pos - 1].count)) in HUF_sort()
483 /* determine stating value per rank */ in HUF_buildCTable_wksp()
487 valPerRank[n] = min; /* get starting value within each rank */ in HUF_buildCTable_wksp()
495 tree[n].val = valPerRank[tree[n].nbBits]++; /* assign value within rank, symbol order */ in HUF_buildCTable_wksp()