Searched refs:nextSpan (Results 1 - 14 of 14) sorted by relevance

/external/chromium_org/third_party/skia/src/effects/
H A DSk2DPathEffect.cpp40 this->nextSpan(rect.fLeft, y, rect.width(), dst);
49 void Sk2DPathEffect::nextSpan(int x, int y, int count, SkPath* path) const { function in class:Sk2DPathEffect
94 void SkLine2DPathEffect::nextSpan(int u, int v, int ucount, SkPath* dst) const { function in class:SkLine2DPathEffect
/external/skia/src/effects/
H A DSk2DPathEffect.cpp40 this->nextSpan(rect.fLeft, y, rect.width(), dst);
49 void Sk2DPathEffect::nextSpan(int x, int y, int count, SkPath* path) const { function in class:Sk2DPathEffect
92 void SkLine2DPathEffect::nextSpan(int u, int v, int ucount, SkPath* dst) const { function in class:SkLine2DPathEffect
/external/chromium_org/third_party/skia/include/effects/
H A DSk2DPathEffect.h36 virtual void nextSpan(int u, int v, int ucount, SkPath* dst) const;
79 virtual void nextSpan(int u, int v, int ucount, SkPath*) const SK_OVERRIDE;
/external/skia/include/effects/
H A DSk2DPathEffect.h41 virtual void nextSpan(int u, int v, int ucount, SkPath* dst) const;
80 virtual void nextSpan(int u, int v, int ucount, SkPath*) const SK_OVERRIDE;
/external/chromium_org/third_party/skia/src/pathops/
H A DSkOpSegment.cpp1012 int oStart = other->nextSpan(oIndex, -1) + 1;
1025 int oEnd = other->nextSpan(oIndex, 1);
1847 end = nextSpan(start, 1);
2342 const SkOpSpan* nextSpan = &firstSpan + 1;
2345 if (smallCount <= 1 && !nextSpan->fSmall) {
2425 const SkOpSpan* nextSpan = &otherSpan;
2427 ++nextSpan;
2428 } while (nextSpan->fSmall);
2429 SkAssertResult(missing.fSegment->addTCoincident(missing.fPt, nextSpan->fPt,
2430 nextSpan
[all...]
H A DSkPathOpsCommon.cpp110 *endIndexPtr = bestSeg->nextSpan(bestTIndex, 1);
203 const SkOpSpan& nextSpan = segment->span(lesser); local
204 if (!nextSpan.fDone) {
H A DSkOpSegment.h342 int nextSpan(int from, int step) const;
/external/skia/src/pathops/
H A DSkOpSegment.cpp979 int oStart = other->nextSpan(oIndex, -1) + 1;
992 int oEnd = other->nextSpan(oIndex, 1);
1777 end = nextSpan(start, 1);
2349 const SkOpSpan* nextSpan = &otherSpan;
2351 ++nextSpan;
2352 } while (nextSpan->fSmall);
2353 missing.fSegment->addTCoincident(missing.fPt, nextSpan->fPt, nextSpan->fT,
2500 SkOpSpan* nextSpan = thisSpan + 1;
2502 double nextT = nextSpan
[all...]
H A DSkPathOpsCommon.cpp110 *endIndexPtr = bestSeg->nextSpan(bestTIndex, 1);
203 const SkOpSpan& nextSpan = segment->span(lesser); local
204 if (!nextSpan.fDone) {
H A DSkOpSegment.h340 int nextSpan(int from, int step) const;
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DSimplify.cpp916 const Span& nextSpan = (*fSpans)[index + step];
917 if (thisSpan.fTiny || precisely_equal(thisSpan.fT, nextSpan.fT)) {
920 fUnsortable = step > 0 ? thisSpan.fUnsortableStart : nextSpan.fUnsortableEnd;
925 (*SegmentXYAtT[fVerb])(fPts, nextSpan.fT, &ePt);
2306 end = nextSpan(start, 1);
2923 int end = nextSpan(firstT, step);
2926 end = nextSpan(firstT, step);
3681 int nextSpan(int from, int step) const {
3697 // that all callers to nextSpan should use this instead.
5897 endIndex = bestSeg->nextSpan(bestTInde
[all...]
H A DthingsToDo.txt251 // coincident -- but in nextSpan, we require that both the T
272 int result = nextSpan(from, step);
/external/skia/experimental/Intersection/
H A DSimplify.cpp916 const Span& nextSpan = (*fSpans)[index + step];
917 if (thisSpan.fTiny || precisely_equal(thisSpan.fT, nextSpan.fT)) {
920 fUnsortable = step > 0 ? thisSpan.fUnsortableStart : nextSpan.fUnsortableEnd;
925 (*SegmentXYAtT[fVerb])(fPts, nextSpan.fT, &ePt);
2306 end = nextSpan(start, 1);
2923 int end = nextSpan(firstT, step);
2926 end = nextSpan(firstT, step);
3681 int nextSpan(int from, int step) const {
3697 // that all callers to nextSpan should use this instead.
5897 endIndex = bestSeg->nextSpan(bestTInde
[all...]
H A DthingsToDo.txt251 // coincident -- but in nextSpan, we require that both the T
272 int result = nextSpan(from, step);

Completed in 7244 milliseconds