Lines Matching defs:fast
372 * This method is safe if your compiler supports it, and *generally* as fast or faster than `memcpy`.
1016 The first step is to count all symbols. FSE_count() does this job very fast.
2291 #define HUF_BLOCKBOUND(size) (size + (size>>8) + 8) /* only true when incompressible is pre-filtered with fast heuristic */
2932 const FSE_DTable* dt, const unsigned fast)
2949 #define FSE_GETSYMBOL(statePtr) fast ? FSE_decodeSymbolFast(statePtr, &bitD) : FSE_decodeSymbol(statePtr, &bitD)
3000 /* select fast mode (static) */
3127 zstd, short for Zstandard, is a fast lossless compression algorithm, targeting
3346 Only the order (from fast to strong) is guaranteed */
3387 * This parameter is useless for "fast" strategy.
3393 * This parameter is useless for "fast" and "dFast" strategies.
3401 * , for all strategies > fast, effective maximum is 6.
3407 * For strategy fast:
4207 unsigned chainLog; /**< fully searched segment : larger == more compression, slower, more memory (useless for fast) */
4316 * read each contained frame header. This is fast as most of the data is skipped,
5201 xxHash is an extremely fast Hash algorithm, running at RAM speed limits.
5486 * This method is safe if your compiler supports it, and *generally* as fast or faster than `memcpy`.
8035 const FSE_CTable* ct, const unsigned fast)
8049 #define FSE_FLUSHBITS(s) (fast ? BIT_flushBitsFast(s) : BIT_flushBits(s))
8096 unsigned const fast = (dstSize >= FSE_BLOCKBOUND(srcSize));
8098 if (fast)
8334 /* fast variant (unsafe : won't check if src contains values beyond count[] limit) */
17323 if (compressionLevel < 0) row = 0; /* entry 0 is baseline for fast mode */
27002 * should be fast for a single long sequence, but can be slow for several short sequences.
27050 * NOTE: This function needs to be fast for a single long sequence, but doesn't need