| /external/skia/src/pathops/ |
| D | SkDLineIntersection.cpp | 140 aNearB[index] = t = b.nearPoint(a[index], &aNotB[index]); in intersect()
142 bNearA[index] = t = a.nearPoint(b[index], &bNotA[index]); in intersect()
242 if ((t = line.nearPoint(leftPt, nullptr)) >= 0) { in horizontal()
247 if ((t = line.nearPoint(rightPt, nullptr)) >= 0) { in horizontal()
320 if ((t = line.nearPoint(topPt, nullptr)) >= 0) { in vertical()
325 if ((t = line.nearPoint(bottomPt, nullptr)) >= 0) { in vertical()
|
| D | SkPathOpsLine.h | 28 double nearPoint(const SkDPoint& xy, bool* unequal) const;
|
| D | SkDQuadLineIntersection.cpp | 121 double t = fLine->nearPoint(quadMidPt, nullptr); in checkCoincident()
295 double lineT = fLine->nearPoint(fQuad[qIndex], nullptr); in addNearEndPoints()
310 double quadT = ((SkDCurve*) &fQuad)->nearPoint(SkPath::kQuad_Verb, in addLineNearEndPoints()
|
| D | SkDCubicLineIntersection.cpp | 102 double t = fLine.nearPoint(cubicMidPt, nullptr); in checkCoincident()
290 double lineT = fLine.nearPoint(fCubic[cIndex], nullptr); in addNearEndPoints()
305 double cubicT = ((SkDCurve*) &fCubic)->nearPoint(SkPath::kCubic_Verb, in addLineNearEndPoints()
|
| D | SkDConicLineIntersection.cpp | 43 double t = fLine->nearPoint(conicMidPt, nullptr); in checkCoincident()
195 double lineT = fLine->nearPoint(fConic[cIndex], nullptr); in addNearEndPoints()
210 double conicT = ((SkDCurve*) &fConic)->nearPoint(SkPath::kConic_Verb, in addLineNearEndPoints()
|
| D | SkPathOpsCurve.cpp | 13 double SkDCurve::nearPoint(SkPath::Verb verb, const SkDPoint& xy, const SkDPoint& opp) const { in nearPoint() function in SkDCurve
|
| D | SkPathOpsLine.cpp | 31 double SkDLine::nearPoint(const SkDPoint& xy, bool* unequal) const { in nearPoint() function in SkDLine
|
| D | SkPathOpsCurve.h | 73 double nearPoint(SkPath::Verb verb, const SkDPoint& xy, const SkDPoint& opp) const;
|
| /external/skqp/src/pathops/ |
| D | SkDLineIntersection.cpp | 140 aNearB[index] = t = b.nearPoint(a[index], &aNotB[index]); in intersect()
142 bNearA[index] = t = a.nearPoint(b[index], &bNotA[index]); in intersect()
242 if ((t = line.nearPoint(leftPt, nullptr)) >= 0) { in horizontal()
247 if ((t = line.nearPoint(rightPt, nullptr)) >= 0) { in horizontal()
320 if ((t = line.nearPoint(topPt, nullptr)) >= 0) { in vertical()
325 if ((t = line.nearPoint(bottomPt, nullptr)) >= 0) { in vertical()
|
| D | SkPathOpsLine.h | 28 double nearPoint(const SkDPoint& xy, bool* unequal) const;
|
| D | SkDQuadLineIntersection.cpp | 121 double t = fLine->nearPoint(quadMidPt, nullptr); in checkCoincident()
295 double lineT = fLine->nearPoint(fQuad[qIndex], nullptr); in addNearEndPoints()
310 double quadT = ((SkDCurve*) &fQuad)->nearPoint(SkPath::kQuad_Verb, in addLineNearEndPoints()
|
| D | SkDConicLineIntersection.cpp | 43 double t = fLine->nearPoint(conicMidPt, nullptr); in checkCoincident()
195 double lineT = fLine->nearPoint(fConic[cIndex], nullptr); in addNearEndPoints()
210 double conicT = ((SkDCurve*) &fConic)->nearPoint(SkPath::kConic_Verb, in addLineNearEndPoints()
|
| D | SkDCubicLineIntersection.cpp | 102 double t = fLine.nearPoint(cubicMidPt, nullptr); in checkCoincident()
290 double lineT = fLine.nearPoint(fCubic[cIndex], nullptr); in addNearEndPoints()
305 double cubicT = ((SkDCurve*) &fCubic)->nearPoint(SkPath::kCubic_Verb, in addLineNearEndPoints()
|
| D | SkPathOpsCurve.cpp | 13 double SkDCurve::nearPoint(SkPath::Verb verb, const SkDPoint& xy, const SkDPoint& opp) const { in nearPoint() function in SkDCurve
|
| D | SkPathOpsLine.cpp | 31 double SkDLine::nearPoint(const SkDPoint& xy, bool* unequal) const { in nearPoint() function in SkDLine
|
| D | SkPathOpsCurve.h | 73 double nearPoint(SkPath::Verb verb, const SkDPoint& xy, const SkDPoint& opp) const;
|