117     SkTSpan<OppCurve, TCurve>* findOppT(double t) const {  in findOppT()
123     bool hasOppT(double t) const {  in hasOppT()
252     SkTSpan<TCurve, OppCurve>* addSplitAt(SkTSpan<TCurve, OppCurve>* span, double t) {  in addSplitAt()
334 void SkTCoincident<TCurve, OppCurve>::setPerp(const TCurve& c1, double t,  in setPerp()
370 void SkTSpan<TCurve, OppCurve>::addBounded(SkTSpan<OppCurve, TCurve>* span, SkChunkAlloc* heap) {  in addBounded()
400 void SkTSect<TCurve, OppCurve>::addForPerp(SkTSpan<OppCurve, TCurve>* span, double t) {  in addForPerp()
450 bool SkTSpan<TCurve, OppCurve>::debugIsBefore(const SkTSpan* span) const {  in debugIsBefore()
462 bool SkTSpan<TCurve, OppCurve>::contains(double t) const {  in contains()
567 bool SkTSpan<TCurve, OppCurve>::linearsIntersect(SkTSpan<OppCurve, TCurve>* span) {  in linearsIntersect()
669 SkTSpan<OppCurve, TCurve>* SkTSpan<TCurve, OppCurve>::oppT(double t) const {  in oppT()
734 bool SkTSpan<TCurve, OppCurve>::splitAt(SkTSpan* work, double t, SkChunkAlloc* heap) {  in splitAt()
823 void SkTSpan<TCurve, OppCurve>::validatePerpPt(double t, const SkDPoint& pt) const {  in validatePerpPt()
1007 bool SkTSect<TCurve, OppCurve>::coincidentHasT(double t) {  in coincidentHasT()
1093 bool SkTSect<TCurve, OppCurve>::debugHasBounded(const SkTSpan<OppCurve, TCurve>* span) const {  in debugHasBounded()
1253 int SkTSect<TCurve, OppCurve>::intersects(SkTSpan<TCurve, OppCurve>* span,  in intersects()
1334 int SkTSect<TCurve, OppCurve>::linesIntersect(SkTSpan<TCurve, OppCurve>* span,  in linesIntersect()
1492 void SkTSect<TCurve, OppCurve>::markSpanGone(SkTSpan<TCurve, OppCurve>* span) {  in markSpanGone()
1501 bool SkTSect<TCurve, OppCurve>::matchedDirection(double t, const SkTSect<OppCurve, TCurve>* sect2,  in matchedDirection()
1509 void SkTSect<TCurve, OppCurve>::matchedDirCheck(double t, const SkTSect<OppCurve, TCurve>* sect2,  in matchedDirCheck()
1577         SkTSpan<TCurve, OppCurve>* span) const {  in prev()
1607         SkTSpan<TCurve, OppCurve>* span, SkTSect<OppCurve, TCurve>* opp) {  in removeAllBut()  argument
1649 void SkTSect<TCurve, OppCurve>::removeCoincident(SkTSpan<TCurve, OppCurve>* span, bool isBetween) {  in removeCoincident()
1661 void SkTSect<TCurve, OppCurve>::removeSpan(SkTSpan<TCurve, OppCurve>* span) {  in removeSpan()
1672     SkTSpan<TCurve, OppCurve>* span = first;  in removeSpanRange()  local
1687 void SkTSect<TCurve, OppCurve>::removeSpans(SkTSpan<TCurve, OppCurve>* span,  in removeSpans()
1705 SkTSpan<TCurve, OppCurve>* SkTSect<TCurve, OppCurve>::spanAtT(double t,  in spanAtT()
1732 void SkTSect<TCurve, OppCurve>::trim(SkTSpan<TCurve, OppCurve>* span,  in trim()
1763 void SkTSect<TCurve, OppCurve>::unlinkSpan(SkTSpan<TCurve, OppCurve>* span) {  in unlinkSpan()
1800         const SkTSpan<TCurve, OppCurve>* span = fHead;  in validate()  local
1833     const SkTSpan<TCurve, OppCurve>* span = fHead;  in validateBounded()  local
2163             double t = head1->closestBoundedT(start1);  in BinarySearch()  local
2173             double t = head2->closestBoundedT(start2);  in BinarySearch()  local
2183             double t = tail1->closestBoundedT(end1);  in BinarySearch()  local
2193             double t = tail2->closestBoundedT(end2);  in BinarySearch()  local