| /external/pdfium/xfa/src/fxbarcode/oned/ |
| D | BC_OnedCodaBarReader.cpp | 50 int32_t nextStart = (*start)[1]; in DecodeRow() local
52 while (nextStart < end && !row->Get(nextStart)) { in DecodeRow()
53 nextStart++; in DecodeRow()
61 RecordPattern(row, nextStart, &counters, e); in DecodeRow()
69 lastStart = nextStart; in DecodeRow()
71 nextStart += counters[i]; in DecodeRow()
73 while (nextStart < end && !row->Get(nextStart)) { in DecodeRow()
74 nextStart++; in DecodeRow()
76 } while (nextStart < end); in DecodeRow()
81 int32_t whiteSpaceAfterEnd = nextStart - lastStart - lastPatternSize; in DecodeRow()
[all …]
|
| D | BC_OnedCode128Reader.cpp | 204 int32_t nextStart = (*startPatternInfo)[1]; in DecodeRow() local
221 code = DecodeCode(row, &counters, nextStart, e); in DecodeRow()
230 lastStart = nextStart; in DecodeRow()
232 nextStart += counters[i]; in DecodeRow()
339 while (nextStart < width && row->Get(nextStart)) { in DecodeRow()
340 nextStart++; in DecodeRow()
343 nextStart, std::min(width, nextStart + (nextStart - lastStart) / 2), in DecodeRow()
|
| D | BC_OnedCode39Reader.cpp | 58 int32_t nextStart = (*start)[1]; in DecodeRow() local
64 while (nextStart < end && !row->Get(nextStart)) { in DecodeRow()
65 nextStart++; in DecodeRow()
73 RecordPattern(row, nextStart, &counters, e); in DecodeRow()
83 lastStart = nextStart; in DecodeRow()
85 nextStart += counters[i]; in DecodeRow()
87 while (nextStart < end && !row->Get(nextStart)) { in DecodeRow()
88 nextStart++; in DecodeRow()
|
| D | BC_OneDimReader.cpp | 51 int32_t nextStart = 0; in FindStartGuardPattern() local
57 startRange = FindGuardPattern(row, nextStart, FALSE, &startEndPattern, e); in FindStartGuardPattern()
60 nextStart = (*startRange)[1]; in FindStartGuardPattern()
64 int32_t quietStart = start - (nextStart - start); in FindStartGuardPattern()
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| D | Trie2.java | 849 nextStart = 0; in Trie2Iterator()
861 nextStart = (leadSurrogate - 0xd7c0) << 10; in Trie2Iterator()
862 limitCP = nextStart + 0x400; in Trie2Iterator()
875 if (nextStart >= limitCP) { in next()
879 nextStart = 0xd800; in next()
887 val = get(nextStart); in next()
889 endOfRange = rangeEnd(nextStart, limitCP, val); in next()
904 val = getFromU16SingleLead((char)nextStart); in next()
906 endOfRange = rangeEndLS((char)nextStart); in next()
920 returnValue.startCodePoint = nextStart; in next()
[all …]
|
| D | IntTrieBuilder.java | 424 int nextStart = (start + DATA_BLOCK_LENGTH) & ~MASK_; in setRange() local
425 if (nextStart <= limit) { in setRange()
428 start = nextStart; in setRange()
|
| D | Trie2Writable.java | 412 int /*UChar32*/ nextStart; in setRange() local
417 nextStart=(start+UTRIE2_DATA_BLOCK_LENGTH)&~UTRIE2_DATA_MASK; in setRange()
418 if(nextStart<=limit) { in setRange()
421 start=nextStart; in setRange()
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| D | Trie2.java | 847 nextStart = 0; in Trie2Iterator()
859 nextStart = (leadSurrogate - 0xd7c0) << 10; in Trie2Iterator()
860 limitCP = nextStart + 0x400; in Trie2Iterator()
873 if (nextStart >= limitCP) { in next()
877 nextStart = 0xd800; in next()
885 val = get(nextStart); in next()
887 endOfRange = rangeEnd(nextStart, limitCP, val); in next()
902 val = getFromU16SingleLead((char)nextStart); in next()
904 endOfRange = rangeEndLS((char)nextStart); in next()
918 returnValue.startCodePoint = nextStart; in next()
[all …]
|
| D | IntTrieBuilder.java | 422 int nextStart = (start + DATA_BLOCK_LENGTH) & ~MASK_; in setRange() local
423 if (nextStart <= limit) { in setRange()
426 start = nextStart; in setRange()
|
| D | Trie2Writable.java | 410 int /*UChar32*/ nextStart; in setRange() local
415 nextStart=(start+UTRIE2_DATA_BLOCK_LENGTH)&~UTRIE2_DATA_MASK; in setRange()
416 if(nextStart<=limit) { in setRange()
419 start=nextStart; in setRange()
|
| /external/skia/src/pathops/ |
| D | SkPathOpsSimplify.cpp | 32 SkOpSpanBase* nextStart = start; in bridgeWinding() local
34 SkOpSegment* next = current->findNextWinding(&chase, &nextStart, &nextEnd, in bridgeWinding()
60 start = nextStart; in bridgeWinding()
117 SkOpSpanBase* nextStart = start; in bridgeXor() local
119 SkOpSegment* next = current->findNextXor(&nextStart, &nextEnd, &unsortable); in bridgeXor()
144 start = nextStart; in bridgeXor()
|
| D | SkOpSegment.cpp | 620 SkOpSegment* SkOpSegment::findNextOp(SkTDArray<SkOpSpanBase*>* chase, SkOpSpanBase** nextStart, in findNextOp() argument
622 SkOpSpanBase* start = *nextStart; in findNextOp()
626 SkOpSegment* other = this->isSimple(nextStart, &step); // advances nextStart in findNextOp()
638 *nextEnd = step > 0 ? (*nextStart)->upCast()->next() : (*nextStart)->prev(); in findNextOp()
641 SkOpSpanBase* endNear = step > 0 ? (*nextStart)->upCast()->next() : (*nextStart)->prev(); in findNextOp()
715 *nextStart = foundAngle->start(); in findNextOp()
720 __FUNCTION__, debugID(), nextSegment->debugID(), *nextStart, *nextEnd); in findNextOp()
726 SkOpSpanBase** nextStart, SkOpSpanBase** nextEnd, bool* unsortable) { in findNextWinding() argument
727 SkOpSpanBase* start = *nextStart; in findNextWinding()
731 SkOpSegment* other = this->isSimple(nextStart, &step); // advances nextStart in findNextWinding()
[all …]
|
| D | SkOpSegment.h | 204 SkOpSegment* findNextOp(SkTDArray<SkOpSpanBase*>* chase, SkOpSpanBase** nextStart,
207 SkOpSegment* findNextWinding(SkTDArray<SkOpSpanBase*>* chase, SkOpSpanBase** nextStart,
209 SkOpSegment* findNextXor(SkOpSpanBase** nextStart, SkOpSpanBase** nextEnd, bool* unsortable);
|
| D | SkPathOpsOp.cpp | 106 SkOpSpanBase* nextStart = start; in bridgeOp() local
108 SkOpSegment* next = current->findNextOp(&chase, &nextStart, &nextEnd, in bridgeOp()
134 start = nextStart; in bridgeOp()
|
| /external/dagger2/compiler/src/main/java/dagger/internal/codegen/writer/ |
| D | IndentingAppendable.java | 78 int nextStart = index; in lines() local
86 return nextStart >= end in lines()
88 : csq.subSequence(nextStart, nextEnd); in lines()
|
| /external/guava/guava-gwt/src-super/com/google/common/base/super/com/google/common/base/ |
| D | Splitter.java | 499 int nextStart = offset;
501 int start = nextStart;
512 if (offset == nextStart) {
536 nextStart = offset;
|
| /external/guava/guava/src/com/google/common/base/ |
| D | Splitter.java | 557 int nextStart = offset;
559 int start = nextStart;
570 if (offset == nextStart) {
594 nextStart = offset;
|
| /external/icu/icu4c/source/test/intltest/ |
| D | srchtest.cpp | 358 int32_t nextStart; in assertEqualWithStringSearch() local
364 nextStart = 0; in assertEqualWithStringSearch()
367 strsrch->following(nextStart, status); in assertEqualWithStringSearch()
377 nextStart, isOverlap, in assertEqualWithStringSearch()
394 nextStart, isOverlap, in assertEqualWithStringSearch()
401 nextStart = strsrch->getMatchedStart() + 1; in assertEqualWithStringSearch()
403 nextStart = strsrch->getMatchedStart() + strsrch->getMatchedLength(); in assertEqualWithStringSearch()
415 nextStart = strsrch->getText().length(); in assertEqualWithStringSearch()
418 strsrch->preceding(nextStart, status); in assertEqualWithStringSearch()
427 nextStart, isOverlap, in assertEqualWithStringSearch()
[all …]
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| D | VTimeZone.java | 1429 Date nextStart = finalDstRule.getNextStart(dstUntilTime, in writeZone() local
1432 assert nextStart != null; in writeZone()
1433 if (nextStart != null) { in writeZone()
1435 … dstFromOffset - dstFromDSTSavings, dstFromDSTSavings, nextStart.getTime()); in writeZone()
1464 Date nextStart = finalStdRule.getNextStart(stdUntilTime, in writeZone() local
1467 assert nextStart != null; in writeZone()
1468 if (nextStart != null) { in writeZone()
1470 … stdFromOffset - stdFromDSTSavings, stdFromDSTSavings, nextStart.getTime()); in writeZone()
|
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| D | VTimeZone.java | 1398 Date nextStart = finalDstRule.getNextStart(dstUntilTime, in writeZone() local
1401 assert nextStart != null; in writeZone()
1402 if (nextStart != null) { in writeZone()
1404 … dstFromOffset - dstFromDSTSavings, dstFromDSTSavings, nextStart.getTime()); in writeZone()
1433 Date nextStart = finalStdRule.getNextStart(stdUntilTime, in writeZone() local
1436 assert nextStart != null; in writeZone()
1437 if (nextStart != null) { in writeZone()
1439 … stdFromOffset - stdFromDSTSavings, stdFromDSTSavings, nextStart.getTime()); in writeZone()
|
| D | ChineseCalendar.java | 452 int nextStart = newMoonNear(thisStart + SYNODIC_GAP, true); in handleGetMonthLength() local
453 return nextStart - thisStart; in handleGetMonthLength()
|
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/util/ |
| D | TrieMap.java | 109 abstract boolean nextStart(); in nextStart() method in TrieMap.Matcher
257 public boolean nextStart() { in nextStart() method in TrieMap.BytesTrieMap.BytesMatcher
435 public boolean nextStart() { in nextStart() method in TrieMap.CharsTrieMap.CharsMatcher
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/util/ |
| D | TrieMap.java | 110 abstract boolean nextStart(); in nextStart() method in TrieMap.Matcher
258 public boolean nextStart() { in nextStart() method in TrieMap.BytesTrieMap.BytesMatcher
436 public boolean nextStart() { in nextStart() method in TrieMap.CharsTrieMap.CharsMatcher
|
| /external/icu/icu4c/source/test/cintltst/ |
| D | usrchtst.c | 345 int32_t nextStart; in assertEqualWithUStringSearch() local
446 nextStart = 0; in assertEqualWithUStringSearch()
449 usearch_following(strsrch, nextStart, &status); in assertEqualWithUStringSearch()
458 nextStart, isOverlap, in assertEqualWithUStringSearch()
476 nextStart, isOverlap, in assertEqualWithUStringSearch()
483 nextStart = usearch_getMatchedStart(strsrch) + 1; in assertEqualWithUStringSearch()
485 nextStart = usearch_getMatchedStart(strsrch) + usearch_getMatchedLength(strsrch); in assertEqualWithUStringSearch()
497 usearch_getText(strsrch, &nextStart); in assertEqualWithUStringSearch()
500 usearch_preceding(strsrch, nextStart, &status); in assertEqualWithUStringSearch()
509 nextStart, isOverlap, in assertEqualWithUStringSearch()
[all …]
|
| /external/icu/icu4c/source/common/ |
| D | utrie.cpp | 303 UChar32 nextStart; in utrie_setRange32() local
311 nextStart=(start+UTRIE_DATA_BLOCK_LENGTH)&~UTRIE_MASK; in utrie_setRange32()
312 if(nextStart<=limit) { in utrie_setRange32()
315 start=nextStart; in utrie_setRange32()
|