Lines Matching defs:const
13 void SkTCoincident::setPerp(const SkTCurve& c1, double t,
14 const SkDPoint& cPt, const SkTCurve& c2) {
103 double SkTSpan::closestBoundedT(const SkDPoint& pt) const {
106 const SkTSpanBounded* testBounded = fBounded;
108 const SkTSpan* test = testBounded->fBounded;
127 bool SkTSpan::debugIsBefore(const SkTSpan* span) const {
128 const SkTSpan* work = this;
138 bool SkTSpan::contains(double t) const {
139 const SkTSpan* work = this;
148 const SkTSect* SkTSpan::debugOpp() const {
153 const SkTSpan* opp) const {
170 int SkTSpan::hullCheck(const SkTSpan* opp,
214 void SkTSpan::init(const SkTCurve& c) {
222 bool SkTSpan::initBounds(const SkTCurve& c) {
253 double SkTSpan::linearT(const SkDPoint& pt) const {
260 int SkTSpan::linearIntersects(const SkTCurve& q2) const {
306 bool SkTSpan::onlyEndPointsInCommon(const SkTSpan* opp,
323 const SkDPoint* otherPts[4], * oppOtherPts[4];
324 // const SkDPoint* otherPts[this->pointCount() - 1], * oppOtherPts[opp->pointCount() - 1];
328 const SkDPoint& base = (*fPart)[baseIndex];
341 SkTSpan* SkTSpan::oppT(double t) const {
364 bool SkTSpan::removeBounded(const SkTSpan* opp) {
439 void SkTSpan::validate() const {
468 void SkTSpan::validateBounded() const {
470 const SkTSpanBounded* testBounded = fBounded;
472 SkDEBUGCODE(const SkTSpan* overlap = testBounded->fBounded);
483 void SkTSpan::validatePerpT(double oppT) const {
484 const SkTSpanBounded* testBounded = fBounded;
486 const SkTSpan* overlap = testBounded->fBounded;
495 void SkTSpan::validatePerpPt(double t, const SkDPoint& pt) const {
499 SkTSect::SkTSect(const SkTCurve& c
558 const SkTCurve& opp = sect2->fCurve;
718 int SkTSect::collapsed() const {
720 const SkTSpan* test = fHead;
735 const SkTCurve& opp = sect2->fCurve;
774 SkTSpan** lastPtr) const {
792 bool SkTSect::hasBounded(const SkTSpan* span) const {
793 const SkTSpan* test = fHead;
1040 static bool is_parallel(const SkDLine& thisLine, const SkTCurve& opp) {
1130 const SkDPoint& oppIPt = thisRayI.pt(oppCloseIndex);
1131 const SkDPoint& iPt = oppRayI.pt(closeIndex);
1238 bool SkTSect::matchedDirection(double t, const SkTSect* sect2,
1239 double t2) const {
1245 void SkTSect::matchedDirCheck(double t, const SkTSect* sect2,
1246 double t2, bool* calcMatched, bool* oppMatched) const {
1315 SkTSpan* span) const {
1342 void SkTSect::removeAllBut(const SkTSpan* keep,
1344 const SkTSpanBounded* testBounded = span->fBounded;
1347 const SkTSpanBounded* next = testBounded->fNext;
1491 const SkTSpanBounded* testBounded = span->fBounded;
1494 const SkTSpanBounded* next = testBounded->fNext;
1544 const SkTSpan* final = last->next();
1555 void SkTSect::validate() const {
1560 const SkTSpan* span = fHead;
1562 const SkTSpan* next;
1577 const SkTSpan* deleted = fDeleted;
1582 const SkTSpan* coincident = fCoincident;
1591 void SkTSect::validateBounded() const {
1596 const SkTSpan* span = fHead;
1603 int SkTSect::EndsEqual(const SkTSect* sect1,
1604 const SkTSect* sect2, SkIntersections* intersections) {
1648 bool operator<(const SkClosestRecord& rh) const {
1652 void addIntersection(SkIntersections* intersections) const {
1658 void findEnd(const SkTSpan* span1, const SkTSpan* span2,
1660 const SkTCurve& c1 = span1->part();
1661 const SkTCurve& c2 = span2->part();
1680 bool matesWith(const SkClosestRecord& mate SkDEBUGPARAMS(SkIntersections* i)) const {
1692 void merge(const SkClosestRecord& mate) {
1707 void update(const SkClosestRecord& mate) {
1714 const SkTSpan* fC1Span;
1715 const SkTSpan* fC2Span;
1731 bool find(const SkTSpan* span1, const SkTSpan* span2
1757 void finish(SkIntersections* intersections) const {
1759 const SkClosestRecord*, true> closestPtrs;
1763 SkTQSort<const SkClosestRecord>(closestPtrs.begin(), closestPtrs.end());
1765 const SkClosestRecord* test = closestPtrs[index];
1799 const int kMaxCoinLoopCount = 8;
1989 const SkTSpan* head1 = result1;
1991 const SkDPoint& start1 = sect1->fCurve[0];
1999 const SkTSpan* head2 = sect2->fHead;
2001 const SkDPoint& start2 = sect2->fCurve[0];
2010 const SkTSpan* tail1 = sect1->tail();
2015 const SkDPoint& end1 = sect1->pointLast();
2025 const SkTSpan* tail2 = sect2->tail();
2030 const SkDPoint& end2 = sect2->pointLast();
2084 int SkIntersections::intersect(const SkDQuad& q1, const SkDQuad& q2) {
2093 int SkIntersections::intersect(const SkDConic& c, const SkDQuad& q) {
2102 int SkIntersections::intersect(const SkDConic& c1, const SkDConic& c2) {
2111 int SkIntersections::intersect(const SkDCubic& c, const SkDQuad& q) {
2120 int SkIntersections::intersect(const SkDCubic& cu, const SkDConic& co) {
2130 int SkIntersections::intersect(const SkDCubic& c1, const SkDCubic& c2) {