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

Lines Matching defs:lastPointNo
255       int lastPointNo = AddPoint (rPtX);
256       pData[lastPointNo].rx = rPtX;
260 	  int lastI = AssemblePoints (lastChgtPt, lastPointNo);
322     if (lastI < lastPointNo) {
323           _pts[lastI] = getPoint(lastPointNo);
324 	   pData[lastI] = pData[lastPointNo];
326 	  lastPointNo = lastI;
329 	  lastChgtPt = lastPointNo;
343 	  AddChgt (lastPointNo, lastChgtPt, shapeHead, edgeHead, INTERSECTION,
409 			      AddChgt (lastPointNo, lastChgtPt, shapeHead,
478 		  AddChgt (lastPointNo, lastChgtPt, shapeHead, edgeHead, EDGE_REMOVED,
484 		  node->ConvertTo (ptSh, dnNo, 1, lastPointNo);
490 		  ptSh->swsData[dnNo].curPoint = lastPointNo;
491 		  AddChgt (lastPointNo, lastChgtPt, shapeHead, edgeHead, EDGE_INSERTED,
496 		  SweepTree *node = sTree->add(ptSh, dnNo, 1, lastPointNo, this);
498 		  node->Insert (*sTree, *sEvts, this, lastPointNo, true);
505 			  pData[lastPointNo].askForWindingS = myLeft->src;
506 			  pData[lastPointNo].askForWindingB = myLeft->bord;
510 			  pData[lastPointNo].askForWindingB = -1;
518 		  ptSh->swsData[dnNo].curPoint = lastPointNo;
519 		  AddChgt (lastPointNo, lastChgtPt, shapeHead, edgeHead, EDGE_INSERTED,
536 			  SweepTree *node = sTree->add(ptSh, cb, 1, lastPointNo, this);
546 				  pData[lastPointNo].askForWindingS =
548 				  pData[lastPointNo].askForWindingB =
553 				  pData[lastPointNo].askForWindingB = -1;
560 			  ptSh->swsData[cb].curPoint = lastPointNo;
561 			  AddChgt (lastPointNo, lastChgtPt, shapeHead,
1055       int lastPointNo = AddPoint (rPtX);
1056       pData[lastPointNo].rx = rPtX;
1060 	  int lastI = AssemblePoints (lastChgtPt, lastPointNo);
1126     if (lastI < lastPointNo)
1128 	      _pts[lastI] = getPoint(lastPointNo);
1129 	      pData[lastI] = pData[lastPointNo];
1131 	  lastPointNo = lastI;
1134 	  lastChgtPt = lastPointNo;
1149 	  AddChgt (lastPointNo, lastChgtPt, shapeHead, edgeHead, INTERSECTION,
1217 			      AddChgt (lastPointNo, lastChgtPt, shapeHead,
1287 		  AddChgt (lastPointNo, lastChgtPt, shapeHead, edgeHead, EDGE_REMOVED,
1293 		  node->ConvertTo (ptSh, dnNo, 1, lastPointNo);
1299 		  ptSh->swsData[dnNo].curPoint = lastPointNo;
1301 		  AddChgt (lastPointNo, lastChgtPt, shapeHead, edgeHead, EDGE_INSERTED,
1306 		  SweepTree *node = sTree->add(ptSh, dnNo, 1, lastPointNo, this);
1308 		  node->Insert (*sTree, *sEvts, this, lastPointNo, true);
1316 			  pData[lastPointNo].askForWindingS = myLeft->src;
1317 			  pData[lastPointNo].askForWindingB = myLeft->bord;
1321 			  pData[lastPointNo].askForWindingB = -1;
1330 		  ptSh->swsData[dnNo].curPoint = lastPointNo;
1332 		  AddChgt (lastPointNo, lastChgtPt, shapeHead, edgeHead, EDGE_INSERTED,
1349 			  SweepTree *node = sTree->add(ptSh, cb, 1, lastPointNo, this);
1351 //                                                      node->Insert(sTree,*sEvts,this,lastPointNo,true);
1361 				  pData[lastPointNo].askForWindingS =
1363 				  pData[lastPointNo].askForWindingB =
1368 				  pData[lastPointNo].askForWindingB = -1;
1376 			  ptSh->swsData[cb].curPoint = lastPointNo;
1378 			  AddChgt (lastPointNo, lastChgtPt, shapeHead,
2720 Shape::CheckAdjacencies (int lastPointNo, int lastChgtPt, Shape * /*shapeHead*/,
2745 	  for (int n = rgtN + 1; n < lastPointNo; n++)
2771 	  for (int n = rgtN + 1; n < lastPointNo; n++)
2878 		  for (int n = chRiN + 1; n < lastPointNo; n++)
2919 void Shape::AddChgt(int lastPointNo, int lastChgtPt, Shape * &shapeHead,
2924     c.ptNo = lastPointNo;
2947 	    lS->swsData[lB].leftRnd = lastPointNo;
2954 	    if (getPoint(old).x[0] > getPoint(lastPointNo).x[0]) {
2955 		lS->swsData[lB].leftRnd = lastPointNo;
2959 	    lS->swsData[lB].rightRnd = lastPointNo;
2962 	    if (getPoint(old).x[0] < getPoint(lastPointNo).x[0])
2963 		lS->swsData[lB].rightRnd = lastPointNo;
2979 	    rS->swsData[rB].leftRnd = lastPointNo;
2986 	    if (getPoint(old).x[0] > getPoint(lastPointNo).x[0]) {
2987 		rS->swsData[rB].leftRnd = lastPointNo;
2991 	    rS->swsData[rB].rightRnd = lastPointNo;
2994 	    if (getPoint(old).x[0] < getPoint(lastPointNo).x[0])
2995 		rS->swsData[rB].rightRnd = lastPointNo;
3038 Shape::CheckEdges (int lastPointNo, int lastChgtPt, Shape * a, Shape * b,
3059 	  Avance (lastPointNo, lastChgtPt, lS, lB, a, b, mod);
3065 	  Avance (lastPointNo, lastChgtPt, rS, rB, a, b, mod);
3074 	      Avance (lastPointNo, lastChgtPt, nSrc, nBrd, a, b, mod);
3094 	      Avance (lastPointNo, lastChgtPt, nSrc, nBrd, a, b, mod);
3111 Shape::Avance (int lastPointNo, int lastChgtPt, Shape * lS, int lB, Shape * /*a*/,
3182 		      if (rgtN < numberOfPoints() && rgtN + 1 < lastPointNo
3210 		      if (rgtN < numberOfPoints() && rgtN + 1 < lastPointNo
3256   lS->swsData[lB].doneTo = lastPointNo - 1;