HomeSort by: relevance | last modified time | path
    Searched refs:dictionary (Results 1 - 19 of 19) sorted by relevancy

  /xsrc/external/mit/brotli/dist/c/enc/
static_dict.h 7 /* Class to model the static dictionary. */
12 #include "../common/dictionary.h"
24 /* Matches data against static dictionary words, and for each length l,
32 const BrotliEncoderDictionary* dictionary,
static_dict.c 9 #include "../common/dictionary.h"
32 static BROTLI_INLINE size_t DictMatchLength(const BrotliDictionary* dictionary,
37 const size_t offset = dictionary->offsets_by_length[len] + len * id;
38 return FindMatchLengthWithLimit(&dictionary->data[offset], data,
42 static BROTLI_INLINE BROTLI_BOOL IsMatch(const BrotliDictionary* dictionary,
47 const size_t offset = dictionary->offsets_by_length[w.len] +
49 const uint8_t* dict = &dictionary->data[offset];
51 /* Match against base dictionary word. */
78 const BrotliEncoderDictionary* dictionary, const uint8_t* data,
82 size_t offset = dictionary->buckets[Hash(data)]
    [all...]
params.h 43 BrotliEncoderDictionary dictionary; member in struct:BrotliEncoderParams
hash.h 16 #include "../common/dictionary.h"
137 const BrotliEncoderDictionary* dictionary, size_t len, size_t word_idx,
144 offset = dictionary->words->offsets_by_length[len] + len * word_idx;
150 FindMatchLengthWithLimit(data, &dictionary->words->data[offset], len);
151 if (matchlen + dictionary->cutoffTransformsCount <= len || matchlen == 0) {
157 (size_t)((dictionary->cutoffTransforms >> (cut * 6)) & 0x3F);
159 (transform_id << dictionary->words->size_bits_by_length[len]);
176 const BrotliEncoderDictionary* dictionary,
188 if (dictionary->hash_table_lengths[key] != 0) {
190 dictionary, dictionary->hash_table_lengths[key]
    [all...]
hash_composite_inc.h 111 const BrotliEncoderDictionary* dictionary,
117 FN_A(FindLongestMatch)(&self->ha, dictionary, data, ring_buffer_mask,
120 FN_B(FindLongestMatch)(&self->hb, dictionary, data, ring_buffer_mask,
backward_references_inc.h 50 FN(FindLongestMatch)(privat, &params->dictionary,
69 &params->dictionary,
hash_rolling_inc.h 152 const BrotliEncoderDictionary* dictionary,
204 /* NOTE: this hasher does not search in the dictionary. It is used as
206 BROTLI_UNUSED(dictionary);
hash_forgetful_chain_inc.h 193 const BrotliEncoderDictionary* dictionary,
283 SearchInStaticDictionary(dictionary,
hash_longest_match64_inc.h 164 const BrotliEncoderDictionary* dictionary,
261 SearchInStaticDictionary(dictionary,
hash_longest_match_inc.h 160 const BrotliEncoderDictionary* dictionary,
256 SearchInStaticDictionary(dictionary,
hash_longest_match_quickly_inc.h 149 const BrotliEncoderDictionary* dictionary,
252 SearchInStaticDictionary(dictionary,
hash_to_binary_tree_inc.h 203 const BrotliEncoderDictionary* dictionary,
248 if (BrotliFindAllStaticDictionaryMatches(dictionary,
backward_references_hq.c 339 this or greater than |max_backward_limit| + |gap| are static dictionary
458 /* Word dictionary -> ignore. */
529 to this distance. If the distance refers to the static dictionary, or
688 &params->dictionary,
780 &params->dictionary,
encode.c 748 BrotliInitEncoderDictionary(&params->dictionary);
  /xsrc/external/mit/brotli/dist/c/dec/
state.h 13 #include "../common/dictionary.h"
330 const BrotliDictionary* dictionary; member in struct:BrotliDecoderStateStruct
state.c 84 s->dictionary = BrotliGetDictionary();
decode.c 14 #include "../common/dictionary.h"
44 - inserting transformed dictionary word:
1472 /* Compensate double distance-ring-buffer roll for dictionary items. */
1894 /* Apply copy of LZ77 back-reference, or static dictionary reference if
1909 const BrotliDictionary* words = s->dictionary;
1911 int offset = (int)s->dictionary->offsets_by_length[i];
1912 uint32_t shift = s->dictionary->size_bits_by_length[i];
1928 BROTLI_LOG(("[ProcessCommandsInternal] dictionary word: [%.*s]\n",
1933 BROTLI_LOG(("[ProcessCommandsInternal] dictionary word: [%.*s],"
  /xsrc/external/mit/xedit/dist/
ispell.c 129 char *dictionary; member in struct:_ispell
236 {"dictionary", "Dictionary", XtRString, sizeof(char*),
237 Offset(dictionary), XtRString, "american"},
238 {"dictionaries", "Dictionary", XtRString, sizeof(char*),
394 if (ispell.undo_for && strcmp(ispell.undo_for, ispell.dictionary)) {
395 XeditPrintf("Undo: Dictionary changed. Previous undo information lost.\n");
739 /* it only happens when the dictionary is changed */
1315 if (ispell.dictionary && *ispell.dictionary) {
    [all...]
  /xsrc/external/mit/xcb-proto/dist/xcbgen/
xtypes.py 69 there must be a dictionary containing them declared when this module is imported!
1288 opcodes is a dictionary of name -> opcode number, for eventcopies.
1354 opcodes is a dictionary of name -> opcode number, for errorcopies.

Completed in 15 milliseconds