Searched refs:kPointLast (Results 1 – 5 of 5) sorted by relevance
437 double endDist = test->fPart[OppCurve::kPointLast].distanceSquared(pt); in closestBoundedT()580 SkDVector len = fPart[TCurve::kPointLast] - fPart[0]; in linearT()589 int start = 0, end = TCurve::kPointLast; // the outside points are usually the extremes in linearIntersects()638 } else if (opp->fPart[0] == fPart[TCurve::kPointLast]) { in onlyEndPointsInCommon()641 } else if (opp->fPart[OppCurve::kPointLast] == fPart[0]) { in onlyEndPointsInCommon()644 } else if (opp->fPart[OppCurve::kPointLast] == fPart[TCurve::kPointLast]) { in onlyEndPointsInCommon()652 int baseIndex = *start ? 0 : TCurve::kPointLast; in onlyEndPointsInCommon()654 opp->fPart.otherPts(*oppStart ? 0 : OppCurve::kPointLast, oppOtherPts); in onlyEndPointsInCommon()919 } else if (last.approximatelyEqual(fCurve[TCurve::kPointLast])) { in binarySearchCoin()924 } else if (oppPt.approximatelyEqual(opp[OppCurve::kPointLast])) { in binarySearchCoin()[all …]
173 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addExactEndPoints()184 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addNearEndPoints()199 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addExactHorizontalEndPoints()210 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addNearHorizontalEndPoints()225 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addExactVerticalEndPoints()236 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addNearVerticalEndPoints()
16 static const int kPointLast = kPointCount - 1; member
23 static const int kPointLast = kPointCount - 1; member
22 static const int kPointLast = kPointCount - 1; member