Searched refs:pointLast (Results 1 – 6 of 6) sorted by relevance
114 double endDist = test->pointLast().distanceSquared(pt); in closestBoundedT()254 SkDVector len = this->pointLast() - this->pointFirst(); in linearT()262 int start = 0, end = fPart->pointLast(); // the outside points are usually the extremes in linearIntersects()310 } else if (opp->pointFirst() == this->pointLast()) { in onlyEndPointsInCommon()313 } else if (opp->pointLast() == this->pointFirst()) { in onlyEndPointsInCommon()316 } else if (opp->pointLast() == this->pointLast()) { in onlyEndPointsInCommon()325 int baseIndex = *start ? 0 : fPart->pointLast(); in onlyEndPointsInCommon()327 opp->fPart->otherPts(*oppStart ? 0 : opp->fPart->pointLast(), oppOtherPts); in onlyEndPointsInCommon()600 } else if (last.approximatelyEqual(this->pointLast())) { in binarySearchCoin()605 } else if (oppPt.approximatelyEqual(sect2->pointLast())) { in binarySearchCoin()[all …]
179 const SkDPoint& pointLast() const { in pointLast() function180 return (*fPart)[fPart->pointLast()]; in pointLast()326 const SkDPoint& pointLast() const { in pointLast() function327 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
89 static int pointLast() { return kPointLast; } in pointLast() function231 int pointLast() const override { return SkDCubic::kPointLast; } in pointLast() function
39 virtual int pointLast() const = 0;