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

Lines Matching defs:lB
2730 	  int lB = chgts[cCh].bord;
2731 	  int lftN = lS->swsData[lB].leftRnd;
2732 	  int rgtN = lS->swsData[lB].rightRnd;
2737 //                      for (int n=lftN;n<=rgtN;n++) CreateIncidence(lS,lB,n);
2740 	      if (TesteAdjacency (lS, lB, getPoint(n).x, n, false) ==
2743               lS->swsData[lB].leftRnd = n;
2747 	      if (TesteAdjacency (lS, lB, getPoint(n).x, n, false) ==
2750 	      lS->swsData[lB].rightRnd = n;
2920 		    int &edgeHead, sTreeChangeType type, Shape * lS, int lB, Shape * rS,
2927     c.bord = lB;
2936 	SweepTree *lE = static_cast < SweepTree * >(lS->swsData[lB].misc);
2946 	if (lS->swsData[lB].leftRnd < lastChgtPt) {
2947 	    lS->swsData[lB].leftRnd = lastPointNo;
2948 	    lS->swsData[lB].nextSh = shapeHead;
2949 	    lS->swsData[lB].nextBo = edgeHead;
2950 	    edgeHead = lB;
2953 	    int old = lS->swsData[lB].leftRnd;
2955 		lS->swsData[lB].leftRnd = lastPointNo;
2958 	if (lS->swsData[lB].rightRnd < lastChgtPt) {
2959 	    lS->swsData[lB].rightRnd = lastPointNo;
2961 	    int old = lS->swsData[lB].rightRnd;
2963 		lS->swsData[lB].rightRnd = lastPointNo;
2998 	SweepTree *lE = static_cast < SweepTree * >(lS->swsData[lB].misc);
3047 	  int lB = chgts[cCh].bord;
3048 	  lS->swsData[lB].curPoint = chgts[cCh].ptNo;
3058 	  int lB = chgts[cCh].bord;
3059 	  Avance (lastPointNo, lastChgtPt, lS, lB, a, b, mod);
3111 Shape::Avance (int lastPointNo, int lastChgtPt, Shape * lS, int lB, Shape * /*a*/,
3121   int lftN = lS->swsData[lB].leftRnd;
3122   int rgtN = lS->swsData[lB].rightRnd;
3123   if (lS->swsData[lB].doneTo < lastChgtPt)
3125       int lp = lS->swsData[lB].curPoint;
3128       if (lS->eData[lB].rdx[1] == 0)
3131 	  if (lS->eData[lB].rdx[0] >= 0)
3135 		  DoEdgeTo (lS, lB, p, direct, true);
3143 		  DoEdgeTo (lS, lB, p, direct, false);
3148       else if (lS->eData[lB].rdx[1] > 0)
3150 	  if (lS->eData[lB].rdx[0] >= 0)
3160 			  DoEdgeTo (lS, lB, lftN - 1, direct, true);
3161 			  DoEdgeTo (lS, lB, lftN, direct, true);
3165 			  DoEdgeTo (lS, lB, lftN, direct, true);
3170 		      DoEdgeTo (lS, lB, p, direct, true);
3185 			  DoEdgeTo (lS, lB, rgtN + 1, direct, true);
3186 			  DoEdgeTo (lS, lB, rgtN, direct, true);
3190 			  DoEdgeTo (lS, lB, rgtN, direct, true);
3195 		      DoEdgeTo (lS, lB, p, direct, true);
3203 	  if (lS->eData[lB].rdx[0] >= 0)
3213 			  DoEdgeTo (lS, lB, rgtN + 1, direct, false);
3214 			  DoEdgeTo (lS, lB, rgtN, direct, false);
3218 			  DoEdgeTo (lS, lB, rgtN, direct, false);
3223 		      DoEdgeTo (lS, lB, p, direct, false);
3238 			  DoEdgeTo (lS, lB, lftN - 1, direct, false);
3239 			  DoEdgeTo (lS, lB, lftN, direct, false);
3243 			  DoEdgeTo (lS, lB, lftN, direct, false);
3248 		      DoEdgeTo (lS, lB, p, direct, false);
3254       lS->swsData[lB].curPoint = lp;
3256   lS->swsData[lB].doneTo = lastPointNo - 1;