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