Lines Matching refs:dictionary
16 * dictionary are very simple and thus fast, and deletions are avoided
167 * Insert string str in the dictionary and set match_head to the previous head
379 int ZEXPORT deflateSetDictionary (strm, dictionary, dictLength)
381 const Bytef *dictionary;
390 if (deflateStateCheck(strm) || dictionary == Z_NULL)
397 /* when using zlib wrappers, compute Adler-32 for provided dictionary */
399 strm->adler = adler32(strm->adler, dictionary, dictLength);
402 /* if dictionary would fill window, just replace the history */
410 dictionary += dictLength - s->w_size; /* use the tail */
414 /* insert dictionary into window and hash */
418 strm->next_in = (z_const Bytef *)dictionary;
448 int ZEXPORT deflateGetDictionary (strm, dictionary, dictLength)
450 Bytef *dictionary;
462 if (dictionary != Z_NULL && len)
463 zmemcpy(dictionary, s->window + s->strstart + s->lookahead - len, len);
836 /* Save the adler32 of the preset dictionary: */
1824 * new strings in the dictionary only for unmatched strings or for short
1849 * dictionary, and set hash_head to the head of the hash chain:
1952 * dictionary, and set hash_head to the head of the hash chain: