47       : fEdge(edge), fEvent(nullptr), fPrev(prev), fNext(next) {  in SSEdge()
49     Edge*     fEdge;  member
77                   prev->fID, next->fID, e->fEdge->fTop->fID, e->fEdge->fBottom->fID, p.fX, p.fY,  in makeEvent()
89     Vertex* top = edge->fEdge->fTop;  in makeEvent()
90     Vertex* bottom = edge->fEdge->fBottom;  in makeEvent()
94     Line line = edge->fEdge->fLine;  in makeEvent()
126         if (edge->fEdge) {  in dump_skel()
130             if (edge->fEdge->fTop && edge->fEdge->fBottom) {  in dump_skel()
132                          edge->fEdge->fTop->fID,  in dump_skel()
133                          edge->fEdge->fBottom->fID);  in dump_skel()
247     if (!fEdge) {  in apply()
250     Vertex* prev = fEdge->fPrev->fVertex;  in apply()
251     Vertex* next = fEdge->fNext->fVertex;  in apply()
252     SSEdge* prevEdge = fEdge->fPrev->fPrev;  in apply()
253     SSEdge* nextEdge = fEdge->fNext->fNext;  in apply()
254     if (!prevEdge || !nextEdge || !prevEdge->fEdge || !nextEdge->fEdge) {  in apply()
261              prev->fID, next->fID, fEdge->fEdge->fTop->fID, fEdge->fEdge->fBottom->fID, dest->fID,  in apply()
263     fEdge->fEdge = nullptr;  in apply()
271     if (!prevEdge->fEdge || !nextEdge->fEdge) {  in apply()
275         prevEdge->fEvent->fEdge = nullptr;  in apply()
278         nextEdge->fEvent->fEdge = nullptr;  in apply()
282         prevEdge->fEdge = nextEdge->fEdge = nullptr;  in apply()
284         triangulator->computeBisector(prevEdge->fEdge, nextEdge->fEdge, dest);  in apply()
285         SkASSERT(prevEdge != fEdge && nextEdge != fEdge);  in apply()
391         if (Edge* e = edge->fEdge) {  in collapseOverlapRegions()