Lines Matching refs:fCurve
71 result->resetBounds(fCurve); in addFollowing()
495 SkASSERT(fDebugSect->fOppSect->fCurve.ptAtT(t) == pt); in validatePerpPt()
501 : fCurve(c) in SkTSect()
524 result = fHeap.make<SkTSpan>(fCurve, fHeap); in addOne()
536 result->debugInit(fCurve, fHeap); in addOne()
549 SkTSpan work(fCurve, fHeap); in binarySearchCoin()
552 SkDPoint last = fCurve.ptAtT(tStart); in binarySearchCoin()
557 const SkTCurve& opp = sect2->fCurve; in binarySearchCoin()
565 work.initBounds(fCurve); in binarySearchCoin()
573 work.fCoinStart.setPerp(fCurve, work.fStartT, last, opp); in binarySearchCoin()
597 if (last.approximatelyEqual(fCurve[0])) { in binarySearchCoin()
685 first->resetBounds(fCurve); in coincidentForce()
686 first->fCoinStart.setPerp(fCurve, start1s, fCurve[0], sect2->fCurve); in coincidentForce()
687 first->fCoinEnd.setPerp(fCurve, start1e, this->pointLast(), sect2->fCurve); in coincidentForce()
697 oppFirst->resetBounds(sect2->fCurve); in coincidentForce()
734 const SkTCurve& opp = sect2->fCurve; in computePerpendiculars()
742 work->fCoinStart.setPerp(fCurve, work->fStartT, work->pointFirst(), opp); in computePerpendiculars()
752 work->fCoinEnd.setPerp(fCurve, work->fEndT, work->pointLast(), opp); in computePerpendiculars()
906 first->resetBounds(this->fCurve); in extractCoincident()
907 first->fCoinStart.setPerp(fCurve, first->fStartT, first->pointFirst(), sect2->fCurve); in extractCoincident()
908 first->fCoinEnd.setPerp(fCurve, first->fEndT, first->pointLast(), sect2->fCurve); in extractCoincident()
918 oppFirst->resetBounds(sect2->fCurve); in extractCoincident()
1076 if (!thisRayI.intersectRay(opp->fCurve, thisLine)) { in linesIntersect()
1079 if (!oppRayI.intersectRay(this->fCurve, oppLine)) { in linesIntersect()
1090 if (ptMatches == 2 || is_parallel(thisLine, opp->fCurve)) { in linesIntersect()
1101 if (ptMatches == 2|| is_parallel(oppLine, this->fCurve)) { in linesIntersect()
1143 thisLine[0] = fCurve.ptAtT(oppStart); in linesIntersect()
1144 thisLine[1] = thisLine[0] + fCurve.dxdyAtT(oppStart); in linesIntersect()
1145 if (!thisRayI.intersectRay(opp->fCurve, thisLine)) { in linesIntersect()
1149 oppLine[0] = opp->fCurve.ptAtT(start); in linesIntersect()
1150 oppLine[1] = oppLine[0] + opp->fCurve.dxdyAtT(start); in linesIntersect()
1151 if (!oppRayI.intersectRay(this->fCurve, oppLine)) { in linesIntersect()
1157 oCoinS.setPerp(opp->fCurve, oppSpan->fStartT, oppSpan->pointFirst(), fCurve); in linesIntersect()
1158 oCoinE.setPerp(opp->fCurve, oppSpan->fEndT, oppSpan->pointLast(), fCurve); in linesIntersect()
1174 coinS.setPerp(fCurve, span->fStartT, span->pointFirst(), opp->fCurve); in linesIntersect()
1183 coinE.setPerp(fCurve, span->fEndT, span->pointLast(), opp->fCurve); in linesIntersect()
1203 workPt = fCurve.ptAtT(workT); in linesIntersect()
1204 coinW.setPerp(fCurve, workT, workPt, opp->fCurve); in linesIntersect()
1239 SkDVector dxdy = this->fCurve.dxdyAtT(t); in matchedDirection()
1240 SkDVector dxdy2 = sect2->fCurve.dxdyAtT(t2); in matchedDirection()
1297 SkDPoint midPt = fCurve.ptAtT(midT); in mergeCoincidence()
1299 coin.setPerp(fCurve, midT, midPt, sect2->fCurve); in mergeCoincidence()
1489 FAIL_IF(!span->initBounds(fCurve)); in trim()
1497 test->initBounds(opp->fCurve); in trim()
1501 span->initBounds(fCurve); in trim()
1605 if (sect1->fCurve[0] == sect2->fCurve[0]) { in EndsEqual()
1607 intersections->insert(0, 0, sect1->fCurve[0]); in EndsEqual()
1609 if (sect1->fCurve[0] == sect2->pointLast()) { in EndsEqual()
1611 intersections->insert(0, 1, sect1->fCurve[0]); in EndsEqual()
1613 if (sect1->pointLast() == sect2->fCurve[0]) { in EndsEqual()
1623 && sect1->fCurve[0].approximatelyEqual(sect2->fCurve[0])) { in EndsEqual()
1625 intersections->insertNear(0, 0, sect1->fCurve[0], sect2->fCurve[0]); in EndsEqual()
1628 && sect1->fCurve[0].approximatelyEqual(sect2->pointLast())) { in EndsEqual()
1630 intersections->insertNear(0, 1, sect1->fCurve[0], sect2->pointLast()); in EndsEqual()
1634 && sect1->pointLast().approximatelyEqual(sect2->fCurve[0])) { in EndsEqual()
1636 intersections->insertNear(1, 0, sect1->pointLast(), sect2->fCurve[0]); in EndsEqual()
1785 intersections->setMax(sect1->fCurve.maxIntersections() + 4); // give extra for slop in BinarySearch()
1908 if (sect1->collapsed() > sect1->fCurve.maxIntersections()) { in BinarySearch()
1955 perp.setPerp(sect1->fCurve, 0, sect1->fCurve[0], sect2->fCurve); in BinarySearch()
1962 perp.setPerp(sect1->fCurve, 1, sect1->pointLast(), sect2->fCurve); in BinarySearch()
1969 perp.setPerp(sect2->fCurve, 0, sect2->fCurve[0], sect1->fCurve); in BinarySearch()
1976 perp.setPerp(sect2->fCurve, 1, sect2->pointLast(), sect1->fCurve); in BinarySearch()
1991 const SkDPoint& start1 = sect1->fCurve[0]; in BinarySearch()
1994 if (sect2->fCurve.ptAtT(t).approximatelyEqual(start1)) { in BinarySearch()
2001 const SkDPoint& start2 = sect2->fCurve[0]; in BinarySearch()
2004 if (sect1->fCurve.ptAtT(t).approximatelyEqual(start2)) { in BinarySearch()
2018 if (sect2->fCurve.ptAtT(t).approximatelyEqual(end1)) { in BinarySearch()
2033 if (sect1->fCurve.ptAtT(t).approximatelyEqual(end2)) { in BinarySearch()
2063 SkDPoint midPt = sect1->fCurve.ptAtT(midT); in BinarySearch()
2066 perp.setPerp(sect1->fCurve, midT, midPt, sect2->fCurve); in BinarySearch()
2082 SkOPOBJASSERT(intersections, intersections->used() <= sect1->fCurve.maxIntersections()); in BinarySearch()