Lines Matching refs:dictionary
16 * dictionary are very simple and thus fast, and deletions are avoided
159 * Insert string str in the dictionary and set match_head to the previous head
290 int ZEXPORT deflateSetDictionary (strm, dictionary, dictLength)
292 const Bytef *dictionary;
300 if (strm == Z_NULL || strm->state == Z_NULL || dictionary == Z_NULL ||
304 strm->adler = adler32(strm->adler, dictionary, dictLength);
310 dictionary += dictLength - length; /* use the tail of the dictionary */
313 zmemcpy(s->window, dictionary, length);
473 /* Save the adler32 of the preset dictionary: */
1074 * This function does not insert new strings in the dictionary since
1135 * new strings in the dictionary only for unmatched strings or for short
1160 * dictionary, and set hash_head to the head of the hash chain:
1257 * dictionary, and set hash_head to the head of the hash chain: