zstd/common/fse.h

61                      if return == 1, srcData is a single byte symbol * srcSize times. Use RLE compression instead.
99                      if return == 1, srcData is a single byte symbol * srcSize times. Use RLE compression.
110 1. count symbol occurrence from source[] into table count[] (see hist.h)
186 FSE_count() will return the number of occurrence of the most frequent symbol.
187 This can be used to know if there is a single symbol within 'src', and to quickly evaluate its compressibility.
201 It is 0 if there is a single symbol within distribution.
328 /*< build a fake FSE_CTable, designed for a flat distribution, where each symbol uses nbBits */
348 /*< build a fake FSE_DTable, designed to read a flat distribution where each symbol uses nbBits */
368 *  FSE symbol compression API
383 static void FSE_encodeSymbol(BIT_CStream_t* bitC, FSE_CState_t* CStatePtr, unsigned symbol);
392 So the first symbol you will encode is the last you will decode, like a LIFO stack.
409     FSE_encodeByte(&bitStream, &state, symbol);
432 *  FSE symbol decompression API
464 You can then decode your data, symbol after symbol.
467     unsigned char symbol = FSE_decodeSymbol(&DState, &DStream);
485 After each decoded symbol, check if DStream is fully consumed using this simple test :
524 *   Same as FSE_initCState(), but the first symbol to include (which will be the last to be read)
525 *   uses the smallest state value possible, saving the cost of this symbol */
526 MEM_STATIC void FSE_initCState2(FSE_CState_t* statePtr, const FSE_CTable* ct, U32 symbol)
529     {   const FSE_symbolCompressionTransform symbolTT = ((const FSE_symbolCompressionTransform*)(statePtr->symbolTT))[symbol];
537 MEM_STATIC void FSE_encodeSymbol(BIT_CStream_t* bitC, FSE_CState_t* statePtr, unsigned symbol)
539     FSE_symbolCompressionTransform const symbolTT = ((const FSE_symbolCompressionTransform*)(statePtr->symbolTT))[symbol];
554  * Approximate maximum cost of a symbol, in bits.
555  * Fractional get rounded up (i.e : a symbol with a normalized frequency of 3 gives the same result as a frequency of 2)
565  * Approximate symbol cost, as fractional value, using fixed-point format (accuracyLog fractional bits)
596     unsigned char  symbol;
612     return DInfo.symbol;
627     BYTE const symbol = DInfo.symbol;
631     return symbol;
635     unsafe, only works if no symbol has a probability > 50% */
640     BYTE const symbol = DInfo.symbol;
644     return symbol;
675 *  Maximum symbol value authorized.