Searched refs:nextEdge (Results 1 – 5 of 5) sorted by relevance
253 SSEdge* nextEdge = fEdge->fNext->fNext; in apply() local254 if (!prevEdge || !nextEdge || !prevEdge->fEdge || !nextEdge->fEdge) { in apply()268 prevEdge->fNext = nextEdge->fPrev = ssv; in apply()270 ssv->fNext = nextEdge; in apply()271 if (!prevEdge->fEdge || !nextEdge->fEdge) { in apply()277 if (nextEdge->fEvent) { in apply()278 nextEdge->fEvent->fEdge = nullptr; in apply()280 if (prevEdge->fPrev == nextEdge->fNext) { in apply()282 prevEdge->fEdge = nextEdge->fEdge = nullptr; in apply()284 triangulator->computeBisector(prevEdge->fEdge, nextEdge->fEdge, dest); in apply()[all …]
188 const nextEdge = queue.pop() constant189 const key = `${nextEdge.from.location}=>${nextEdge.to.location}`196 const from = nextEdge.from200 const to = nextEdge.to
204 int nextEdge(Contour& contour, Edge edge) { in nextEdge() function in OpAsWinding266 this->nextEdge(test, Edge::kInitial); in containerContains()270 int winding = this->nextEdge(contour, Edge::kCompare); in containerContains()408 winder.nextEdge(*contour, OpAsWinding::Edge::kInitial); in AsWinding()
1051 static bool is_smooth_enough(SkAnalyticEdge* thisEdge, SkAnalyticEdge* nextEdge, int stop_y) { in is_smooth_enough() argument1066 return SkAbs32(nextEdge->fDX - thisEdge->fDX) <= SK_Fixed1 && // DDx should be small in is_smooth_enough()1067 nextEdge->fLowerY - nextEdge->fUpperY >= SK_Fixed1; // Dy should be large in is_smooth_enough()1399 goto nextEdge; in insert_new_edges()1410 nextEdge: in insert_new_edges()
59 goto nextEdge; in insert_new_edges()69 nextEdge: in insert_new_edges()