Lines Matching defs:en
65 printf("ar %u : dx=(%f %f) st=%i en=%i\n",i, _aretes[i].dx[0], _aretes[i].dx[1], _aretes[i].st, _aretes[i].en); // localizing ok
377 else if (getEdge(cb).en == p)
381 _aretes[cb].en = -1;
407 else if (getEdge(cb).en == a)
409 _aretes[cb].en = numberOfPoints();
416 else if (getEdge(cb).en == a)
418 _aretes[cb].en = numberOfPoints();
426 else if (getEdge(cb).en == b)
428 _aretes[cb].en = a;
435 else if (getEdge(cb).en == b)
437 _aretes[cb].en = a;
445 else if (getEdge(cb).en == numberOfPoints())
447 _aretes[cb].en = b;
454 else if (getEdge(cb).en == numberOfPoints())
456 _aretes[cb].en = b;
471 else if (getEdge(cb).en == a)
473 _aretes[cb].en = numberOfPoints();
485 else if (getEdge(cb).en == b)
487 _aretes[cb].en = a;
499 else if (getEdge(cb).en == numberOfPoints())
501 _aretes[cb].en = b;
1121 Shape::AddEdge (int st, int en)
1123 if (st == en)
1125 if (st < 0 || en < 0)
1147 a.st = a.en = -1;
1150 if (st >= 0 && en >= 0) {
1151 a.dx = getPoint(en).x - getPoint(st).x;
1158 ConnectEnd (en, n);
1185 Shape::AddEdge (int st, int en, int leF, int riF)
1187 if (st == en)
1189 if (st < 0 || en < 0)
1195 if (getEdge(cb).st == st && getEdge(cb).en == en)
1197 if (getEdge(cb).st == en && getEdge(cb).en == st)
1222 a.st = a.en = -1;
1225 if (st >= 0 && en >= 0) {
1226 a.dx = getPoint(en).x - getPoint(st).x;
1233 ConnectEnd (en, n);
1284 else if (getEdge(getEdge(a).prevS).en == getEdge(a).st)
1295 else if (getEdge(getEdge(a).nextS).en == getEdge(a).st)
1302 if (getEdge(getEdge(a).prevE).st == getEdge(a).en)
1306 else if (getEdge(getEdge(a).prevE).en == getEdge(a).en)
1313 if (getEdge(getEdge(a).nextE).st == getEdge(a).en)
1317 else if (getEdge(getEdge(a).nextE).en == getEdge(a).en)
1329 if (getEdge(a).en >= 0)
1331 if (getPoint(getEdge(a).en).incidentEdge[FIRST] == a)
1332 _pts[getEdge(a).en].incidentEdge[FIRST] = numberOfEdges();
1333 if (getPoint(getEdge(a).en).incidentEdge[LAST] == a)
1334 _pts[getEdge(a).en].incidentEdge[LAST] = numberOfEdges();
1344 else if (getEdge(getEdge(b).prevS).en == getEdge(b).st)
1355 else if (getEdge(getEdge(b).nextS).en == getEdge(b).st)
1362 if (getEdge(getEdge(b).prevE).st == getEdge(b).en)
1366 else if (getEdge(getEdge(b).prevE).en == getEdge(b).en)
1373 if (getEdge(getEdge(b).nextE).st == getEdge(b).en)
1377 else if (getEdge(getEdge(b).nextE).en == getEdge(b).en)
1392 p = getEdge(b).en;
1406 p = getEdge(a).en;
1876 else if (getEdge(getPoint(p).incidentEdge[LAST]).en == p)
1889 if (getEdge(b).en >= 0)
1891 _aretes[b].en = p;
1901 else if (getEdge(getPoint(p).incidentEdge[LAST]).en == p)
1923 else if (getEdge(getEdge(b).prevS).en == getEdge(b).st)
1934 else if (getEdge(getEdge(b).nextS).en == getEdge(b).st)
1949 if (getEdge(b).en < 0)
1951 _pts[getEdge(b).en].dI--;
1954 if (getEdge(getEdge(b).prevE).st == getEdge(b).en)
1958 else if (getEdge(getEdge(b).prevE).en == getEdge(b).en)
1965 if (getEdge(getEdge(b).nextE).st == getEdge(b).en)
1969 else if (getEdge(getEdge(b).nextE).en == getEdge(b).en)
1974 if (getPoint(getEdge(b).en).incidentEdge[FIRST] == b)
1975 _pts[getEdge(b).en].incidentEdge[FIRST] = getEdge(b).nextE;
1976 if (getPoint(getEdge(b).en).incidentEdge[LAST] == b)
1977 _pts[getEdge(b).en].incidentEdge[LAST] = getEdge(b).prevE;
1978 _aretes[b].en = -1;
1987 _aretes[b].st = getEdge(b).en;
1988 _aretes[b].en = swap;
2001 if (getEdge(b).en >= 0)
2003 _pts[getEdge(b).en].dO--;
2004 _pts[getEdge(b).en].dI++;
2075 Geom::Point const aen = getPoint(getEdge(i).en).x;
2141 eData[i].rdx = pData[getEdge(i).en].rx - pData[getEdge(i).st].rx;
2224 if ( s->getEdge(i).st >= 0 && s->getEdge(i).en >= 0 ) {
2227 Geom::Point const en(s->getPoint(s->getEdge(i).en).x); // edge end
2230 Geom::Point const e(en - st); // vector of the edge
2290 if ( s->getEdge(i).st >= 0 && s->getEdge(i).en >= 0 ) {
2292 Geom::Point const en(s->getPoint(s->getEdge(i).en).x);
2294 Geom::Point const e(en - st);