Lines Matching defs:SkOpSegment
24 class SkOpSegment {
26 bool operator<(const SkOpSegment& rh) const {
44 SkOpSegment* addConic(SkPoint pts[3], SkScalar weight, SkOpContour* parent) {
52 SkOpSegment* addCubic(SkPoint pts[4], SkOpContour* parent) {
71 SkOpSegment* addLine(SkPoint pts[2], SkOpContour* parent) {
78 SkOpPtT* addMissing(double t, SkOpSegment* opp, bool* allExist);
87 SkOpSegment* addQuad(SkPoint pts[3], SkOpContour* parent) {
155 const SkOpSegment* debugSegment(int id) const;
213 const SkOpPtT* existing(double t, const SkOpSegment* opp) const;
214 SkOpSegment* findNextOp(SkTDArray<SkOpSpanBase*>* chase, SkOpSpanBase** nextStart,
217 SkOpSegment* findNextWinding(SkTDArray<SkOpSpanBase*>* chase, SkOpSpanBase** nextStart,
219 SkOpSegment* findNextXor(SkOpSpanBase** nextStart, SkOpSpanBase** nextEnd, bool* unsortable);
248 bool isClose(double t, const SkOpSegment* opp) const;
254 SkOpSegment* isSimple(SkOpSpanBase** end, int* step) const {
268 void joinEnds(SkOpSegment* start) {
288 bool match(const SkOpPtT* span, const SkOpSegment* parent, double t, const SkPoint& pt) const;
293 SkOpSegment* next() const {
297 SkOpSegment* nextChase(SkOpSpanBase** , int* step, SkOpSpan** , SkOpSpanBase** last) const;
308 const SkOpSegment* prev() const {
350 void setNext(SkOpSegment* next) {
354 void setPrev(SkOpSegment* prev) {
396 const SkOpSpanBase* spanBase, const SkOpSegment* opp) const;
432 SkOpSegment* fNext; // forward-only linked list used by contour to walk the segments
433 const SkOpSegment* fPrev;