Searched refs:alphabetSize (Results 1 – 4 of 4) sorted by relevance
249 unsigned const alphabetSize = maxSymbolValue + 1; in FSE_writeNCount_generic() local261 while ((symbol < alphabetSize) && (remaining>1)) { /* stops at 1 */ in FSE_writeNCount_generic()264 while ((symbol < alphabetSize) && !normalizedCounter[symbol]) symbol++; in FSE_writeNCount_generic()265 if (symbol == alphabetSize) break; /* incorrect distribution */ in FSE_writeNCount_generic()317 assert(symbol <= alphabetSize); in FSE_writeNCount_generic()
738 int const alphabetSize = (int)(maxSymbolValue + 1); in HUF_buildCTableFromTree() local748 for (n=0; n<alphabetSize; n++) in HUF_buildCTableFromTree()750 for (n=0; n<alphabetSize; n++) in HUF_buildCTableFromTree()
247 unsigned const alphabetSize = maxSymbolValue + 1; in FSE_writeNCount_generic() local259 while ((symbol < alphabetSize) && (remaining>1)) { /* stops at 1 */ in FSE_writeNCount_generic()262 while ((symbol < alphabetSize) && !normalizedCounter[symbol]) symbol++; in FSE_writeNCount_generic()263 if (symbol == alphabetSize) break; /* incorrect distribution */ in FSE_writeNCount_generic()315 assert(symbol <= alphabetSize); in FSE_writeNCount_generic()
663 int const alphabetSize = (int)(maxSymbolValue + 1); in HUF_buildCTableFromTree() local673 for (n=0; n<alphabetSize; n++) in HUF_buildCTableFromTree()675 for (n=0; n<alphabetSize; n++) in HUF_buildCTableFromTree()