| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| D | trie-search.cc | 403 std::size_t next_pos; in trie_match() local
405 next_pos = trie_->trie_match<T>(get_link(node), query, pos); in trie_match()
407 next_pos = tail_match<T>(node, get_link_id(node), query, pos); in trie_match()
409 if ((next_pos == mismatch()) || (next_pos == pos)) { in trie_match()
410 return next_pos; in trie_match()
412 pos = next_pos; in trie_match()
424 std::size_t next_pos; in trie_match() local
426 next_pos = trie_->trie_match<T>(get_link(node), query, pos); in trie_match()
428 next_pos = tail_match<T>(node, get_link_id(node), query, pos); in trie_match()
430 if ((next_pos == mismatch()) || (next_pos == pos)) { in trie_match()
[all …]
|
| D | trie-inline.h | 163 std::size_t next_pos = has_trie() ? in find_child() local
166 if (next_pos == mismatch()) { in find_child()
168 } else if (next_pos != pos) { in find_child()
169 pos = next_pos; in find_child()
218 std::size_t next_pos = has_trie() ? in predict_child() local
222 if (next_pos == mismatch()) { in predict_child()
224 } else if (next_pos != pos) { in predict_child()
225 pos = next_pos; in predict_child()
|
| /external/marisa-trie/lib/marisa/ |
| D | trie-search.cc | 384 std::size_t next_pos; in trie_match() local
386 next_pos = trie_->trie_match<T>(get_link(node), query, pos); in trie_match()
388 next_pos = tail_match<T>(node, get_link_id(node), query, pos); in trie_match()
390 if ((next_pos == mismatch()) || (next_pos == pos)) { in trie_match()
391 return next_pos; in trie_match()
393 pos = next_pos; in trie_match()
405 std::size_t next_pos; in trie_match() local
407 next_pos = trie_->trie_match<T>(get_link(node), query, pos); in trie_match()
409 next_pos = tail_match<T>(node, get_link_id(node), query, pos); in trie_match()
411 if ((next_pos == mismatch()) || (next_pos == pos)) { in trie_match()
[all …]
|
| D | trie-inline.h | 162 std::size_t next_pos = has_trie() ? in find_child() local
165 if (next_pos == mismatch()) { in find_child()
167 } else if (next_pos != pos) { in find_child()
168 pos = next_pos; in find_child()
213 std::size_t next_pos = has_trie() ? in predict_child() local
217 if (next_pos == mismatch()) { in predict_child()
219 } else if (next_pos != pos) { in predict_child()
220 pos = next_pos; in predict_child()
|
| /external/google-breakpad/src/tools/linux/symupload/ |
| D | sym_upload.cc | 69 string::size_type cur_pos = 0, next_pos = 0; in TokenizeByChar() local
70 while ((next_pos = source_string.find(c, cur_pos)) != string::npos) { in TokenizeByChar()
71 if (next_pos != cur_pos) in TokenizeByChar()
72 results->push_back(source_string.substr(cur_pos, next_pos - cur_pos)); in TokenizeByChar()
73 cur_pos = next_pos + 1; in TokenizeByChar()
75 if (cur_pos < source_string.size() && next_pos != cur_pos) in TokenizeByChar()
|
| /external/aac/libSBRdec/src/ |
| D | env_calc.cpp | 163 int start_pos, int next_pos,
172 int start_pos, int next_pos,
1252 int next_pos, /*!< End of time rage (QMF-timeslot) */ in rescaleSubbandSamples() argument
1259 for (int l=start_pos; l<next_pos; l++) { in rescaleSubbandSamples()
1265 for (int l=start_pos; l<next_pos; l++) { in rescaleSubbandSamples()
1287 int next_pos /*!< End of time rage (QMF-timeslot) */ in maxSubbandSample() argument
1298 for (int l=start_pos; l<next_pos; l++) in maxSubbandSample()
1316 for (int l=start_pos; l<next_pos; l++) { in maxSubbandSample()
1359 … int next_pos, /*!< Last QMF-slot of current envelope + 1 */ in calcNrgPerSubband() argument
1371 invWidth = FX_DBL2FX_SGL(GetInvInt(next_pos - start_pos)); in calcNrgPerSubband()
[all …]
|
| D | env_calc.h | 155 int start_pos, int next_pos,
|
| /external/jsoncpp/devtools/ |
| D | antglob.py | 67 next_pos = 0
73 if match.start(0) != next_pos:
87 next_pos = match.end()
|
| /external/v8/src/crankshaft/ |
| D | lithium-allocator.cc | 1529 LifetimePosition next_pos = position; in AllocateRegisters() local
1530 if (IsGapAt(next_pos.InstructionIndex())) { in AllocateRegisters()
1531 next_pos = next_pos.NextInstruction(); in AllocateRegisters()
1533 UsePosition* pos = current->NextUsePositionRegisterIsBeneficial(next_pos); in AllocateRegisters()
1968 UsePosition* next_pos = range->NextRegisterPosition(current->Start()); in SplitAndSpillIntersecting() local
1970 if (next_pos == NULL) { in SplitAndSpillIntersecting()
1981 SpillBetweenUntil(range, spill_pos, current->Start(), next_pos->pos()); in SplitAndSpillIntersecting()
1995 UsePosition* next_pos = range->NextRegisterPosition(current->Start()); in SplitAndSpillIntersecting() local
1996 if (next_pos == NULL) { in SplitAndSpillIntersecting()
1999 next_intersection = Min(next_intersection, next_pos->pos()); in SplitAndSpillIntersecting()
|
| /external/v8/src/compiler/ |
| D | register-allocator.cc | 2455 LifetimePosition next_pos = start; in SplitAndSpillRangesDefinedByMemoryOperand() local
2456 if (next_pos.IsGapPosition()) { in SplitAndSpillRangesDefinedByMemoryOperand()
2457 next_pos = next_pos.NextStart(); in SplitAndSpillRangesDefinedByMemoryOperand()
2459 UsePosition* pos = range->NextUsePositionRegisterIsBeneficial(next_pos); in SplitAndSpillRangesDefinedByMemoryOperand()
3084 UsePosition* next_pos = range->NextRegisterPosition(current->Start()); in SplitAndSpillIntersecting() local
3086 if (next_pos == nullptr) { in SplitAndSpillIntersecting()
3098 next_pos->pos())); in SplitAndSpillIntersecting()
3099 SpillBetweenUntil(range, spill_pos, current->Start(), next_pos->pos()); in SplitAndSpillIntersecting()
3120 UsePosition* next_pos = range->NextRegisterPosition(current->Start()); in SplitAndSpillIntersecting() local
3121 if (next_pos == nullptr) { in SplitAndSpillIntersecting()
[all …]
|