Cross Reference: /inkscape/src/livarot/Shape.cpp

Lines Matching defs:st
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
370       if (getEdge(cb).st == p)
374           _aretes[cb].st = -1;
403       if (getEdge(cb).st == a)
405           _aretes[cb].st = numberOfPoints();
412       if (getEdge(cb).st == a)
414           _aretes[cb].st = numberOfPoints();
422       if (getEdge(cb).st == b)
424           _aretes[cb].st = a;
431       if (getEdge(cb).st == b)
433           _aretes[cb].st = a;
441       if (getEdge(cb).st == numberOfPoints())
443           _aretes[cb].st = b;
450       if (getEdge(cb).st == numberOfPoints())
452           _aretes[cb].st = b;
467           if (getEdge(cb).st == a)
469               _aretes[cb].st = numberOfPoints();
481           if (getEdge(cb).st == b)
483               _aretes[cb].st = a;
495           if (getEdge(cb).st == numberOfPoints())
497               _aretes[cb].st = 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;
1157   ConnectStart (st, n);
1185 Shape::AddEdge (int st, int en, int leF, int riF)
1187   if (st == en)
1189   if (st < 0 || en < 0)
1192     int cb = getPoint(st).incidentEdge[FIRST];
1195         if (getEdge(cb).st == st && getEdge(cb).en == en)
1197         if (getEdge(cb).st == en && getEdge(cb).en == st)
1199         cb = NextAt (st, cb);
1222   a.st = a.en = -1;
1225   if (st >= 0 && en >= 0) {
1226     a.dx = getPoint(en).x - getPoint(st).x;
1232   ConnectStart (st, n);
1280       if (getEdge(getEdge(a).prevS).st == getEdge(a).st)
1284       else if (getEdge(getEdge(a).prevS).en == getEdge(a).st)
1291       if (getEdge(getEdge(a).nextS).st == getEdge(a).st)
1295       else if (getEdge(getEdge(a).nextS).en == getEdge(a).st)
1302       if (getEdge(getEdge(a).prevE).st == getEdge(a).en)
1313       if (getEdge(getEdge(a).nextE).st == getEdge(a).en)
1322   if (getEdge(a).st >= 0)
1324       if (getPoint(getEdge(a).st).incidentEdge[FIRST] == a)
1325         _pts[getEdge(a).st].incidentEdge[FIRST] = numberOfEdges();
1326       if (getPoint(getEdge(a).st).incidentEdge[LAST] == a)
1327         _pts[getEdge(a).st].incidentEdge[LAST] = numberOfEdges();
1340       if (getEdge(getEdge(b).prevS).st == getEdge(b).st)
1344       else if (getEdge(getEdge(b).prevS).en == getEdge(b).st)
1351       if (getEdge(getEdge(b).nextS).st == getEdge(b).st)
1355       else if (getEdge(getEdge(b).nextS).en == getEdge(b).st)
1362       if (getEdge(getEdge(b).prevE).st == getEdge(b).en)
1373       if (getEdge(getEdge(b).nextE).st == getEdge(b).en)
1385     int p = getEdge(b).st;
1399     p = getEdge(a).st;
1502               if (getEdge(cb).st == p)
1863   if (getEdge(b).st >= 0)
1866   _aretes[b].st = p;
1872       if (getEdge(getPoint(p).incidentEdge[LAST]).st == p)
1897       if (getEdge(getPoint(p).incidentEdge[LAST]).st == p)
1914   if (getEdge(b).st < 0)
1916   _pts[getEdge(b).st].dO--;
1919       if (getEdge(getEdge(b).prevS).st == getEdge(b).st)
1923       else if (getEdge(getEdge(b).prevS).en == getEdge(b).st)
1930       if (getEdge(getEdge(b).nextS).st == getEdge(b).st)
1934       else if (getEdge(getEdge(b).nextS).en == getEdge(b).st)
1939   if (getPoint(getEdge(b).st).incidentEdge[FIRST] == b)
1940     _pts[getEdge(b).st].incidentEdge[FIRST] = getEdge(b).nextS;
1941   if (getPoint(getEdge(b).st).incidentEdge[LAST] == b)
1942     _pts[getEdge(b).st].incidentEdge[LAST] = getEdge(b).prevS;
1943   _aretes[b].st = -1;
1954       if (getEdge(getEdge(b).prevE).st == getEdge(b).en)
1965       if (getEdge(getEdge(b).nextE).st == getEdge(b).en)
1986   swap = getEdge(b).st;
1987   _aretes[b].st = getEdge(b).en;
1996   if (getEdge(b).st >= 0)
1998       _pts[getEdge(b).st].dO++;
1999       _pts[getEdge(b).st].dI--;
2074     Geom::Point const ast = getPoint(getEdge(i).st).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 ) {
2226             Geom::Point const st(s->getPoint(s->getEdge(i).st).x); // edge start
2229             Geom::Point const d(p - st);       // vector between p and edge start
2230             Geom::Point const e(en - st);      // vector of the edge
2290         if ( s->getEdge(i).st >= 0 && s->getEdge(i).en >= 0 ) {
2291             Geom::Point const st(s->getPoint(s->getEdge(i).st).x);
2293             Geom::Point const d(p - st);
2294             Geom::Point const e(en - st);