| /external/chromium_org/third_party/skia/include/effects/ |
| Sk2DPathEffect.h | 36 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/ |
| Sk2DPathEffect.h | 41 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/effects/ |
| Sk2DPathEffect.cpp | 40 this->nextSpan(rect.fLeft, y, rect.width(), dst);
49 void Sk2DPathEffect::nextSpan(int x, int y, int count, SkPath* path) const {
94 void SkLine2DPathEffect::nextSpan(int u, int v, int ucount, SkPath* dst) const {
|
| /external/skia/src/effects/ |
| Sk2DPathEffect.cpp | 40 this->nextSpan(rect.fLeft, y, rect.width(), dst);
49 void Sk2DPathEffect::nextSpan(int x, int y, int count, SkPath* path) const {
92 void SkLine2DPathEffect::nextSpan(int u, int v, int ucount, SkPath* dst) const {
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkOpSegment.cpp | [all...] |
| SkPathOpsCommon.cpp | 110 *endIndexPtr = bestSeg->nextSpan(bestTIndex, 1);
203 const SkOpSpan& nextSpan = segment->span(lesser);
204 if (!nextSpan.fDone) {
|
| SkOpSegment.h | 342 int nextSpan(int from, int step) const;
|
| /external/skia/src/pathops/ |
| SkOpSegment.cpp | [all...] |
| SkPathOpsCommon.cpp | 110 *endIndexPtr = bestSeg->nextSpan(bestTIndex, 1);
203 const SkOpSpan& nextSpan = segment->span(lesser);
204 if (!nextSpan.fDone) {
|
| SkOpSegment.h | 340 int nextSpan(int from, int step) const;
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| Simplify.cpp | 916 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);
[all...] |
| thingsToDo.txt | 251 // coincident -- but in nextSpan, we require that both the T
272 int result = nextSpan(from, step);
|
| /external/skia/experimental/Intersection/ |
| Simplify.cpp | 916 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);
[all...] |
| thingsToDo.txt | 251 // coincident -- but in nextSpan, we require that both the T
272 int result = nextSpan(from, step);
|
