Lines Matching +full:41 +full:a
33 … It could be confused for a real successor at index "1", if sorted as larger than its predecessor.
34 … It's not a big deal though : candidate will just be sorted again.
36 … But candidate 1 cannot hide a large tree of candidates, so it's a minimal loss.
37 …t is that ZSTD_DUBT_UNSORTED_MARK cannot be mishandled after table reuse with a different strategy.
89 /* Controls whether seqStore has a single "long" litLength or matchLength. See SeqStore_t. */
92 ZSTD_llt_literalLength = 1, /* represents a long literal */
93 ZSTD_llt_matchLength = 2 /* represents a long match */
107 …/* longLengthPos and longLengthType to allow us to represent either a single litLength or matchLen…
108 * in the seqStore that has a value larger than U16 (if it exists). To do so, we increment
148 * Stores Literals Block Type for a super-block in hType, and
159 * Stores symbol compression modes for a super-block in {ll, ol, ml}Type, and
242 …ZSTD_OptPrice_e priceType; /* prices can be determined dynamically, or follow a pre-defined cost…
273 * When loadedDictEnd != 0, a dictionary is in use, and still valid.
274 … * This relies on a mechanism to set loadedDictEnd=0 when dictionary is no longer within distance.
283 …BYTE* tagTable; /* For row-based matchFinder: A row-based table containin…
284 …U32 hashCache[ZSTD_ROW_HASH_CACHE_SIZE]; /* For row-based matchFinder: a cache of hashes to improv…
310 * at a small cost to compression ratio.
417 /* Always load a dictionary in ext-dict mode (not prefix mode)? */
456 * in a wksp.
559 ZSTD_cpm_createCDict = 2, /* Creating a CDict.
600 … 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, in ZSTD_MLcode()
667 * to generate a compress block or a compressed literals section.
721 * Store a sequence (litlen, litPtr, offBase and matchLength) into SeqStore_t.
737 … assert(seqStorePtr->longLengthType == ZSTD_llt_none); /* there can only be a single long length */ in ZSTD_storeSeqOnly()
751 … assert(seqStorePtr->longLengthType == ZSTD_llt_none); /* there can only be a single long length */ in ZSTD_storeSeqOnly()
762 * Store a sequence (litlen, litPtr, offBase and matchLength) into SeqStore_t.
777 …art = (const BYTE*)literals; /* note : index only works for compression within a single segment */ in ZSTD_storeSeq()
878 DEBUGLOG(7, "ZSTD_count_2segments: found a 2-parts match (current length==%zu)", matchLength); in ZSTD_count_2segments()
996 * Compute the primePower to be passed to ZSTD_rollingHash_rotate() for a hash
997 * over a window of length bytes.
1051 * Returns non-zero if the window has a non-empty extDict.
1185 /* maxDist must be a power of two so that: in ZSTD_window_correctOverflow()
1230 * This must be called before a block compression call.
1232 * loadedDictEnd is only defined if a dictionary is in use for current compression.
1262 - When there is a standard dictionary : in ZSTD_window_enforceMaxDist()
1315 * dictMatchState, so setting it to NULL is not a problem. in ZSTD_checkDictValidity()
1393 /* When using a dictionary the entire dictionary is valid if a single byte of the dictionary in ZSTD_getLowestMatchIndex()
1442 /* display a table content,
1500 * dict : must point at beginning of a valid zstd dictionary.
1577 * output an empty Block with end-of-frame mark to complete a frame
1585 * Must be called before starting a compression operation.
1586 * seqs must parse a prefix of the source.
1588 * Zstd will use these sequences, and pass the literals to a secondary block
1600 * Trace the end of a compression call.