/external/libtextclassifier/utils/sentencepiece/ |
D | sorted_strings_table.cc | 29 int match_length = 0; in GatherPrefixMatches() local 35 if (match_length >= input.length()) { in GatherPrefixMatches() 45 static_cast<unsigned char>(input[match_length]), in GatherPrefixMatches() 46 [this, match_length](uint32 piece_offset, uint32 c) -> bool { in GatherPrefixMatches() 48 pieces_[piece_offset + match_length]) < c; in GatherPrefixMatches() 53 static_cast<unsigned char>(input[match_length]), in GatherPrefixMatches() 54 [this, match_length](uint32 c, uint32 piece_offset) -> bool { in GatherPrefixMatches() 56 pieces_[piece_offset + match_length]); in GatherPrefixMatches() 63 ++match_length; in GatherPrefixMatches() 67 if (pieces_[offsets_[left] + match_length] == 0) { in GatherPrefixMatches() [all …]
|
D | matcher.h | 27 TrieMatch(int id, int match_length) : id(id), match_length(match_length) {} in TrieMatch() 29 int match_length = -1; member
|
D | double_array_trie_test.cc | 46 EXPECT_EQ(matches[0].match_length, 4 /*hell*/); in TEST() 48 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()
|
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/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/u-boot/lib/zlib/ |
D | deflate.c | 1037 s->match_length = s->prev_length = MIN_MATCH-1; 1555 s->match_length = longest_match (s, hash_head); 1558 if (s->match_length >= MIN_MATCH) { 1559 check_match(s, s->strstart, s->match_start, s->match_length); 1562 s->match_length - MIN_MATCH, bflush); 1564 s->lookahead -= s->match_length; 1570 if (s->match_length <= s->max_insert_length && 1572 s->match_length--; /* string at strstart already in table */ 1579 } while (--s->match_length != 0); 1584 s->strstart += s->match_length; [all …]
|
D | deflate.h | 153 uInt match_length; /* length of best match */ member
|
/external/zlib/src/ |
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 …]
|
D | deflate.h | 159 uInt match_length; /* length of best match */ member
|
/external/harfbuzz_ng/src/ |
D | hb-aat-layout-morx-table.hh | 452 match_length (0) {} in driver_context_t() 467 if (unlikely (match_length >= ARRAY_LENGTH (match_positions))) in transition() 471 if (match_length && match_positions[match_length - 1] == buffer->out_len) in transition() 472 match_length--; in transition() 474 match_positions[match_length++] = buffer->out_len; in transition() 480 DEBUG_MSG (APPLY, nullptr, "Perform action with %u", match_length); in transition() 483 if (unlikely (!match_length)) in transition() 489 unsigned int cursor = match_length; in transition() 503 match_length = 0; in transition() 536 unsigned int lig_end = match_positions[match_length - 1] + 1; in transition() [all …]
|
D | hb-ot-layout-gsubgpos.hh | 894 unsigned int match_length, in ligate_input() argument 902 buffer->merge_clusters (buffer->idx, buffer->idx + match_length); in ligate_input() 1081 unsigned int match_length) in apply_lookup() argument 1092 end = bl + match_length; in apply_lookup() 1275 unsigned int match_length = 0; in context_apply_lookup() local 1280 &match_length, match_positions) in context_apply_lookup() 1281 && (c->buffer->unsafe_to_break (c->buffer->idx, c->buffer->idx + match_length), in context_apply_lookup() 1285 match_length)); in context_apply_lookup() 1916 unsigned int start_index = 0, match_length = 0, end_index = 0; in chain_context_apply_lookup() local 1921 &match_length, match_positions) in chain_context_apply_lookup() [all …]
|
D | hb-ot-layout-gsub-table.hh | 738 unsigned int match_length = 0; in apply() local 745 &match_length, in apply() 753 match_length, in apply()
|
/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()
|
/external/v8/src/runtime/ |
D | runtime-regexp.cc | 1834 const int match_length = match->length(); in RUNTIME_FUNCTION() local 1915 next_source_position = position + match_length; in RUNTIME_FUNCTION()
|
/external/v8/src/builtins/ |
D | builtins-regexp-gen.cc | 1932 TNode<Smi> const match_length = LoadStringLengthAsSmi(match); in RegExpPrototypeMatchBody() local 1933 GotoIfNot(SmiEqual(match_length, SmiZero()), &loop); in RegExpPrototypeMatchBody()
|