Lines Matching refs:fCurve
255 result->initBounds(fCurve); in addSplitAt()
256 span->initBounds(fCurve); in addSplitAt()
314 const TCurve& fCurve; variable
395 result->resetBounds(fCurve); in addFollowing()
824 SkASSERT(fDebugSect->fOppSect->fCurve.ptAtT(t) == pt); in validatePerpPt()
830 : fCurve(c) in SkTSect()
880 SkDPoint last = fCurve.ptAtT(tStart); in binarySearchCoin()
884 const OppCurve& opp = sect2->fCurve; in binarySearchCoin()
892 work.initBounds(fCurve); in binarySearchCoin()
900 work.fCoinStart.setPerp(fCurve, work.fStartT, last, opp); in binarySearchCoin()
917 if (last.approximatelyEqual(fCurve[0])) { in binarySearchCoin()
919 } else if (last.approximatelyEqual(fCurve[TCurve::kPointLast])) { in binarySearchCoin()
986 first->resetBounds(fCurve); in coincidentForce()
987 first->fCoinStart.setPerp(fCurve, start1s, fCurve[0], sect2->fCurve); in coincidentForce()
988 first->fCoinEnd.setPerp(fCurve, start1e, fCurve[TCurve::kPointLast], sect2->fCurve); in coincidentForce()
997 oppFirst->resetBounds(sect2->fCurve); in coincidentForce()
1034 const OppCurve& opp = sect2->fCurve; in computePerpendiculars()
1042 work->fCoinStart.setPerp(fCurve, work->fStartT, work->fPart[0], opp); in computePerpendiculars()
1052 work->fCoinEnd.setPerp(fCurve, work->fEndT, work->fPart[TCurve::kPointLast], opp); in computePerpendiculars()
1185 first->resetBounds(this->fCurve); in extractCoincident()
1186 first->fCoinStart.setPerp(fCurve, first->fStartT, first->fPart[0], sect2->fCurve); in extractCoincident()
1187 first->fCoinEnd.setPerp(fCurve, first->fEndT, first->fPart[TCurve::kPointLast], sect2->fCurve); in extractCoincident()
1196 oppFirst->resetBounds(sect2->fCurve); in extractCoincident()
1342 if (!thisRayI.intersectRay(opp->fCurve, thisLine)) { in linesIntersect()
1345 if (!oppRayI.intersectRay(this->fCurve, oppLine)) { in linesIntersect()
1356 if (ptMatches == 2 || is_parallel(thisLine, opp->fCurve)) { in linesIntersect()
1367 if (ptMatches == 2|| is_parallel(oppLine, this->fCurve)) { in linesIntersect()
1409 thisLine[0] = fCurve.ptAtT(oppStart); in linesIntersect()
1410 thisLine[1] = thisLine[0] + fCurve.dxdyAtT(oppStart); in linesIntersect()
1411 if (!thisRayI.intersectRay(opp->fCurve, thisLine)) { in linesIntersect()
1415 oppLine[0] = opp->fCurve.ptAtT(start); in linesIntersect()
1416 oppLine[1] = oppLine[0] + opp->fCurve.dxdyAtT(start); in linesIntersect()
1417 if (!oppRayI.intersectRay(this->fCurve, oppLine)) { in linesIntersect()
1423 oCoinS.setPerp(opp->fCurve, oppSpan->fStartT, oppSpan->fPart[0], fCurve); in linesIntersect()
1424 oCoinE.setPerp(opp->fCurve, oppSpan->fEndT, oppSpan->fPart[OppCurve::kPointLast], fCurve); in linesIntersect()
1439 coinS.setPerp(fCurve, span->fStartT, span->fPart[0], opp->fCurve); in linesIntersect()
1448 coinE.setPerp(fCurve, span->fEndT, span->fPart[TCurve::kPointLast], opp->fCurve); in linesIntersect()
1468 workPt = fCurve.ptAtT(workT); in linesIntersect()
1469 coinW.setPerp(fCurve, workT, workPt, opp->fCurve); in linesIntersect()
1503 SkDVector dxdy = this->fCurve.dxdyAtT(t); in matchedDirection()
1504 SkDVector dxdy2 = sect2->fCurve.dxdyAtT(t2); in matchedDirection()
1560 SkDPoint midPt = fCurve.ptAtT(midT); in mergeCoincidence()
1562 coin.setPerp(fCurve, midT, midPt, sect2->fCurve); in mergeCoincidence()
1734 span->initBounds(fCurve); in trim()
1742 test->initBounds(opp->fCurve); in trim()
1746 span->initBounds(fCurve); in trim()
1844 if (sect1->fCurve[0] == sect2->fCurve[0]) { in EndsEqual()
1846 intersections->insert(0, 0, sect1->fCurve[0]); in EndsEqual()
1848 if (sect1->fCurve[0] == sect2->fCurve[OppCurve::kPointLast]) { in EndsEqual()
1850 intersections->insert(0, 1, sect1->fCurve[0]); in EndsEqual()
1852 if (sect1->fCurve[TCurve::kPointLast] == sect2->fCurve[0]) { in EndsEqual()
1854 intersections->insert(1, 0, sect1->fCurve[TCurve::kPointLast]); in EndsEqual()
1856 if (sect1->fCurve[TCurve::kPointLast] == sect2->fCurve[OppCurve::kPointLast]) { in EndsEqual()
1858 intersections->insert(1, 1, sect1->fCurve[TCurve::kPointLast]); in EndsEqual()
1862 && sect1->fCurve[0].approximatelyEqual(sect2->fCurve[0])) { in EndsEqual()
1864 intersections->insertNear(0, 0, sect1->fCurve[0], sect2->fCurve[0]); in EndsEqual()
1867 && sect1->fCurve[0].approximatelyEqual(sect2->fCurve[OppCurve::kPointLast])) { in EndsEqual()
1869 intersections->insertNear(0, 1, sect1->fCurve[0], sect2->fCurve[OppCurve::kPointLast]); in EndsEqual()
1873 && sect1->fCurve[TCurve::kPointLast].approximatelyEqual(sect2->fCurve[0])) { in EndsEqual()
1875 intersections->insertNear(1, 0, sect1->fCurve[TCurve::kPointLast], sect2->fCurve[0]); in EndsEqual()
1878 && sect1->fCurve[TCurve::kPointLast].approximatelyEqual(sect2->fCurve[ in EndsEqual()
1881 intersections->insertNear(1, 1, sect1->fCurve[TCurve::kPointLast], in EndsEqual()
1882 sect2->fCurve[OppCurve::kPointLast]); in EndsEqual()
2161 const SkDPoint& start1 = sect1->fCurve[0]; in BinarySearch()
2164 if (sect2->fCurve.ptAtT(t).approximatelyEqual(start1)) { in BinarySearch()
2171 const SkDPoint& start2 = sect2->fCurve[0]; in BinarySearch()
2174 if (sect1->fCurve.ptAtT(t).approximatelyEqual(start2)) { in BinarySearch()
2181 const SkDPoint& end1 = sect1->fCurve[TCurve::kPointLast]; in BinarySearch()
2184 if (sect2->fCurve.ptAtT(t).approximatelyEqual(end1)) { in BinarySearch()
2191 const SkDPoint& end2 = sect2->fCurve[OppCurve::kPointLast]; in BinarySearch()
2194 if (sect1->fCurve.ptAtT(t).approximatelyEqual(end2)) { in BinarySearch()
2223 SkDPoint midPt = sect1->fCurve.ptAtT(midT); in BinarySearch()
2226 perp.setPerp(sect1->fCurve, midT, midPt, sect2->fCurve); in BinarySearch()