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

Lines Matching defs:en
114       eData[i].rdx = pData[getEdge(i).en].rx - pData[getEdge(i).st].rx;
282 		      chgts[i].src->getEdge(chgts[i].bord).en)
296 		      chgts[i].src->getEdge(chgts[i].bord).en)
360 	      if ((ptSh->getEdge(cb).st < ptSh->getEdge(cb).en
361 		   && nPt == ptSh->getEdge(cb).en)
362 		  || (ptSh->getEdge(cb).st > ptSh->getEdge(cb).en
368 	      if ((ptSh->getEdge(cb).st > ptSh->getEdge(cb).en
369 		   && nPt == ptSh->getEdge(cb).en)
370 		  || (ptSh->getEdge(cb).st < ptSh->getEdge(cb).en
395 		  if ((ptSh->getEdge(cb).st < ptSh->getEdge(cb).en
396 		       && nPt == ptSh->getEdge(cb).en)
397 		      || (ptSh->getEdge(cb).st > ptSh->getEdge(cb).en
443 				      && (onLeftS->getEdge(onLeftB).en == nPt
451 					  && (onRightS->getEdge(onRightB).en ==
529 		  if ((ptSh->getEdge(cb).st > ptSh->getEdge(cb).en
530 		       && nPt == ptSh->getEdge(cb).en)
531 		      || (ptSh->getEdge(cb).st < ptSh->getEdge(cb).en
595 		chgts[i].src->getEdge(chgts[i].bord).en)
607 		chgts[i].src->getEdge(chgts[i].bord).en)
809       if ( getEdge(i).st < 0 || getEdge(i).en < 0 ) {
1083 		      chgts[i].src->getEdge(chgts[i].bord).en)
1097 		      chgts[i].src->getEdge(chgts[i].bord).en)
1166 	      if ((ptSh->getEdge(cb).st < ptSh->getEdge(cb).en
1167 		   && nPt == ptSh->getEdge(cb).en)
1168 		  || (ptSh->getEdge(cb).st > ptSh->getEdge(cb).en
1174 	      if ((ptSh->getEdge(cb).st > ptSh->getEdge(cb).en
1175 		   && nPt == ptSh->getEdge(cb).en)
1176 		  || (ptSh->getEdge(cb).st < ptSh->getEdge(cb).en
1203 		  if ((ptSh->getEdge(cb).st < ptSh->getEdge(cb).en
1204 		       && nPt == ptSh->getEdge(cb).en)
1205 		      || (ptSh->getEdge(cb).st > ptSh->getEdge(cb).en
1252 				      && (onLeftS->getEdge(onLeftB).en == nPt
1260 					  && (onRightS->getEdge(onRightB).en ==
1342 		  if ((ptSh->getEdge(cb).st > ptSh->getEdge(cb).en
1343 		       && nPt == ptSh->getEdge(cb).en)
1344 		      || (ptSh->getEdge(cb).st < ptSh->getEdge(cb).en
1413 		chgts[i].src->getEdge(chgts[i].bord).en)
1425 		chgts[i].src->getEdge(chgts[i].bord).en)
1469         int nEd=AddEdge(getEdge(i).en,getEdge(i).st);
1476         if ( getEdge(i).en >= getEdge(i).st ) {
1576       if ( getEdge(i).st < 0 || getEdge(i).en < 0 ) {
1601       if ( ebData[i].pathID == cutPathID || getEdge(i).st < 0 || getEdge(i).en < 0 ) {
1678   int lSt = iL->src->getEdge(iL->bord).st, lEn = iL->src->getEdge(iL->bord).en;
1679   int rSt = iR->src->getEdge(iR->bord).st, rEn = iR->src->getEdge(iR->bord).en;
1766   lEn = iL->src->getEdge(iL->bord).en;
1768   rEn = iR->src->getEdge(iR->bord).en;
2015   if (getEdge(askTo).st < getEdge(askTo).en)
2037       aen = pData[getEdge(i).en].rx;
2111 Shape::AssemblePoints (int st, int en)
2113   if (en > st) {
2114    for (int i = st; i < en; i++) pData[i].oldInd = i;
2115 //              SortPoints(st,en-1);
2116     SortPointsByOldInd (st, en - 1); // SortPointsByOldInd() is required here, because of the edges we have
2120      for (int i = st; i < en; i++) pData[pData[i].oldInd].newInd = i;
2123      for (int i = st; i < en; i++) {
2137 		      // en pratique, n'arrive que si 2 maxima sont dans la meme case -> le mauvais choix prend une arete incidente 
2152       for (int i = st; i < en; i++) pData[i].newInd = pData[pData[i].newInd].pending;
2155   return en;
2189       if ((getEdge(cb).st == getEdge(cc).st && getEdge(cb).en == getEdge(cc).en)
2190           || (getEdge(cb).st == getEdge(cc).en && getEdge(cb).en == getEdge(cc).en)) doublon=true;
2401       if ( fi == getEdge(startBord).en ) {
2407           pData[getEdge(startBord).st].askForWindingB=pData[getEdge(startBord).en].askForWindingB;
2411 		if (getEdge(startBord).en == fi)
2418 	  // parcours en profondeur pour mettre les leF et riF a leurs valeurs
2431 		cPt = getEdge(curBord).en;
2439 		  if (getEdge(nb).en == cPt)
2460 		  // retour en arriere
2465 		    oPt = getEdge(curBord).en;
2470 		  if (oPt == getEdge(curBord).en)
2493 		  if (cPt == getEdge(nb).en)
2512   int lSt = ils->getEdge(ilb).st, lEn = ils->getEdge(ilb).en;
2513   int rSt = irs->getEdge(irb).st, rEn = irs->getEdge(irb).en;
2600   // a mettre en double precision pour des resultats exacts
2636   // plus de colinearite ni d'extremites en commun
2663   aen = a->pData[a->getEdge(no).en].rx;
3292 	  Geom::Point pex = getPoint(getEdge(ne).en).x;