Lines Matching defs:symbol
79 1. count symbol occurrence from source[] into table count[]
138 FSE_count() will return the number of occurrence of the most frequent symbol.
139 This can be used to know if there is a single symbol within 'src', and to quickly evaluate its compressibility.
153 It is 0 if there is a single symbol within distribution.
267 /**< build a fake FSE_CTable, designed for a flat distribution, where each symbol uses nbBits */
279 /**< build a fake FSE_DTable, designed to read a flat distribution where each symbol uses nbBits */
288 * FSE symbol compression API
303 static void FSE_encodeSymbol(BIT_CStream_t *bitC, FSE_CState_t *CStatePtr, unsigned symbol);
312 So the first symbol you will encode is the last you will decode, like a LIFO stack.
329 FSE_encodeByte(&bitStream, &state, symbol);
351 * FSE symbol decompression API
382 You can then decode your data, symbol after symbol.
385 unsigned char symbol = FSE_decodeSymbol(&DState, &DStream);
403 After each decoded symbol, check if DStream is fully consumed using this simple test :
439 * Same as FSE_initCState(), but the first symbol to include (which will be the last to be read)
440 * uses the smallest state value possible, saving the cost of this symbol */
441 ZSTD_STATIC void FSE_initCState2(FSE_CState_t *statePtr, const FSE_CTable *ct, U32 symbol)
445 const FSE_symbolCompressionTransform symbolTT = ((const FSE_symbolCompressionTransform *)(statePtr->symbolTT))[symbol];
453 ZSTD_STATIC void FSE_encodeSymbol(BIT_CStream_t *bitC, FSE_CState_t *statePtr, U32 symbol)
455 const FSE_symbolCompressionTransform symbolTT = ((const FSE_symbolCompressionTransform *)(statePtr->symbolTT))[symbol];
477 unsigned char symbol;
493 return DInfo.symbol;
508 BYTE const symbol = DInfo.symbol;
512 return symbol;
516 unsafe, only works if no symbol has a probability > 50% */
521 BYTE const symbol = DInfo.symbol;
525 return symbol;
546 * Maximum symbol value authorized.