Home
last modified time | relevance | path

Searched refs:midPt (Results 1 – 7 of 7) sorted by relevance

/external/skqp/gm/
Ddegeneratesegments.cpp140 SkPoint midPt = startPt + SkPoint::Make(20*SK_Scalar1, 5*SK_Scalar1); in AddQuad() local
142 path.quadTo(midPt, endPt); in AddQuad()
148 SkPoint midPt = moveToPt + SkPoint::Make(20*SK_Scalar1, 5*SK_Scalar1); in AddMoveQuad() local
151 path.quadTo(midPt, endPt); in AddMoveQuad()
157 SkPoint midPt = moveToPt + SkPoint::Make(20*SK_Scalar1, 5*SK_Scalar1); in AddMoveQuadClose() local
160 path.quadTo(midPt, endPt); in AddMoveQuadClose()
/external/skia/gm/
Ddegeneratesegments.cpp144 SkPoint midPt = startPt + SkPoint::Make(20*SK_Scalar1, 5*SK_Scalar1); in AddQuad() local
146 path.quadTo(midPt, endPt); in AddQuad()
152 SkPoint midPt = moveToPt + SkPoint::Make(20*SK_Scalar1, 5*SK_Scalar1); in AddMoveQuad() local
155 path.quadTo(midPt, endPt); in AddMoveQuad()
161 SkPoint midPt = moveToPt + SkPoint::Make(20*SK_Scalar1, 5*SK_Scalar1); in AddMoveQuadClose() local
164 path.quadTo(midPt, endPt); in AddMoveQuadClose()
/external/skqp/src/pathops/
DSkOpSegment.cpp1509 SkPoint midPt = this->ptAtT(midT); in ptsDisjoint() local
1511 return SkPointPriv::DistanceToSqd(midPt, pt1) > seDistSq || in ptsDisjoint()
1512 SkPointPriv::DistanceToSqd(midPt, pt2) > seDistSq; in ptsDisjoint()
1669 SkPoint midPt = this->ptAtT(midT); in testForCoincidence() local
1672 if (!SkDPoint::ApproximatelyEqual(priorPtT->fPt, midPt) in testForCoincidence()
1673 && !SkDPoint::ApproximatelyEqual(ptT->fPt, midPt)) { in testForCoincidence()
1683 SkDLine ray = {{{midPt.fX, midPt.fY}, {partMidPt.fX + dxdy.fY, partMidPt.fY - dxdy.fX}}}; in testForCoincidence()
1693 if (oppPt.approximatelyDEqual(midPt)) { in testForCoincidence()
DSkPathOpsTSect.cpp1297 SkDPoint midPt = fCurve.ptAtT(midT); in mergeCoincidence() local
1299 coin.setPerp(fCurve, midT, midPt, sect2->fCurve); in mergeCoincidence()
2063 SkDPoint midPt = sect1->fCurve.ptAtT(midT); in BinarySearch() local
2066 perp.setPerp(sect1->fCurve, midT, midPt, sect2->fCurve); in BinarySearch()
/external/skia/src/pathops/
DSkOpSegment.cpp1509 SkPoint midPt = this->ptAtT(midT); in ptsDisjoint() local
1511 return SkPointPriv::DistanceToSqd(midPt, pt1) > seDistSq || in ptsDisjoint()
1512 SkPointPriv::DistanceToSqd(midPt, pt2) > seDistSq; in ptsDisjoint()
1669 SkPoint midPt = this->ptAtT(midT); in testForCoincidence() local
1672 if (!SkDPoint::ApproximatelyEqual(priorPtT->fPt, midPt) in testForCoincidence()
1673 && !SkDPoint::ApproximatelyEqual(ptT->fPt, midPt)) { in testForCoincidence()
1683 SkDLine ray = {{{midPt.fX, midPt.fY}, {partMidPt.fX + dxdy.fY, partMidPt.fY - dxdy.fX}}}; in testForCoincidence()
1693 if (oppPt.approximatelyDEqual(midPt)) { in testForCoincidence()
DSkPathOpsTSect.cpp1297 SkDPoint midPt = fCurve.ptAtT(midT); in mergeCoincidence() local
1299 coin.setPerp(fCurve, midT, midPt, sect2->fCurve); in mergeCoincidence()
2063 SkDPoint midPt = sect1->fCurve.ptAtT(midT); in BinarySearch() local
2066 perp.setPerp(sect1->fCurve, midT, midPt, sect2->fCurve); in BinarySearch()
/external/fonttools/Lib/fontTools/misc/
DbezierTools.py278 midPt = ax * t + bx, ay * t + by
279 return [(pt1, midPt), (midPt, pt2)]