/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | ShapeOps.cpp | 20 static Segment* findChaseOp(SkTDArray<Span*>& chase, int& nextStart, int& nextEnd) { argument 26 nextStart = backPtr.fOtherIndex; 29 if (segment->activeAngle(nextStart, done, angles)) { 31 nextStart = last->start(); 85 nextStart = start; 162 int nextStart = index; local 164 Segment* next = current->findNextOp(chaseArray, nextStart, nextEnd, 182 index = nextStart;
|
H A D | SimplifyFindNext_Test.cpp | 35 int nextStart = startIndex; local 40 nextStart, nextEnd, unsortable); 41 pts[1] = next->xyAtT(&next->span(nextStart));
|
H A D | Simplify.cpp | 2402 Segment* findNextOp(SkTDArray<Span*>& chase, int& nextStart, int& nextEnd, 2404 const int startIndex = nextStart; 2426 nextStart = endSpan->fOtherIndex; 2427 double startT = other->fTs[nextStart].fT; 2428 nextEnd = nextStart; 2513 nextStart = foundAngle->start(); 2519 __FUNCTION__, debugID(), nextSegment->debugID(), nextStart, nextEnd); 2524 Segment* findNextWinding(SkTDArray<Span*>& chase, int& nextStart, int& nextEnd, 2526 const int startIndex = nextStart; 2548 nextStart [all...] |
/external/skia/experimental/Intersection/ |
H A D | ShapeOps.cpp | 20 static Segment* findChaseOp(SkTDArray<Span*>& chase, int& nextStart, int& nextEnd) { argument 26 nextStart = backPtr.fOtherIndex; 29 if (segment->activeAngle(nextStart, done, angles)) { 31 nextStart = last->start(); 85 nextStart = start; 162 int nextStart = index; local 164 Segment* next = current->findNextOp(chaseArray, nextStart, nextEnd, 182 index = nextStart;
|
H A D | SimplifyFindNext_Test.cpp | 35 int nextStart = startIndex; local 40 nextStart, nextEnd, unsortable); 41 pts[1] = next->xyAtT(&next->span(nextStart));
|
H A D | Simplify.cpp | 2402 Segment* findNextOp(SkTDArray<Span*>& chase, int& nextStart, int& nextEnd, 2404 const int startIndex = nextStart; 2426 nextStart = endSpan->fOtherIndex; 2427 double startT = other->fTs[nextStart].fT; 2428 nextEnd = nextStart; 2513 nextStart = foundAngle->start(); 2519 __FUNCTION__, debugID(), nextSegment->debugID(), nextStart, nextEnd); 2524 Segment* findNextWinding(SkTDArray<Span*>& chase, int& nextStart, int& nextEnd, 2526 const int startIndex = nextStart; 2548 nextStart [all...] |
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkPathOpsSimplify.cpp | 45 int nextStart = index; local 47 SkOpSegment* next = current->findNextWinding(&chase, &nextStart, &nextEnd, 65 index = nextStart; 118 int nextStart = start; local 120 SkOpSegment* next = current->findNextXor(&nextStart, &nextEnd, &unsortable); 137 start = nextStart;
|
H A D | SkPathOpsOp.cpp | 162 int nextStart = index; local 164 SkOpSegment* next = current->findNextOp(&chase, &nextStart, &nextEnd, 187 index = nextStart;
|
H A D | SkOpSegment.cpp | 2674 SkOpSegment* SkOpSegment::findNextOp(SkTDArray<SkOpSpan*>* chase, int* nextStart, int* nextEnd, 2677 const int startIndex = *nextStart; 2683 *nextStart = startIndex; 2684 SkOpSegment* other = isSimple(nextStart, &step); 2697 double startT = other->fTs[*nextStart].fT; 2698 *nextEnd = *nextStart; 2703 if (other->isTiny(SkMin32(*nextStart, *nextEnd))) { 2794 *nextStart = foundAngle->start(); 2799 __FUNCTION__, debugID(), nextSegment->debugID(), *nextStart, *nextEnd); 2804 SkOpSegment* SkOpSegment::findNextWinding(SkTDArray<SkOpSpan*>* chase, int* nextStart, [all...] |
H A D | 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/ |
H A D | SkPathOpsSimplify.cpp | 45 int nextStart = index; local 47 SkOpSegment* next = current->findNextWinding(&chase, &nextStart, &nextEnd, 65 index = nextStart; 118 int nextStart = start; local 120 SkOpSegment* next = current->findNextXor(&nextStart, &nextEnd, &unsortable); 137 start = nextStart;
|
H A D | SkPathOpsOp.cpp | 162 int nextStart = index; local 164 SkOpSegment* next = current->findNextOp(&chase, &nextStart, &nextEnd, 187 index = nextStart;
|
H A D | SkOpSegment.cpp | 2674 SkOpSegment* SkOpSegment::findNextOp(SkTDArray<SkOpSpan*>* chase, int* nextStart, int* nextEnd, 2677 const int startIndex = *nextStart; 2683 *nextStart = startIndex; 2684 SkOpSegment* other = isSimple(nextStart, &step); 2697 double startT = other->fTs[*nextStart].fT; 2698 *nextEnd = *nextStart; 2703 if (other->isTiny(SkMin32(*nextStart, *nextEnd))) { 2794 *nextStart = foundAngle->start(); 2799 __FUNCTION__, debugID(), nextSegment->debugID(), *nextStart, *nextEnd); 2804 SkOpSegment* SkOpSegment::findNextWinding(SkTDArray<SkOpSpan*>* chase, int* nextStart, [all...] |
H A D | 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/icu/icu4c/source/test/intltest/ |
H A D | srchtest.cpp | 358 int32_t nextStart; local 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, isOverla [all...] |
/external/chromium_org/third_party/icu/source/common/ |
H A D | utrie.c | 303 UChar32 nextStart; local 311 nextStart=(start+UTRIE_DATA_BLOCK_LENGTH)&~UTRIE_MASK; 312 if(nextStart<=limit) { 315 start=nextStart;
|
H A D | utrie2_builder.c | 726 UChar32 nextStart; local 735 nextStart=(start+UTRIE2_DATA_BLOCK_LENGTH)&~UTRIE2_DATA_MASK; 736 if(nextStart<=limit) { 739 start=nextStart;
|
/external/icu/icu4c/source/common/ |
H A D | utrie.cpp | 303 UChar32 nextStart; local 311 nextStart=(start+UTRIE_DATA_BLOCK_LENGTH)&~UTRIE_MASK; 312 if(nextStart<=limit) { 315 start=nextStart;
|
H A D | utrie2_builder.cpp | 726 UChar32 nextStart; local 735 nextStart=(start+UTRIE2_DATA_BLOCK_LENGTH)&~UTRIE2_DATA_MASK; 736 if(nextStart<=limit) { 739 start=nextStart;
|
/external/chromium_org/third_party/icu/source/i18n/ |
H A D | chnsecal.cpp | 207 int32_t nextStart = newMoonNear(thisStart + SYNODIC_GAP, TRUE); local 208 return nextStart - thisStart;
|
/external/icu/icu4c/source/i18n/ |
H A D | chnsecal.cpp | 239 int32_t nextStart = newMoonNear(thisStart + SYNODIC_GAP, TRUE); local 240 return nextStart - thisStart;
|
H A D | vtzone.cpp | 2113 UDate nextStart; local 2114 UBool nextStartAvail = finalDstRule->getNextStart(dstUntilTime, dstFromOffset - dstFromDSTSavings, dstFromDSTSavings, false, nextStart); 2118 dstFromOffset - dstFromDSTSavings, dstFromDSTSavings, nextStart, status); 2155 UDate nextStart; local 2156 UBool nextStartAvail = finalStdRule->getNextStart(stdUntilTime, stdFromOffset - stdFromDSTSavings, stdFromDSTSavings, false, nextStart); 2160 stdFromOffset - stdFromDSTSavings, stdFromDSTSavings, nextStart, status);
|
/external/icu/icu4c/source/test/cintltst/ |
H A D | usrchtst.c | 345 int32_t nextStart; local 446 nextStart = 0; 449 usearch_following(strsrch, nextStart, &status); 458 nextStart, isOverlap, 476 nextStart, isOverlap, 483 nextStart = usearch_getMatchedStart(strsrch) + 1; 485 nextStart = usearch_getMatchedStart(strsrch) + usearch_getMatchedLength(strsrch); 497 usearch_getText(strsrch, &nextStart); 500 usearch_preceding(strsrch, nextStart, &status); 509 nextStart, isOverla [all...] |
/external/zxing/core/ |
H A D | core.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/zxing/ com/google/zxing/aztec/ ... |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | com.ibm.icu_4.2.1.v20100412.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |