HomeSort by relevance Sort by last modified time
    Searched refs:nextEnd (Results 1 - 11 of 11) sorted by null

  /external/dagger2/compiler/src/main/java/dagger/internal/codegen/writer/
IndentingAppendable.java 85 int nextEnd = index;
88 : csq.subSequence(nextStart, nextEnd);
  /external/skia/src/pathops/
SkPathOpsSimplify.cpp 32 SkOpSpanBase* nextEnd = end;
33 SkOpSegment* next = current->findNextWinding(&chase, &nextStart, &nextEnd,
48 end = nextEnd;
109 SkOpSpanBase* nextEnd = end;
110 SkOpSegment* next = current->findNextXor(&nextStart, &nextEnd,
125 end = nextEnd;
SkPathOpsOp.cpp 131 SkOpSpanBase* nextEnd = end;
133 SkOpSegment* next = current->findNextOp(&chase, &nextStart, &nextEnd,
162 end = nextEnd;
SkOpSegment.cpp 539 SkOpSpanBase** nextEnd, bool* unsortable, bool* simple,
542 SkOpSpanBase* end = *nextEnd;
557 *nextEnd = step > 0 ? (*nextStart)->upCast()->next() : (*nextStart)->prev();
636 *nextEnd = foundAngle->end();
640 __FUNCTION__, debugID(), nextSegment->debugID(), *nextStart, *nextEnd);
646 SkOpSpanBase** nextStart, SkOpSpanBase** nextEnd, bool* unsortable) {
648 SkOpSpanBase* end = *nextEnd;
663 *nextEnd = step > 0 ? (*nextStart)->upCast()->next() : (*nextStart)->prev();
732 *nextEnd = foundAngle->end();
736 __FUNCTION__, debugID(), nextSegment->debugID(), *nextStart, *nextEnd);
    [all...]
SkOpSegment.h 215 SkOpSpanBase** nextEnd, bool* unsortable, bool* simple,
218 SkOpSpanBase** nextEnd, bool* unsortable);
219 SkOpSegment* findNextXor(SkOpSpanBase** nextStart, SkOpSpanBase** nextEnd, bool* unsortable);
  /external/skqp/src/pathops/
SkPathOpsSimplify.cpp 32 SkOpSpanBase* nextEnd = end;
33 SkOpSegment* next = current->findNextWinding(&chase, &nextStart, &nextEnd,
48 end = nextEnd;
109 SkOpSpanBase* nextEnd = end;
110 SkOpSegment* next = current->findNextXor(&nextStart, &nextEnd,
125 end = nextEnd;
SkPathOpsOp.cpp 131 SkOpSpanBase* nextEnd = end;
133 SkOpSegment* next = current->findNextOp(&chase, &nextStart, &nextEnd,
162 end = nextEnd;
SkOpSegment.cpp 539 SkOpSpanBase** nextEnd, bool* unsortable, bool* simple,
542 SkOpSpanBase* end = *nextEnd;
557 *nextEnd = step > 0 ? (*nextStart)->upCast()->next() : (*nextStart)->prev();
636 *nextEnd = foundAngle->end();
640 __FUNCTION__, debugID(), nextSegment->debugID(), *nextStart, *nextEnd);
646 SkOpSpanBase** nextStart, SkOpSpanBase** nextEnd, bool* unsortable) {
648 SkOpSpanBase* end = *nextEnd;
663 *nextEnd = step > 0 ? (*nextStart)->upCast()->next() : (*nextStart)->prev();
732 *nextEnd = foundAngle->end();
736 __FUNCTION__, debugID(), nextSegment->debugID(), *nextStart, *nextEnd);
    [all...]
SkOpSegment.h 215 SkOpSpanBase** nextEnd, bool* unsortable, bool* simple,
218 SkOpSpanBase** nextEnd, bool* unsortable);
219 SkOpSegment* findNextXor(SkOpSpanBase** nextStart, SkOpSpanBase** nextEnd, bool* unsortable);
  /external/skia/tools/bookmaker/
definition.cpp 458 const char* nextEnd = paren;
461 methodParser.fChar = nextEnd + 1;
463 if (!this->nextMethodParam(&methodParser, &nextEnd, &paramName)) {
488 if (')' == nextEnd[0]) {
491 } while (')' != nextEnd[0]);
731 const char* nextEnd = delimiter ? delimiter : methodParser.fEnd;
733 while (nextStart < nextEnd && ' ' >= nextStart[0]) {
737 while (nextEnd > nextStart && ' ' >= nextEnd[-1]) {
738 --nextEnd;
    [all...]
  /external/skqp/tools/bookmaker/
definition.cpp 458 const char* nextEnd = paren;
461 methodParser.fChar = nextEnd + 1;
463 if (!this->nextMethodParam(&methodParser, &nextEnd, &paramName)) {
488 if (')' == nextEnd[0]) {
491 } while (')' != nextEnd[0]);
731 const char* nextEnd = delimiter ? delimiter : methodParser.fEnd;
733 while (nextStart < nextEnd && ' ' >= nextStart[0]) {
737 while (nextEnd > nextStart && ' ' >= nextEnd[-1]) {
738 --nextEnd;
    [all...]

Completed in 1488 milliseconds