Lines Matching defs:next
46 SSEdge(Edge* edge, SSVertex* prev, SSVertex* next)
47 : fEdge(edge), fEvent(nullptr), fPrev(prev), fNext(next) {
66 Vertex* next = e->fNext->fVertex;
67 if (prev == next || !prev->fPartner || !next->fPartner) {
71 Edge bisector2(next, next->fPartner, 1, EdgeType::kConnector);
77 prev->fID, next->fID, e->fEdge->fTop->fID, e->fEdge->fBottom->fID, p.fX, p.fY,
154 Edge* next = e->fNextEdgeAbove;
161 e = next;
190 Vertex* next = e->fWinding == 1 ? e->fBottom : e->fTop;
192 double distNext = prevEdge->dist(next->fPoint);
196 if (prev == next) {
206 Edge* join = this->makeEdge(prev, next, EdgeType::kInner, c);
207 if (prev->fPoint != next->fPoint) {
251 Vertex* next = fEdge->fNext->fVertex;
261 prev->fID, next->fID, fEdge->fEdge->fTop->fID, fEdge->fEdge->fBottom->fID, dest->fID,
266 triangulator->connectSSEdge(next, dest, c);
398 static bool inversion(Vertex* prev, Vertex* next, Edge* origEdge, const Comparator& c) {
399 if (!prev || !next) {
402 int winding = c.sweep_lt(prev->fPoint, next->fPoint) ? 1 : -1;
576 Edge* next;
582 if ((next = e->fNextEdgeAbove)) {
584 } else if ((next = e->fBottom->fLastEdgeBelow)) {
586 } else if ((next = e->fPrevEdgeAbove)) {
591 if ((next = e->fPrevEdgeBelow)) {
593 } else if ((next = e->fTop->fFirstEdgeAbove)) {
595 } else if ((next = e->fNextEdgeBelow)) {
600 e = next;