HomeSort by relevance Sort by last modified time
    Searched refs:nextStart (Results 1 - 25 of 47) sorted by null

1 2

  /external/chromium_org/third_party/skia/experimental/Intersection/
ShapeOps.cpp 20 static Segment* findChaseOp(SkTDArray<Span*>& chase, int& nextStart, int& nextEnd) {
26 nextStart = backPtr.fOtherIndex;
29 if (segment->activeAngle(nextStart, done, angles)) {
31 nextStart = last->start();
85 nextStart = start;
162 int nextStart = index;
164 Segment* next = current->findNextOp(chaseArray, nextStart, nextEnd,
182 index = nextStart;
SimplifyFindNext_Test.cpp 35 int nextStart = startIndex;
40 nextStart, nextEnd, unsortable);
41 pts[1] = next->xyAtT(&next->span(nextStart));
Simplify.cpp     [all...]
  /external/skia/experimental/Intersection/
ShapeOps.cpp 20 static Segment* findChaseOp(SkTDArray<Span*>& chase, int& nextStart, int& nextEnd) {
26 nextStart = backPtr.fOtherIndex;
29 if (segment->activeAngle(nextStart, done, angles)) {
31 nextStart = last->start();
85 nextStart = start;
162 int nextStart = index;
164 Segment* next = current->findNextOp(chaseArray, nextStart, nextEnd,
182 index = nextStart;
SimplifyFindNext_Test.cpp 35 int nextStart = startIndex;
40 nextStart, nextEnd, unsortable);
41 pts[1] = next->xyAtT(&next->span(nextStart));
Simplify.cpp     [all...]
  /external/chromium_org/third_party/skia/src/pathops/
SkPathOpsSimplify.cpp 45 int nextStart = index;
47 SkOpSegment* next = current->findNextWinding(&chase, &nextStart, &nextEnd,
65 index = nextStart;
118 int nextStart = start;
120 SkOpSegment* next = current->findNextXor(&nextStart, &nextEnd, &unsortable);
137 start = nextStart;
SkPathOpsOp.cpp 162 int nextStart = index;
164 SkOpSegment* next = current->findNextOp(&chase, &nextStart, &nextEnd,
187 index = nextStart;
SkOpSegment.cpp     [all...]
SkOpSegment.h 314 SkOpSegment* findNextOp(SkTDArray<SkOpSpan*>* chase, int* nextStart, int* nextEnd,
316 SkOpSegment* findNextWinding(SkTDArray<SkOpSpan*>* chase, int* nextStart, int* nextEnd,
318 SkOpSegment* findNextXor(int* nextStart, int* nextEnd, bool* unsortable);
  /external/skia/src/pathops/
SkPathOpsSimplify.cpp 45 int nextStart = index;
47 SkOpSegment* next = current->findNextWinding(&chase, &nextStart, &nextEnd,
65 index = nextStart;
118 int nextStart = start;
120 SkOpSegment* next = current->findNextXor(&nextStart, &nextEnd, &unsortable);
137 start = nextStart;
SkPathOpsOp.cpp 162 int nextStart = index;
164 SkOpSegment* next = current->findNextOp(&chase, &nextStart, &nextEnd,
187 index = nextStart;
SkOpSegment.cpp     [all...]
SkOpSegment.h 314 SkOpSegment* findNextOp(SkTDArray<SkOpSpan*>* chase, int* nextStart, int* nextEnd,
316 SkOpSegment* findNextWinding(SkTDArray<SkOpSpan*>* chase, int* nextStart, int* nextEnd,
318 SkOpSegment* findNextXor(int* nextStart, int* nextEnd, bool* unsortable);
  /packages/services/Mms/src/com/android/mms/service/
HttpUtils.java 394 int nextStart = 0;
401 if (matchedStart > nextStart) {
402 replaced.append(value.substring(nextStart, matchedStart));
411 nextStart = matcher.end();
413 if (replaced != null && nextStart < value.length()) {
414 replaced.append(value.substring(nextStart));
  /frameworks/compile/slang/
slang_rs_reflect_utils.cpp 403 for (std::size_t start = 0, length = s.length(), nextStart = 0;
404 start < length; start = nextStart) {
410 nextStart = length;
413 nextStart = p + 1;
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/utils/
StringUtils.java 543 int nextStart = 0;
546 sequences.add(charSequence.subSequence(nextStart, matcher.start()));
547 nextStart = matcher.end();
554 sequences.add(charSequence.subSequence(nextStart, charSequence.length()));
  /external/icu/icu4c/source/test/intltest/
srchtest.cpp 358 int32_t nextStart;
364 nextStart = 0;
367 strsrch->following(nextStart, status);
377 nextStart, isOverlap,
394 nextStart, isOverlap,
401 nextStart = strsrch->getMatchedStart() + 1;
403 nextStart = strsrch->getMatchedStart() + strsrch->getMatchedLength();
415 nextStart = strsrch->getText().length();
418 strsrch->preceding(nextStart, status);
427 nextStart, isOverlap
    [all...]
  /external/chromium_org/third_party/icu/source/common/
utrie.c 303 UChar32 nextStart;
311 nextStart=(start+UTRIE_DATA_BLOCK_LENGTH)&~UTRIE_MASK;
312 if(nextStart<=limit) {
315 start=nextStart;
    [all...]
utrie2_builder.c 726 UChar32 nextStart;
735 nextStart=(start+UTRIE2_DATA_BLOCK_LENGTH)&~UTRIE2_DATA_MASK;
736 if(nextStart<=limit) {
739 start=nextStart;
    [all...]
  /external/icu/icu4c/source/common/
utrie.cpp 303 UChar32 nextStart;
311 nextStart=(start+UTRIE_DATA_BLOCK_LENGTH)&~UTRIE_MASK;
312 if(nextStart<=limit) {
315 start=nextStart;
    [all...]
utrie2_builder.cpp 726 UChar32 nextStart;
735 nextStart=(start+UTRIE2_DATA_BLOCK_LENGTH)&~UTRIE2_DATA_MASK;
736 if(nextStart<=limit) {
739 start=nextStart;
    [all...]
  /external/chromium_org/third_party/icu/source/i18n/
chnsecal.cpp 207 int32_t nextStart = newMoonNear(thisStart + SYNODIC_GAP, TRUE);
208 return nextStart - thisStart;
  /external/icu/icu4c/source/i18n/
chnsecal.cpp 239 int32_t nextStart = newMoonNear(thisStart + SYNODIC_GAP, TRUE);
240 return nextStart - thisStart;
  /frameworks/base/core/java/android/util/
PathParser.java 56 end = nextStart(pathData, end);
126 private static int nextStart(String s, int end) {

Completed in 2468 milliseconds

1 2