/external/rust/crates/libz-sys/src/zlib-ng/ |
D | deflate_medium.c | 18 uint16_t match_length; member 27 if (match.match_length < MIN_MATCH) { in emit_match() 28 while (match.match_length) { in emit_match() 32 match.match_length--; in emit_match() 37 check_match(s, match.strstart, match.match_start, match.match_length); in emit_match() 39 …bflush += zng_tr_tally_dist(s, match.strstart - match.match_start, match.match_length - MIN_MATCH); in emit_match() 41 s->lookahead -= match.match_length; in emit_match() 46 if (UNLIKELY(s->lookahead <= (unsigned int)(match.match_length + MIN_MATCH))) in insert_match() 50 if (LIKELY(match.match_length < MIN_MATCH)) { in insert_match() 52 match.match_length--; in insert_match() [all …]
|
/external/libtextclassifier/native/utils/container/ |
D | sorted-strings-table.cc | 31 int match_length = 0; in GatherPrefixMatches() local 37 if (match_length >= input.length()) { in GatherPrefixMatches() 47 static_cast<unsigned char>(input[match_length]), in GatherPrefixMatches() 48 [this, match_length](uint32 piece_offset, uint32 c) -> bool { in GatherPrefixMatches() 50 pieces_[piece_offset + match_length]) < in GatherPrefixMatches() 56 static_cast<unsigned char>(input[match_length]), in GatherPrefixMatches() 57 [this, match_length](uint32 c, uint32 piece_offset) -> bool { in GatherPrefixMatches() 60 pieces_[piece_offset + match_length]); in GatherPrefixMatches() 67 ++match_length; in GatherPrefixMatches() 71 if (pieces_[LittleEndian::ToHost32(offsets_[left]) + match_length] == 0) { in GatherPrefixMatches() [all …]
|
D | string-set.h | 30 Match(int id, int match_length) : id(id), match_length(match_length) {} in Match() 32 int match_length = -1; member 49 match.match_length == input.length()) { in Find()
|
D | double-array-trie_test.cc | 47 EXPECT_EQ(matches[0].match_length, 4 /*hell*/); in TEST() 49 EXPECT_EQ(matches[1].match_length, 5 /*hello*/); in TEST()
|
D | sorted-strings-table_test.cc | 40 EXPECT_EQ(matches[0].match_length, 4 /*hell*/); in TEST() 42 EXPECT_EQ(matches[1].match_length, 5 /*hello*/); in TEST()
|
/external/libchrome/base/i18n/ |
D | string_search.cc | 41 const string16& in_this, size_t* match_index, size_t* match_length) { in Search() argument 56 if (match_length) in Search() 57 *match_length = find_this_.size(); in Search() 67 if (match_length) in Search() 68 *match_length = static_cast<size_t>(usearch_getMatchedLength(search_)); in Search() 75 size_t* match_length) { in StringSearchIgnoringCaseAndAccents() argument 77 in_this, match_index, match_length); in StringSearchIgnoringCaseAndAccents()
|
D | string_search.h | 29 size_t* match_length); 45 size_t* match_length);
|
/external/tflite-support/tensorflow_lite_support/custom_ops/kernel/sentencepiece/ |
D | double_array_trie.h | 43 Match(int id, int match_length) : id(id), match_length(match_length) {} in Match() 45 int match_length = -1; member 46 bool empty() const { return match_length == -1; } in empty() 48 return m.id == id && m.match_length == match_length;
|
D | optimized_encoder.cc | 87 return std::make_tuple(max_match.match_length, in find_replacement() 183 LatticeElement& target_element = lattice[i + m.match_length]; in EncodeNormalizedString()
|
/external/apache-commons-bcel/src/main/java/org/apache/bcel/generic/ |
D | Select.java | 66 protected int match_length; // number of cases TODO could be package-protected? field in Select 101 if ((match_length = match.length) != targets.length) { in Select() 105 indices = new int[match_length]; in Select() 170 for (int i = 0; i < match_length; i++) { in toString() 328 return match_length; in getMatch_length() 336 final int setMatch_length(final int match_length) { in setMatch_length() argument 337 this.match_length = match_length; in setMatch_length() 338 return match_length; in setMatch_length()
|
D | SWITCH.java | 32 private int match_length; field in SWITCH 53 if ((match_length = match.length) < 2) { in SWITCH() 56 sort(0, match_length - 1); in SWITCH() 73 final int max_size = match_length + match_length * max_gap; in fillup() 79 for (int i = 1; i < match_length; i++) { in fillup() 138 for (int i = 1; i < match_length; i++) { in matchIsOrdered()
|
/external/mesa3d/src/gallium/drivers/r300/compiler/tests/ |
D | rc_test_helpers.c | 76 static int match_length(regmatch_t * matches, int index) in match_length() function 153 tokens.Negate.Length = match_length(matches, 1); in init_rc_normal_src() 155 tokens.Abs.Length = match_length(matches, 2); in init_rc_normal_src() 157 tokens.File.Length = match_length(matches, 3); in init_rc_normal_src() 159 tokens.Index.Length = match_length(matches, 4); in init_rc_normal_src() 161 tokens.Swizzle.Length = match_length(matches, 5); in init_rc_normal_src() 281 tokens.File.Length = match_length(matches, 1); in init_rc_normal_dst() 283 tokens.Index.Length = match_length(matches, 2); in init_rc_normal_dst() 285 tokens.WriteMask.Length = match_length(matches, 3); in init_rc_normal_dst() 386 tokens.Opcode.Length = match_length(matches, 1); in parse_rc_normal_instruction() [all …]
|
/external/libwebsockets/win32port/zlib/ |
D | deflate.c | 1051 s->match_length = s->prev_length = MIN_MATCH-1; 1569 s->match_length = longest_match (s, hash_head); 1572 if (s->match_length >= MIN_MATCH) { 1573 check_match(s, s->strstart, s->match_start, s->match_length); 1576 s->match_length - MIN_MATCH, bflush); 1578 s->lookahead -= s->match_length; 1584 if (s->match_length <= s->max_insert_length && 1586 s->match_length--; /* string at strstart already in table */ 1593 } while (--s->match_length != 0); 1598 s->strstart += s->match_length; [all …]
|
D | deflate.h | 153 uInt match_length; /* length of best match */ member
|
/external/rust/crates/libz-sys/src/zlib/ |
D | deflate.c | 436 s->match_length = s->prev_length = MIN_MATCH-1; 1212 s->match_length = s->prev_length = MIN_MATCH-1; 1861 s->match_length = longest_match (s, hash_head); 1864 if (s->match_length >= MIN_MATCH) { 1865 check_match(s, s->strstart, s->match_start, s->match_length); 1868 s->match_length - MIN_MATCH, bflush); 1870 s->lookahead -= s->match_length; 1876 if (s->match_length <= s->max_insert_length && 1878 s->match_length--; /* string at strstart already in table */ 1885 } while (--s->match_length != 0); [all …]
|
D | deflate.h | 159 uInt match_length; /* length of best match */ member
|
/external/python/cpython2/Modules/zlib/ |
D | deflate.c | 436 s->match_length = s->prev_length = MIN_MATCH-1; 1212 s->match_length = s->prev_length = MIN_MATCH-1; 1861 s->match_length = longest_match (s, hash_head); 1864 if (s->match_length >= MIN_MATCH) { 1865 check_match(s, s->strstart, s->match_start, s->match_length); 1868 s->match_length - MIN_MATCH, bflush); 1870 s->lookahead -= s->match_length; 1876 if (s->match_length <= s->max_insert_length && 1878 s->match_length--; /* string at strstart already in table */ 1885 } while (--s->match_length != 0); [all …]
|
/external/zlib/ |
D | deflate.c | 482 s->match_length = s->prev_length = MIN_MATCH-1; 1257 s->match_length = s->prev_length = MIN_MATCH-1; 1937 s->match_length = longest_match (s, hash_head); 1940 if (s->match_length >= MIN_MATCH) { 1941 check_match(s, s->strstart, s->match_start, s->match_length); 1944 s->match_length - MIN_MATCH, bflush); 1946 s->lookahead -= s->match_length; 1952 if (s->match_length <= s->max_insert_length && 1954 s->match_length--; /* string at strstart already in table */ 1961 } while (--s->match_length != 0); [all …]
|
/external/libtextclassifier/native/utils/grammar/parsing/ |
D | matcher.cc | 99 int match_length = 0; in FindTerminal() local 115 [strings, match_length](uint32 string_offset, uint32 c) -> bool { in FindTerminal() 117 strings[string_offset + match_length]) < in FindTerminal() 124 [strings, match_length](uint32 c, uint32 string_offset) -> bool { in FindTerminal() 127 strings[string_offset + match_length]); in FindTerminal() 134 ++match_length; in FindTerminal() 140 if (strings[string_offset + match_length] == 0) { in FindTerminal()
|
/external/harfbuzz_ng/src/ |
D | hb-aat-layout-morx-table.hh | 449 match_length (0) {} in driver_context_t() 465 …if (match_length && match_positions[(match_length - 1u) % ARRAY_LENGTH (match_positions)] == buffe… in transition() 466 match_length--; in transition() 468 match_positions[match_length++ % ARRAY_LENGTH (match_positions)] = buffer->out_len; in transition() 474 DEBUG_MSG (APPLY, nullptr, "Perform action with %u", match_length); in transition() 477 if (unlikely (!match_length)) in transition() 483 unsigned int cursor = match_length; in transition() 497 match_length = 0; in transition() 530 … unsigned int lig_end = match_positions[(match_length - 1u) % ARRAY_LENGTH (match_positions)] + 1u; in transition() 532 while (match_length - 1u > cursor) in transition() [all …]
|
D | hb-ot-layout-gsubgpos.hh | 901 unsigned int match_length, in ligate_input() argument 909 buffer->merge_clusters (buffer->idx, buffer->idx + match_length); in ligate_input() 1088 unsigned int match_length) in apply_lookup() argument 1099 end = bl + match_length; in apply_lookup() 1282 unsigned int match_length = 0; in context_apply_lookup() local 1287 &match_length, match_positions) in context_apply_lookup() 1288 && (c->buffer->unsafe_to_break (c->buffer->idx, c->buffer->idx + match_length), in context_apply_lookup() 1292 match_length)); in context_apply_lookup() 1915 unsigned int start_index = 0, match_length = 0, end_index = 0; in chain_context_apply_lookup() local 1920 &match_length, match_positions) in chain_context_apply_lookup() [all …]
|
/external/libtextclassifier/native/utils/sentencepiece/ |
D | normalizer.cc | 125 const bool no_match = match.match_length <= 0; in NormalizePrefix() 146 prefix->second = match.match_length; in NormalizePrefix()
|
D | encoder.cc | 68 const int pos = i + match.match_length; in Encode()
|
/external/zstd/doc/educational_decoder/ |
D | zstd_decompress.c | 327 u32 match_length; member 379 size_t match_length, size_t total_output, 1150 seq.match_length = in decode_sequence() 1250 size_t const match_length = seq.match_length; in execute_sequences() local 1252 execute_match_copy(ctx, offset, match_length, total_output, out); in execute_sequences() 1254 total_output += match_length; in execute_sequences() 1333 size_t match_length, size_t total_output, in execute_match_copy() argument 1335 u8 *write_ptr = IO_get_write_ptr(out, match_length); in execute_match_copy() 1348 MIN(offset - total_output, match_length); in execute_match_copy() 1354 match_length -= dict_copy; in execute_match_copy() [all …]
|
/external/apache-commons-bcel/src/main/java/org/apache/bcel/util/ |
D | InstructionFinder.java | 164 private InstructionHandle[] getMatch( final int matched_from, final int match_length ) { in getMatch() argument 165 final InstructionHandle[] match = new InstructionHandle[match_length]; in getMatch() 166 System.arraycopy(handles, matched_from, match, 0, match_length); in getMatch()
|