Searched defs:nPt (Results 1 - 3 of 3) sorted by relevance

/inkscape/src/livarot/
H A DShapeRaster.cpp142 int nPt = (d == DOWNWARDS) ? curPt++ : --curPt; local
149 _countUpDown(nPt, &nbUp, &nbDn, &upNo, &dnNo);
169 int cb = getPoint(nPt).incidentEdge[FIRST];
173 if ( (d == DOWNWARDS && nPt == std::max(e.st, e.en)) ||
174 (d == UPWARDS && nPt == std::min(e.st, e.en)) )
186 cb = NextAt(nPt, cb);
200 int const P = (d == DOWNWARDS) ? nPt : Other(nPt, neNo);
208 SweepTree* node = sTree->add(this, dnNo, 1, nPt, this);
210 node->Insert(*sTree, *sEvts, this, nPt, tru
296 int nPt = (d == DOWNWARDS) ? curPt++ : --curPt; local
641 int nPt = (e.st < curPt) ? e.st : e.en; local
676 int nPt = (e.st > curPt) ? e.st : e.en; local
738 int nPt = (e.st < e.en) ? e.st : e.en; local
769 int nPt = (e.st > e.en) ? e.st : e.en; local
845 int nPt = curPt++; local
1023 int nPt = curPt++; local
1134 int nPt = curPt++; local
1286 int nPt = curPt++; local
1437 int nPt = curPt++; local
1532 int nPt = curPt++; local
[all...]
H A DPathSimplify.cpp405 Geom::Point nPt; local
407 nPt[0] = data.Xk[i];
408 nPt[1] = data.Yk[i];
410 double nle = DistanceToCubic(start, res, nPt);
469 Geom::Point nPt; local
470 nPt[Geom::X] = data.Xk[i];
471 nPt[Geom::Y] = data.Yk[i];
472 double nle = DistanceToCubic(start, res, nPt);
811 Geom::Point nPt; local
813 nPt[
[all...]
H A DShapeSweep.cpp216 int nPt = -1; local
232 nPt = curAPt++;
234 ptX = ptSh->pData[nPt].rx;
240 nPt = curAPt++;
242 ptX = ptSh->pData[nPt].rx;
248 if (ptSh->getPoint(nPt).dI == 0 && ptSh->getPoint(nPt).dO == 0)
357 cb = ptSh->getPoint(nPt).incidentEdge[FIRST];
361 && nPt == ptSh->getEdge(cb).en)
363 && nPt
921 int nPt = -1; local
1999 CreateIncidence(Shape * a, int no, int nPt) argument
2654 TesteAdjacency(Shape * a, int no, const Geom::Point atx, int nPt, bool push) argument
[all...]

Completed in 2418 milliseconds