Lines Matching defs:dest
84 void GrAATriangulator::makeEvent(SSEdge* edge, Vertex* v, SSEdge* other, Vertex* dest,
95 line.fC = -(dest->fPoint.fX * line.fA + dest->fPoint.fY * line.fB);
98 uint8_t alpha = dest->fAlpha;
103 dest->fID, v->fID, top->fID, bottom->fID, p.fX, p.fY, alpha);
230 void GrAATriangulator::connectSSEdge(Vertex* v, Vertex* dest, const Comparator& c) const {
231 if (v == dest) {
234 TESS_LOG("ss_connecting vertex %g to vertex %g\n", v->fID, dest->fID);
236 this->makeConnectingEdge(v, dest, EdgeType::kConnector, c, 0);
238 TESS_LOG("setting %g's partner to %g ", v->fPartner->fID, dest->fID);
240 v->fPartner->fPartner = dest;
257 Vertex* dest = triangulator->makeSortedVertex(fPoint, fAlpha, mesh, prev, c);
258 dest->fSynthetic = true;
259 SSVertex* ssv = triangulator->fAlloc->make<SSVertex>(dest);
261 prev->fID, next->fID, fEdge->fEdge->fTop->fID, fEdge->fEdge->fBottom->fID, dest->fID,
265 triangulator->connectSSEdge(prev, dest, c);
266 triangulator->connectSSEdge(next, dest, c);
281 triangulator->connectSSEdge(prevEdge->fPrev->fVertex, dest, c);
284 triangulator->computeBisector(prevEdge->fEdge, nextEdge->fEdge, dest);
286 if (dest->fPartner) {
290 triangulator->makeEvent(prevEdge, prevEdge->fPrev->fVertex, nextEdge, dest, events, c);
291 triangulator->makeEvent(nextEdge, nextEdge->fNext->fVertex, prevEdge, dest, events, c);