Lines Matching defs:normalizedCounter

68                       const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog,
103 if (normalizedCounter[u-1]==-1) { /* Low proba symbol */
107 assert(normalizedCounter[u-1] >= 0);
108 cumul[u] = cumul[u-1] + (U16)normalizedCounter[u-1];
126 int const n = normalizedCounter[s];
158 int const freq = normalizedCounter[symbol];
178 switch (normalizedCounter[s])
193 assert(normalizedCounter[s] > 1);
194 { U32 const maxBitsOut = tableLog - BIT_highbit32 ((U32)normalizedCounter[s]-1);
195 U32 const minStatePlus = (U32)normalizedCounter[s] << maxBitsOut;
197 symbolTT[s].deltaFindState = (int)(total - (unsigned)normalizedCounter[s]);
198 total += (unsigned)normalizedCounter[s];
206 symbol, normalizedCounter[symbol],
234 const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog,
262 while ((symbol < alphabetSize) && !normalizedCounter[symbol]) symbol++;
290 { int count = normalizedCounter[symbol++];
329 const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)
335 return FSE_writeNCount_generic(buffer, bufferSize, normalizedCounter, maxSymbolValue, tableLog, 0);
337 return FSE_writeNCount_generic(buffer, bufferSize, normalizedCounter, maxSymbolValue, tableLog, 1 /* write in buffer is safe */);
473 size_t FSE_normalizeCount (short* normalizedCounter, unsigned tableLog,
496 if (count[s] == 0) { normalizedCounter[s]=0; continue; }
498 normalizedCounter[s] = lowProbCount;
507 normalizedCounter[s] = proba;
510 if (-stillToDistribute >= (normalizedCounter[largest] >> 1)) {
512 size_t const errorCode = FSE_normalizeM2(normalizedCounter, tableLog, count, total, maxSymbolValue, lowProbCount);
515 else normalizedCounter[largest] += (short)stillToDistribute;
523 RAWLOG(2, "%3i: %4i \n", s, normalizedCounter[s]);
525 nTotal += abs(normalizedCounter[s]);