Searched refs:endPt (Results 1 - 24 of 24) sorted by relevance

/external/chromium_org/third_party/skia/experimental/Intersection/
H A DQuadraticBounds.cpp19 _Point endPt; local
20 xy_at_t(quad, endT, endPt.x, endPt.y);
21 return startPt.x <= endPt.x ? startT : endT;
H A DIntersections.cpp12 const _Point& startPt, const _Point& endPt) {
14 remove(s2, e2, startPt, endPt);
16 remove(s1, e1, startPt, endPt);
39 bool e1in = between(cs1, e1, ce1) || endPt.approximatelyEqual(fPt[i1])
40 || endPt.approximatelyEqual(fPt[iEnd1]);
53 bool e2in = between(cs2, e2, ce2) || endPt.approximatelyEqual(fPt[i2])
54 || endPt.approximatelyEqual(fPt[iEnd2]);
61 fPt[i1] = endPt;
68 fPt[iEnd1] = endPt;
89 insertCoincident(e1, e2, endPt);
11 insertCoincidentPair(double s1, double e1, double s2, double e2, const _Point& startPt, const _Point& endPt) argument
[all...]
H A DIntersections.h69 const _Point& startPt, const _Point& endPt);
139 void remove(double one, double two, const _Point& startPt, const _Point& endPt);
H A DQuadraticImplicit.cpp86 const _Point* endPt[2]; local
92 endPt[opp - 1] = &q1[end];
94 double origX = endPt[0]->x;
95 double origY = endPt[0]->y;
96 double adj = endPt[1]->x - origX;
97 double opp = endPt[1]->y - origY;
/external/skia/experimental/Intersection/
H A DQuadraticBounds.cpp19 _Point endPt; local
20 xy_at_t(quad, endT, endPt.x, endPt.y);
21 return startPt.x <= endPt.x ? startT : endT;
H A DIntersections.cpp12 const _Point& startPt, const _Point& endPt) {
14 remove(s2, e2, startPt, endPt);
16 remove(s1, e1, startPt, endPt);
39 bool e1in = between(cs1, e1, ce1) || endPt.approximatelyEqual(fPt[i1])
40 || endPt.approximatelyEqual(fPt[iEnd1]);
53 bool e2in = between(cs2, e2, ce2) || endPt.approximatelyEqual(fPt[i2])
54 || endPt.approximatelyEqual(fPt[iEnd2]);
61 fPt[i1] = endPt;
68 fPt[iEnd1] = endPt;
89 insertCoincident(e1, e2, endPt);
11 insertCoincidentPair(double s1, double e1, double s2, double e2, const _Point& startPt, const _Point& endPt) argument
[all...]
H A DIntersections.h69 const _Point& startPt, const _Point& endPt);
139 void remove(double one, double two, const _Point& startPt, const _Point& endPt);
H A DQuadraticImplicit.cpp86 const _Point* endPt[2]; local
92 endPt[opp - 1] = &q1[end];
94 double origX = endPt[0]->x;
95 double origY = endPt[0]->y;
96 double adj = endPt[1]->x - origX;
97 double opp = endPt[1]->y - origY;
/external/chromium_org/third_party/skia/gm/
H A Ddegeneratesegments.cpp119 SkPoint endPt = startPt + SkPoint::Make(40*SK_Scalar1, 0); local
120 path.lineTo(endPt);
121 return endPt;
126 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local
128 path.lineTo(endPt);
129 return endPt;
134 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local
136 path.lineTo(endPt);
138 return endPt;
143 SkPoint endPt local
151 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local
160 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local
170 SkPoint endPt = startPt + SkPoint::Make(40*SK_Scalar1, 0); local
179 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local
189 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local
[all...]
/external/skia/gm/
H A Ddegeneratesegments.cpp119 SkPoint endPt = startPt + SkPoint::Make(40*SK_Scalar1, 0); local
120 path.lineTo(endPt);
121 return endPt;
126 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local
128 path.lineTo(endPt);
129 return endPt;
134 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local
136 path.lineTo(endPt);
138 return endPt;
143 SkPoint endPt local
151 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local
160 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local
170 SkPoint endPt = startPt + SkPoint::Make(40*SK_Scalar1, 0); local
179 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local
189 SkPoint endPt = moveToPt + SkPoint::Make(40*SK_Scalar1, 0); local
[all...]
/external/chromium_org/third_party/skia/src/pathops/
H A DSkOpSegment.h286 void addTCancel(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
287 bool addTCoincident(const SkPoint& startPt, const SkPoint& endPt, double endT,
315 int step, SkPoint* startPt, SkPoint* endPt, double* endT) const;
401 void addCancelOutsides(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
402 void addCoinOutsides(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
474 void setCoincidentRange(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
480 static void TrackOutsidePair(SkTArray<SkPoint, true>* outsideTs, const SkPoint& endPt,
H A DSkDQuadIntersection.cpp87 const SkDPoint* endPt[2]; local
93 endPt[opp - 1] = &q1[end];
95 double origX = endPt[0]->fX;
96 double origY = endPt[0]->fY;
97 double adj = endPt[1]->fX - origX;
98 double opp = endPt[1]->fY - origY;
H A DSkOpContour.cpp519 const SkPoint* endPt = &coincidence.fPts[0][1];
523 SkTSwap(startPt, endPt);
532 const SkPoint& oMatchStartPt = cancel ? *endPt : *startPt;
543 (void) other.joinCoincidence(&thisOne, endT, *endPt, -step, cancel);
567 const SkPoint* endPt = &coincidence.fPts[0][1];
571 SkTSwap<const SkPoint*>(startPt, endPt);
585 thisOne.addTCancel(*startPt, *endPt, &other);
587 success = thisOne.addTCoincident(*startPt, *endPt, endT, &other);
H A DSkOpSegment.cpp212 void SkOpSegment::addCancelOutsides(const SkPoint& startPt, const SkPoint& endPt, argument
224 } while (endPt != other->fTs[oIndex].fPt && oIndex < oCount);
235 SkASSERT(other->fTs[oIndex].fT < 1 || endPt != *oNextPt);
236 } while (endPt == *oNextPt);
290 void SkOpSegment::addCoinOutsides(const SkPoint& startPt, const SkPoint& endPt, argument
351 } while (endPt != nextPt);
690 startPt endPt test/oTest first pos test/oTest final pos
692 void SkOpSegment::addTCancel(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other) { argument
761 oFoundEnd |= endPt == oTest->fPt;
764 } while (endPt !
[all...]
H A DSkDCubicIntersection.cpp438 const SkDPoint* endPt[3];
441 endPt[opp - 1] = &c1[end];
444 double origX = endPt[triTest]->fX;
445 double origY = endPt[triTest]->fY;
450 double adj = endPt[oppTest]->fX - origX;
451 double opp = endPt[oppTest]->fY - origY;
H A DSkOpAngle.cpp439 SkDPoint endPt;
440 endPt.set(rh.fSegment->pts()[rh.fStart < rh.fEnd ? rPts : 0]);
441 SkDVector m1 = endPt - fCurvePart[0];
445 SkDPoint endPt;
446 endPt.set(fSegment->pts()[fStart < fEnd ? lPts : 0]);
447 SkDVector m0 = endPt - fCurvePart[0];
/external/skia/src/pathops/
H A DSkOpSegment.h284 void addTCancel(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
285 void addTCoincident(const SkPoint& startPt, const SkPoint& endPt, double endT,
313 int step, SkPoint* startPt, SkPoint* endPt, double* endT) const;
399 void addCancelOutsides(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
400 void addCoinOutsides(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
472 void setCoincidentRange(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
478 static void TrackOutsidePair(SkTArray<SkPoint, true>* outsideTs, const SkPoint& endPt,
H A DSkDQuadIntersection.cpp87 const SkDPoint* endPt[2]; local
93 endPt[opp - 1] = &q1[end];
95 double origX = endPt[0]->fX;
96 double origY = endPt[0]->fY;
97 double adj = endPt[1]->fX - origX;
98 double opp = endPt[1]->fY - origY;
H A DSkOpContour.cpp502 const SkPoint* endPt = &coincidence.fPts[0][1];
506 SkTSwap(startPt, endPt);
515 const SkPoint& oMatchStartPt = cancel ? *endPt : *startPt;
526 (void) other.joinCoincidence(&thisOne, endT, *endPt, -step, cancel);
550 const SkPoint* endPt = &coincidence.fPts[0][1];
554 SkTSwap<const SkPoint*>(startPt, endPt);
574 thisOne.addTCancel(*startPt, *endPt, &other);
576 thisOne.addTCoincident(*startPt, *endPt, endT, &other);
H A DSkOpSegment.cpp212 void SkOpSegment::addCancelOutsides(const SkPoint& startPt, const SkPoint& endPt, argument
224 } while (endPt != other->fTs[oIndex].fPt && oIndex < oCount);
235 SkASSERT(other->fTs[oIndex].fT < 1 || endPt != *oNextPt);
236 } while (endPt == *oNextPt);
289 void SkOpSegment::addCoinOutsides(const SkPoint& startPt, const SkPoint& endPt, argument
350 } while (endPt != nextPt);
684 startPt endPt test/oTest first pos test/oTest final pos
686 void SkOpSegment::addTCancel(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other) { argument
753 oFoundEnd |= endPt == oTest->fPt;
756 } while (endPt !
[all...]
H A DSkDCubicIntersection.cpp438 const SkDPoint* endPt[3];
441 endPt[opp - 1] = &c1[end];
444 double origX = endPt[triTest]->fX;
445 double origY = endPt[triTest]->fY;
450 double adj = endPt[oppTest]->fX - origX;
451 double opp = endPt[oppTest]->fY - origY;
H A DSkOpAngle.cpp442 SkDPoint endPt;
443 endPt.set(rh.fSegment->pts()[rh.fStart < rh.fEnd ? rPts : 0]);
444 SkDVector m1 = endPt - fCurvePart[0];
448 SkDPoint endPt;
449 endPt.set(fSegment->pts()[fStart < fEnd ? lPts : 0]);
450 SkDVector m0 = endPt - fCurvePart[0];
/external/chromium_org/third_party/skia/src/gpu/
H A DGrAAConvexPathRenderer.cpp50 const SkPoint& endPt() const { function in struct:Segment
71 p0 = segments[0].endPt();
77 pj = segments[1].endPt() - p0;
80 const SkPoint pj = segments[i + 1].endPt() - p0;
95 const SkPoint& pt = segments[i].endPt();
137 const SkPoint* prevPt = &sega.endPt();
381 verts[*v + 0].fPos = sega.endPt();
406 verts[*v + 1].fPos = sega.endPt();
443 SkPoint qpts[] = {sega.endPt(), segb.fPts[0], segb.fPts[1]};
/external/skia/src/gpu/
H A DGrAAConvexPathRenderer.cpp49 const SkPoint& endPt() const { function in struct:Segment
70 p0 = segments[0].endPt();
76 pj = segments[1].endPt() - p0;
79 const SkPoint pj = segments[i + 1].endPt() - p0;
94 const SkPoint& pt = segments[i].endPt();
136 const SkPoint* prevPt = &sega.endPt();
380 verts[*v + 0].fPos = sega.endPt();
405 verts[*v + 1].fPos = sega.endPt();
442 SkPoint qpts[] = {sega.endPt(), segb.fPts[0], segb.fPts[1]};

Completed in 824 milliseconds