SkTSpan Class Reference

#include <SkPathOpsTSect.h>

Public Member Functions
	SkTSpan (const SkTCurve &curve, SkArenaAlloc &heap)
void	addBounded (SkTSpan *, SkArenaAlloc *)
double	closestBoundedT (const SkDPoint &pt) const
bool	contains (double t) const
void	debugInit (const SkTCurve &curve, SkArenaAlloc &heap)
const SkTSect *	debugOpp () const
void	dump () const
void	dumpAll () const
void	dumpBounded (int id) const
void	dumpBounds () const
void	dumpCoin () const
double	endT () const
SkTSpan *	findOppSpan (const SkTSpan *opp) const
SkTSpan *	findOppT (double t) const
	SkDEBUGCODE (SkOpGlobalState *globalState() const { return fDebugGlobalState;}) bool hasOppT(double t) const
int	hullsIntersect (SkTSpan *span, bool *start, bool *oppStart)
void	init (const SkTCurve &)
bool	initBounds (const SkTCurve &)
bool	isBounded () const
bool	linearsIntersect (SkTSpan *span)
double	linearT (const SkDPoint &) const
void	markCoincident ()
const SkTSpan *	next () const
bool	onlyEndPointsInCommon (const SkTSpan *opp, bool *start, bool *oppStart, bool *ptsInCommon)
const SkTCurve &	part () const
int	pointCount () const
const SkDPoint &	pointFirst () const
const SkDPoint &	pointLast () const
bool	removeAllBounded ()
bool	removeBounded (const SkTSpan *opp)
void	reset ()
void	resetBounds (const SkTCurve &curve)
bool	split (SkTSpan *work, SkArenaAlloc *heap)
bool	splitAt (SkTSpan *work, double t, SkArenaAlloc *heap)
double	startT () const

Friends
class	SkTSect

Detailed Description

Definition at line 93 of file SkPathOpsTSect.h.

Constructor & Destructor Documentation

SkTSpan()

SkTSpan::SkTSpan ( const SkTCurve &  curve, SkArenaAlloc &  heap  )

inline

Definition at line 95 of file SkPathOpsTSect.h.

                                                       {
        fPart = curve.make(heap);
    }

Member Function Documentation

addBounded()

void SkTSpan::addBounded	(	SkTSpan *	span,
		SkArenaAlloc *	heap
	)

Definition at line 63 of file SkPathOpsTSect.cpp.

                                                          {
    SkTSpanBounded* bounded = heap->make<SkTSpanBounded>();
    bounded->fBounded = span;
    bounded->fNext = fBounded;
    fBounded = bounded;
}

closestBoundedT()

double SkTSpan::closestBoundedT

(

const SkDPoint &

pt

)

const

Definition at line 118 of file SkPathOpsTSect.cpp.

                                                        {
    double result = -1;
    double closest = DBL_MAX;
    const SkTSpanBounded* testBounded = fBounded;
    while (testBounded) {
        const SkTSpan* test = testBounded->fBounded;
        double startDist = test->pointFirst().distanceSquared(pt);
        if (closest > startDist) {
            closest = startDist;
            result = test->fStartT;
        }
        double endDist = test->pointLast().distanceSquared(pt);
        if (closest > endDist) {
            closest = endDist;
            result = test->fEndT;
        }
        testBounded = testBounded->fNext;
    }
    SkASSERT(between(0, result, 1));
    return result;
}

contains()

bool SkTSpan::contains

(

double

t

)

const

Definition at line 153 of file SkPathOpsTSect.cpp.

                                     {
    const SkTSpan* work = this;
    do {
        if (between(work->fStartT, t, work->fEndT)) {
            return true;
        }
    } while ((work = work->fNext));
    return false;
}

debugInit()

void SkTSpan::debugInit ( const SkTCurve &  curve, SkArenaAlloc &  heap  )

inline

Definition at line 103 of file SkPathOpsTSect.h.

                                                              {
#ifdef SK_DEBUG
        SkTCurve* fake = curve.make(heap);
        fake->debugInit();
        init(*fake);
        initBounds(*fake);
        fCoinStart.init();
        fCoinEnd.init();
#endif
    }

debugOpp()

const SkTSect * SkTSpan::debugOpp

(

)

const

Definition at line 163 of file SkPathOpsTSect.cpp.

                                       {
    return SkDEBUGRELEASE(fDebugSect->debugOpp(), nullptr);
}

dump()

void SkTSpan::dump

(

)

const

Definition at line 1340 of file PathOpsDebug.cpp.

                         {
    dumpID();
    SkDebugf("=(%g,%g) [", fStartT, fEndT);
    const SkTSpanBounded* testBounded = fBounded;
    while (testBounded) {
        const SkTSpan* span = testBounded->fBounded;
        const SkTSpanBounded* next = testBounded->fNext;
        span->dumpID();
        if (next) {
            SkDebugf(",");
        }
        testBounded = next;
    }
    SkDebugf("]");
}

dumpAll()

void SkTSpan::dumpAll

(

)

const

Definition at line 1323 of file PathOpsDebug.cpp.

                            {
    dumpID();
    SkDebugf("=(%g,%g) [", fStartT, fEndT);
    const SkTSpanBounded* testBounded = fBounded;
    while (testBounded) {
        const SkTSpan* span = testBounded->fBounded;
        const SkTSpanBounded* next = testBounded->fNext;
        span->dumpID();
        SkDebugf("=(%g,%g)", span->fStartT, span->fEndT);
        if (next) {
            SkDebugf(" ");
        }
        testBounded = next;
    }
    SkDebugf("]\n");
}

dumpBounded()

void SkTSpan::dumpBounded

(

int

id

)

const

Definition at line 1356 of file PathOpsDebug.cpp.

                                      {
    SkDEBUGCODE(fDebugSect->dumpBounded(id));
}

dumpBounds()

void SkTSpan::dumpBounds

(

)

const

Definition at line 1360 of file PathOpsDebug.cpp.

                               {
    dumpID();
    SkDebugf(" bounds=(%1.9g,%1.9g, %1.9g,%1.9g) boundsMax=%1.9g%s\n",
            fBounds.fLeft, fBounds.fTop, fBounds.fRight, fBounds.fBottom, fBoundsMax,
            fCollapsed ? " collapsed" : "");
}

dumpCoin()

void SkTSpan::dumpCoin

(

)

const

Definition at line 1367 of file PathOpsDebug.cpp.

                             {
    dumpID();
    SkDebugf(" coinStart ");
    fCoinStart.dump();
    SkDebugf(" coinEnd ");
    fCoinEnd.dump();
}

endT()

double SkTSpan::endT ( ) const

inline

Definition at line 131 of file SkPathOpsTSect.h.

                        {
        return fEndT;
    }

findOppSpan()

SkTSpan * SkTSpan::findOppSpan

(

const SkTSpan *

opp

)

const

Definition at line 167 of file SkPathOpsTSect.cpp.

                                  {
    SkTSpanBounded* bounded = fBounded;
    while (bounded) {
        SkTSpan* test = bounded->fBounded;
        if (opp == test) {
            return test;
        }
        bounded = bounded->fNext;
    }
    return nullptr;
}

findOppT()

SkTSpan * SkTSpan::findOppT ( double  t ) const

inline

Definition at line 137 of file SkPathOpsTSect.h.

                                      {
        SkTSpan* result = oppT(t);
        SkOPASSERT(result);
        return result;
    }

hullsIntersect()

int SkTSpan::hullsIntersect	(	SkTSpan *	span,
		bool *	start,
		bool *	oppStart
	)

Definition at line 212 of file SkPathOpsTSect.cpp.

                                     {
    if (!fBounds.intersects(opp->fBounds)) {
        return 0;
    }
    int hullSect = this->hullCheck(opp, start, oppStart);
    if (hullSect >= 0) {
        return hullSect;
    }
    hullSect = opp->hullCheck(this, oppStart, start);
    if (hullSect >= 0) {
        return hullSect;
    }
    return -1;
}

init()

void SkTSpan::init

(

const SkTCurve &

c

)

Definition at line 228 of file SkPathOpsTSect.cpp.

                                    {
    fPrev = fNext = nullptr;
    fStartT = 0;
    fEndT = 1;
    fBounded = nullptr;
    resetBounds(c);
}

initBounds()

bool SkTSpan::initBounds

(

const SkTCurve &

c

)

Definition at line 236 of file SkPathOpsTSect.cpp.

                                          {
    if (SkDoubleIsNaN(fStartT) || SkDoubleIsNaN(fEndT)) {
        return false;
    }
    c.subDivide(fStartT, fEndT, fPart);
    fBounds.setBounds(*fPart);
    fCoinStart.init();
    fCoinEnd.init();
    fBoundsMax = std::max(fBounds.width(), fBounds.height());
    fCollapsed = fPart->collapsed();
    fHasPerp = false;
    fDeleted = false;
#if DEBUG_T_SECT
    if (fCollapsed) {
        SkDebugf("%s", "");  // for convenient breakpoints
    }
#endif
    return fBounds.valid();
}

isBounded()

bool SkTSpan::isBounded ( ) const

inline

Definition at line 153 of file SkPathOpsTSect.h.

                           {
        return fBounded != nullptr;
    }

linearsIntersect()

bool SkTSpan::linearsIntersect

(

SkTSpan *

span

)

Definition at line 256 of file SkPathOpsTSect.cpp.

                                            {
    int result = this->linearIntersects(*span->fPart);
    if (result <= 1) {
        return SkToBool(result);
    }
    SkASSERT(span->fIsLinear);
    result = span->linearIntersects(*fPart);
//    SkASSERT(result <= 1);
    return SkToBool(result);
}

linearT()

double SkTSpan::linearT

(

const SkDPoint &

pt

)

const

Definition at line 267 of file SkPathOpsTSect.cpp.

                                                {
    SkDVector len = this->pointLast() - this->pointFirst();
    return fabs(len.fX) > fabs(len.fY)
            ? (pt.fX - this->pointFirst().fX) / len.fX
            : (pt.fY - this->pointFirst().fY) / len.fY;
}

markCoincident()

void SkTSpan::markCoincident ( )

inline

Definition at line 160 of file SkPathOpsTSect.h.

                          {
        fCoinStart.markCoincident();
        fCoinEnd.markCoincident();
    }

next()

const SkTSpan * SkTSpan::next ( ) const

inline

Definition at line 165 of file SkPathOpsTSect.h.

                                {
        return fNext;
    }

onlyEndPointsInCommon()

bool SkTSpan::onlyEndPointsInCommon	(	const SkTSpan *	opp,
		bool *	start,
		bool *	oppStart,
		bool *	ptsInCommon
	)

Definition at line 320 of file SkPathOpsTSect.cpp.

                                                        {
    if (opp->pointFirst() == this->pointFirst()) {
        *start = *oppStart = true;
    } else if (opp->pointFirst() == this->pointLast()) {
        *start = false;
        *oppStart = true;
    } else if (opp->pointLast() == this->pointFirst()) {
        *start = true;
        *oppStart = false;
    } else if (opp->pointLast() == this->pointLast()) {
        *start = *oppStart = false;
    } else {
        *ptsInCommon = false;
        return false;
    }
    *ptsInCommon = true;
    const SkDPoint* otherPts[4], * oppOtherPts[4];
//  const SkDPoint* otherPts[this->pointCount() - 1], * oppOtherPts[opp->pointCount() - 1];
    int baseIndex = *start ? 0 : fPart->pointLast();
    fPart->otherPts(baseIndex, otherPts);
    opp->fPart->otherPts(*oppStart ? 0 : opp->fPart->pointLast(), oppOtherPts);
    const SkDPoint& base = (*fPart)[baseIndex];
    for (int o1 = 0; o1 < this->pointCount() - 1; ++o1) {
        SkDVector v1 = *otherPts[o1] - base;
        for (int o2 = 0; o2 < opp->pointCount() - 1; ++o2) {
            SkDVector v2 = *oppOtherPts[o2] - base;
            if (v2.dot(v1) >= 0) {
                return false;
            }
        }
    }
    return true;
}

part()

const SkTCurve & SkTSpan::part ( ) const

inline

Definition at line 172 of file SkPathOpsTSect.h.

                                 {
        return *fPart;
    }

pointCount()

int SkTSpan::pointCount ( ) const

inline

Definition at line 176 of file SkPathOpsTSect.h.

                           {
        return fPart->pointCount();
    }

pointFirst()

const SkDPoint & SkTSpan::pointFirst ( ) const

inline

Definition at line 180 of file SkPathOpsTSect.h.

                                       {
        return (*fPart)[0];
    }

pointLast()

const SkDPoint & SkTSpan::pointLast ( ) const

inline

Definition at line 184 of file SkPathOpsTSect.h.

                                      {
        return (*fPart)[fPart->pointLast()];
    }

removeAllBounded()

bool SkTSpan::removeAllBounded

(

)

Definition at line 367 of file SkPathOpsTSect.cpp.

                               {
    bool deleteSpan = false;
    SkTSpanBounded* bounded = fBounded;
    while (bounded) {
        SkTSpan* opp = bounded->fBounded;
        deleteSpan |= opp->removeBounded(this);
        bounded = bounded->fNext;
    }
    return deleteSpan;
}

removeBounded()

bool SkTSpan::removeBounded

(

const SkTSpan *

opp

)

Definition at line 378 of file SkPathOpsTSect.cpp.

                                              {
    if (fHasPerp) {
        bool foundStart = false;
        bool foundEnd = false;
        SkTSpanBounded* bounded = fBounded;
        while (bounded) {
            SkTSpan* test = bounded->fBounded;
            if (opp != test) {
                foundStart |= between(test->fStartT, fCoinStart.perpT(), test->fEndT);
                foundEnd |= between(test->fStartT, fCoinEnd.perpT(), test->fEndT);
            }
            bounded = bounded->fNext;
        }
        if (!foundStart || !foundEnd) {
            fHasPerp = false;
            fCoinStart.init();
            fCoinEnd.init();
        }
    }
    SkTSpanBounded* bounded = fBounded;
    SkTSpanBounded* prev = nullptr;
    while (bounded) {
        SkTSpanBounded* boundedNext = bounded->fNext;
        if (opp == bounded->fBounded) {
            if (prev) {
                prev->fNext = boundedNext;
                return false;
            } else {
                fBounded = boundedNext;
                return fBounded == nullptr;
            }
        }
        prev = bounded;
        bounded = boundedNext;
    }
    SkOPASSERT(0);
    return false;
}

reset()

void SkTSpan::reset ( )

inline

Definition at line 191 of file SkPathOpsTSect.h.

                 {
        fBounded = nullptr;
    }

resetBounds()

void SkTSpan::resetBounds ( const SkTCurve &  curve )

inline

Definition at line 195 of file SkPathOpsTSect.h.

                                            {
        fIsLinear = fIsLine = false;
        initBounds(curve);
    }

SkDEBUGCODE()

SkTSpan::SkDEBUGCODE ( SkOpGlobalState *globalState() const { return fDebugGlobalState;}  ) const

inline

Definition at line 143 of file SkPathOpsTSect.h.

                                                     { return fDebugGlobalState; })
 
    bool hasOppT(double t) const {
        return SkToBool(oppT(t));
    }

split()

bool SkTSpan::split ( SkTSpan *  work, SkArenaAlloc *  heap  )

inline

Definition at line 200 of file SkPathOpsTSect.h.

                                                  {
        return splitAt(work, (work->fStartT + work->fEndT) * 0.5, heap);
    }

splitAt()

bool SkTSpan::splitAt	(	SkTSpan *	work,
		double	t,
		SkArenaAlloc *	heap
	)

Definition at line 417 of file SkPathOpsTSect.cpp.

                                                                 {
    fStartT = t;
    fEndT = work->fEndT;
    if (fStartT == fEndT) {
        fCollapsed = true;
        return false;
    }
    work->fEndT = t;
    if (work->fStartT == work->fEndT) {
        work->fCollapsed = true;
        return false;
    }
    fPrev = work;
    fNext = work->fNext;
    fIsLinear = work->fIsLinear;
    fIsLine = work->fIsLine;
 
    work->fNext = this;
    if (fNext) {
        fNext->fPrev = this;
    }
    this->validate();
    SkTSpanBounded* bounded = work->fBounded;
    fBounded = nullptr;
    while (bounded) {
        this->addBounded(bounded->fBounded, heap);
        bounded = bounded->fNext;
    }
    bounded = fBounded;
    while (bounded) {
        bounded->fBounded->addBounded(this, heap);
        bounded = bounded->fNext;
    }
    return true;
}

startT()

double SkTSpan::startT ( ) const

inline

Definition at line 206 of file SkPathOpsTSect.h.

                          {
        return fStartT;
    }

Friends And Related Function Documentation

SkTSect

friend class SkTSect

friend

Definition at line 246 of file SkPathOpsTSect.h.

---

The documentation for this class was generated from the following files:

• third_party/skia/src/pathops/SkPathOpsTSect.h
• third_party/skia/src/pathops/SkPathOpsTSect.cpp
• third_party/skia/tests/PathOpsDebug.cpp