GrTriangulator::EdgeList Struct Reference

#include <GrTriangulator.h>

Public Member Functions
	EdgeList ()
void	insert (Edge *edge, Edge *prev, Edge *next)
bool	insert (Edge *edge, Edge *prev)
void	append (Edge *e)
bool	remove (Edge *edge)
void	removeAll ()
void	close ()
bool	contains (Edge *edge) const

Public Attributes
Edge *	fHead
Edge *	fTail

Detailed Description

Definition at line 463 of file GrTriangulator.h.

Constructor & Destructor Documentation

EdgeList()

GrTriangulator::EdgeList::EdgeList ( )

inline

Definition at line 464 of file GrTriangulator.h.

: fHead(nullptr), fTail(nullptr) {}

Member Function Documentation

append()

void GrTriangulator::EdgeList::append ( Edge *  e )

inline

Definition at line 469 of file GrTriangulator.h.

{ insert(e, fTail, nullptr); }

close()

void GrTriangulator::EdgeList::close ( )

inline

Definition at line 476 of file GrTriangulator.h.

                 {
        if (fHead && fTail) {
            fTail->fRight = fHead;
            fHead->fLeft = fTail;
        }
    }

contains()

bool GrTriangulator::EdgeList::contains ( Edge *  edge ) const

inline

Definition at line 482 of file GrTriangulator.h.

{ return edge->fLeft || edge->fRight || fHead == edge; }

insert() [1/2]

bool EdgeList::insert	(	Edge *	edge,
		Edge *	prev
	)

Definition at line 657 of file GrTriangulator.cpp.

                                            {
    TESS_LOG("inserting edge %g -> %g\n", edge->fTop->fID, edge->fBottom->fID);
    // SkASSERT(!this->contains(edge));  // Leave this here for debugging.
    if (this->contains(edge)) {
        return false;
    }
    Edge* next = prev ? prev->fRight : fHead;
    this->insert(edge, prev, next);
    return true;
}

insert() [2/2]

void GrTriangulator::EdgeList::insert	(	Edge *	edge,
		Edge *	prev,
		Edge *	next
	)

Definition at line 304 of file GrTriangulator.cpp.

                                                                      {
    list_insert<Edge, &Edge::fLeft, &Edge::fRight>(edge, prev, next, &fHead, &fTail);
}

remove()

bool GrTriangulator::EdgeList::remove

(

Edge *

edge

)

Definition at line 308 of file GrTriangulator.cpp.

                                              {
    TESS_LOG("removing edge %g -> %g\n", edge->fTop->fID, edge->fBottom->fID);
    // SkASSERT(this->contains(edge));  // Leave this here for future debugging.
    if (!this->contains(edge)) {
        return false;
    }
    list_remove<Edge, &Edge::fLeft, &Edge::fRight>(edge, &fHead, &fTail);
    return true;
}

removeAll()

void GrTriangulator::EdgeList::removeAll ( )

inline

Definition at line 471 of file GrTriangulator.h.

                     {
        while (fHead) {
            this->remove(fHead);
        }
    }

Member Data Documentation

fHead

Edge* GrTriangulator::EdgeList::fHead

Definition at line 465 of file GrTriangulator.h.

fTail

Edge* GrTriangulator::EdgeList::fTail

Definition at line 466 of file GrTriangulator.h.

---

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

• third_party/skia/src/gpu/ganesh/geometry/GrTriangulator.h
• third_party/skia/src/gpu/ganesh/geometry/GrTriangulator.cpp