Lines Matching refs:dictionary
18 * dictionary are very simple and thus fast, and deletions are avoided
147 * Insert string str in the dictionary and set match_head to the previous head
552 int ZEXPORT deflateSetDictionary(z_streamp strm, const Bytef *dictionary,
560 if (deflateStateCheck(strm) || dictionary == Z_NULL)
567 /* when using zlib wrappers, compute Adler-32 for provided dictionary */
569 strm->adler = adler32(strm->adler, dictionary, dictLength);
572 /* if dictionary would fill window, just replace the history */
580 dictionary += dictLength - s->w_size; /* use the tail */
584 /* insert dictionary into window and hash */
588 strm->next_in = __UNCONST(dictionary);
618 int ZEXPORT deflateGetDictionary(z_streamp strm, Bytef *dictionary,
629 if (dictionary != Z_NULL && len)
630 zmemcpy(dictionary, s->window + s->strstart + s->lookahead - len, len);
1017 /* Save the adler32 of the preset dictionary: */
1810 * new strings in the dictionary only for unmatched strings or for short
1832 * dictionary, and set hash_head to the head of the hash chain:
1932 * dictionary, and set hash_head to the head of the hash chain: