SkClosestSect Struct Reference

Public Member Functions
	SkClosestSect ()
bool	find (const SkTSpan *span1, const SkTSpan *span2 SkDEBUGPARAMS(SkIntersections *i))
void	finish (SkIntersections *intersections) const

Public Attributes
STArray< SkDCubic::kMaxIntersections *2, SkClosestRecord, true >	fClosest
int	fUsed

Detailed Description

Definition at line 1739 of file SkPathOpsTSect.cpp.

Constructor & Destructor Documentation

SkClosestSect()

SkClosestSect::SkClosestSect ( )

inline

Definition at line 1740 of file SkPathOpsTSect.cpp.

        : fUsed(0) {
        fClosest.push_back().reset();
    }

Member Function Documentation

find()

bool SkClosestSect::find ( const SkTSpan *  span1, const SkTSpan *span2   SkDEBUGPARAMSSkIntersections *i  )

inline

Definition at line 1745 of file SkPathOpsTSect.cpp.

                                               {
        SkClosestRecord* record = &fClosest[fUsed];
        record->findEnd(span1, span2, 0, 0);
        record->findEnd(span1, span2, 0, span2->part().pointLast());
        record->findEnd(span1, span2, span1->part().pointLast(), 0);
        record->findEnd(span1, span2, span1->part().pointLast(), span2->part().pointLast());
        if (record->fClosest == FLT_MAX) {
            return false;
        }
        for (int index = 0; index < fUsed; ++index) {
            SkClosestRecord* test = &fClosest[index];
            if (test->matesWith(*record  SkDEBUGPARAMS(i))) {
                if (test->fClosest > record->fClosest) {
                    test->merge(*record);
                }
                test->update(*record);
                record->reset();
                return false;
            }
        }
        ++fUsed;
        fClosest.push_back().reset();
        return true;
    }

finish()

void SkClosestSect::finish ( SkIntersections *  intersections ) const

inline

Definition at line 1771 of file SkPathOpsTSect.cpp.

                                                      {
        STArray<SkDCubic::kMaxIntersections * 3,
                const SkClosestRecord*, true> closestPtrs;
        for (int index = 0; index < fUsed; ++index) {
            closestPtrs.push_back(&fClosest[index]);
        }
        SkTQSort<const SkClosestRecord>(closestPtrs.begin(), closestPtrs.end());
        for (int index = 0; index < fUsed; ++index) {
            const SkClosestRecord* test = closestPtrs[index];
            test->addIntersection(intersections);
        }
    }

Member Data Documentation

fClosest

STArray<SkDCubic::kMaxIntersections * 2, SkClosestRecord, true> SkClosestSect::fClosest

Definition at line 1785 of file SkPathOpsTSect.cpp.

fUsed

int SkClosestSect::fUsed

Definition at line 1786 of file SkPathOpsTSect.cpp.

---

The documentation for this struct was generated from the following file:

• third_party/skia/src/pathops/SkPathOpsTSect.cpp