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

Lines Matching refs:ptSh
217       Shape *ptSh = NULL;
233 	      ptSh = a;
234 	      ptX = ptSh->pData[nPt].rx;
241 	  ptSh = a;
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];
358 	  while (cb >= 0 && cb < ptSh->numberOfEdges())
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
363 		      && nPt == ptSh->getEdge(cb).st))
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
371 		      && nPt == ptSh->getEdge(cb).st))
376 	      cb = ptSh->NextAt (nPt, cb);
383 	  if (upNo >= 0 && (SweepTree *) ptSh->swsData[upNo].misc == NULL)
392 	      cb = ptSh->getPoint(nPt).incidentEdge[FIRST];
393 	      while (cb >= 0 && cb < ptSh->numberOfEdges())
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
398 			  && nPt == ptSh->getEdge(cb).st))
403 			    (SweepTree *) ptSh->swsData[cb].misc;
412 			      ptSh->swsData[cb].misc = NULL;
442 				  if (onLeftS == ptSh
450 				      if (onRightS == ptSh
466 		  cb = ptSh->NextAt (nPt, cb);
476 		  SweepTree *node = (SweepTree *) ptSh->swsData[upNo].misc;
481 		  ptSh->swsData[upNo].misc = NULL;
484 		  node->ConvertTo (ptSh, dnNo, 1, lastPointNo);
485 		  ptSh->swsData[dnNo].misc = node;
490 		  ptSh->swsData[dnNo].curPoint = lastPointNo;
496 		  SweepTree *node = sTree->add(ptSh, dnNo, 1, lastPointNo, this);
497 		  ptSh->swsData[dnNo].misc = node;
518 		  ptSh->swsData[dnNo].curPoint = lastPointNo;
526 	      cb = ptSh->getPoint(nPt).incidentEdge[FIRST];
527 	      while (cb >= 0 && cb < ptSh->numberOfEdges())
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
532 			  && nPt == ptSh->getEdge(cb).st))
536 			  SweepTree *node = sTree->add(ptSh, cb, 1, lastPointNo, this);
537 			  ptSh->swsData[cb].misc = node;
560 			  ptSh->swsData[cb].curPoint = lastPointNo;
566 		  cb = ptSh->NextAt (nPt, cb);
922       Shape *ptSh = NULL;
947 			  ptSh = a;
948 			  ptX = ptSh->pData[nPt].rx;
966 			  ptSh = b;
967 			  ptX = ptSh->pData[nPt].rx;
986 		      ptSh = a;
987 		      ptX = ptSh->pData[nPt].rx;
1006 		  ptSh = b;
1007 		  ptX = ptSh->pData[nPt].rx;
1023 		      ptSh = a;
1028 		      ptSh = b;
1034 		  ptSh = a;
1040 	      ptSh = b;
1042 	  ptX = ptSh->pData[nPt].rx;
1048 	  if (ptSh->getPoint(nPt).dI == 0 && ptSh->getPoint(nPt).dO == 0)
1163 	  cb = ptSh->getPoint(nPt).incidentEdge[FIRST];
1164 	  while (cb >= 0 && cb < ptSh->numberOfEdges())
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
1169 		      && nPt == ptSh->getEdge(cb).st))
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
1177 		      && nPt == ptSh->getEdge(cb).st))
1182 	      cb = ptSh->NextAt (nPt, cb);
1189 	  if (upNo >= 0 && (SweepTree *) ptSh->swsData[upNo].misc == NULL)
1200 	      cb = ptSh->getPoint(nPt).incidentEdge[FIRST];
1201 	      while (cb >= 0 && cb < ptSh->numberOfEdges())
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
1206 			  && nPt == ptSh->getEdge(cb).st))
1211 			    (SweepTree *) ptSh->swsData[cb].misc;
1220 			      ptSh->swsData[cb].misc = NULL;
1251 				  if (onLeftS == ptSh
1259 				      if (onRightS == ptSh
1275 		  cb = ptSh->NextAt (nPt, cb);
1285 		  SweepTree *node = (SweepTree *) ptSh->swsData[upNo].misc;
1290 		  ptSh->swsData[upNo].misc = NULL;
1293 		  node->ConvertTo (ptSh, dnNo, 1, lastPointNo);
1294 		  ptSh->swsData[dnNo].misc = node;
1299 		  ptSh->swsData[dnNo].curPoint = lastPointNo;
1306 		  SweepTree *node = sTree->add(ptSh, dnNo, 1, lastPointNo, this);
1307 		  ptSh->swsData[dnNo].misc = node;
1330 		  ptSh->swsData[dnNo].curPoint = lastPointNo;
1339 	      cb = ptSh->getPoint(nPt).incidentEdge[FIRST];
1340 	      while (cb >= 0 && cb < ptSh->numberOfEdges())
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
1345 			  && nPt == ptSh->getEdge(cb).st))
1349 			  SweepTree *node = sTree->add(ptSh, cb, 1, lastPointNo, this);
1350 			  ptSh->swsData[cb].misc = node;
1376 			  ptSh->swsData[cb].curPoint = lastPointNo;
1383 		  cb = ptSh->NextAt (nPt, cb);