Searched refs:pointLast (Results 1 – 12 of 12) sorted by relevance
113 double endDist = test->pointLast().distanceSquared(pt); in closestBoundedT()253 SkDVector len = this->pointLast() - this->pointFirst(); in linearT()261 int start = 0, end = fPart->pointLast(); // the outside points are usually the extremes in linearIntersects()309 } else if (opp->pointFirst() == this->pointLast()) { in onlyEndPointsInCommon()312 } else if (opp->pointLast() == this->pointFirst()) { in onlyEndPointsInCommon()315 } else if (opp->pointLast() == this->pointLast()) { in onlyEndPointsInCommon()324 int baseIndex = *start ? 0 : fPart->pointLast(); in onlyEndPointsInCommon()326 opp->fPart->otherPts(*oppStart ? 0 : opp->fPart->pointLast(), oppOtherPts); in onlyEndPointsInCommon()599 } else if (last.approximatelyEqual(this->pointLast())) { in binarySearchCoin()604 } else if (oppPt.approximatelyEqual(sect2->pointLast())) { in binarySearchCoin()[all …]
180 const SkDPoint& pointLast() const { in pointLast() function181 return (*fPart)[fPart->pointLast()]; in pointLast()327 const SkDPoint& pointLast() const { in pointLast() function328 return fCurve[fCurve.pointLast()]; in pointLast()
90 static int pointLast() { return kPointLast; } in pointLast() function175 int pointLast() const override { return SkDQuad::kPointLast; } in pointLast() function
98 static int pointLast() { return kPointLast; } in pointLast() function184 int pointLast() const override { return SkDConic::kPointLast; } in pointLast() function
39 virtual int pointLast() const = 0;
89 static int pointLast() { return kPointLast; } in pointLast() function231 int pointLast() const override { return SkDCubic::kPointLast; } in pointLast() function