Lines Matching defs:curBord

108       int curBord = startBord;
110 swdData[curBord].precParc = -1;
111 swdData[curBord].suivParc = -1;
114 int cPt = getEdge(curBord).en;
115 int nb = curBord;
116 // printf("de curBord= %d au point %i -> ",curBord,cPt);
128 if (nb < 0 || nb == curBord)
133 if (nb < 0 || nb == curBord)
140 curBord = swdData[curBord].precParc;
141 // printf("retour vers %d\n",curBord);
142 if (curBord < 0)
156 swdData[nb].precParc = curBord;
157 swdData[curBord].suivParc = nb;
158 curBord = nb;
159 // printf("suite %d\n",curBord);
166 while (1 /*swdData[curBord].precParc >= 0 */ );
248 int curBord = startBord;
250 swdData[curBord].precParc = -1;
251 swdData[curBord].suivParc = -1;
252 int curStartPt=getEdge(curBord).st;
255 int cPt = getEdge(curBord).en;
256 int nb = curBord;
257 //printf("de curBord= %d au point %i -> ",curBord,cPt);
268 if (nb < 0 || nb == curBord)
273 if (nb < 0 || nb == curBord)
277 if (curBord == startBord || curBord < 0)
284 swdData[curBord].suivParc = -1;
285 AddContour (dest, nbP, orig, startBord, curBord,splitWhenForced);
291 curBord = swdData[curBord].precParc;
292 //printf("retour vers %d\n",curBord);
293 if (curBord < 0)
304 if ( getEdge(curBord).en == curStartPt ) {
306 swdData[curBord].suivParc = -1;
307 AddContour (dest, nbP, orig, startBord, curBord,splitWhenForced);
313 swdData[nb].precParc = curBord;
314 swdData[curBord].suivParc = nb;
315 curBord = nb;
316 //printf("suite %d\n",curBord);
319 while (1 /*swdData[curBord].precParc >= 0 */ );
419 int curBord = startBord;
421 swdData[curBord].precParc = -1;
422 swdData[curBord].suivParc = -1;
423 int curStartPt=getEdge(curBord).st;
426 int cPt = getEdge(curBord).en;
427 int nb = curBord;
428 //printf("de curBord= %d au point %i -> ",curBord,cPt);
439 if (nb < 0 || nb == curBord)
444 if (nb < 0 || nb == curBord)
448 if (curBord == startBord || curBord < 0)
456 // int tb=curBord;
473 swdData[curBord].suivParc = -1;
474 AddContour (dest, nbP, orig, startBord, curBord,splitWhenForced);
480 curBord = swdData[curBord].precParc;
481 //printf("retour vers %d\n",curBord);
482 if (curBord < 0)
493 if ( getEdge(curBord).en == curStartPt ) {
497 // int tb=curBord;
514 swdData[curBord].suivParc = -1;
515 AddContour (dest, nbP, orig, startBord, curBord,splitWhenForced);
521 swdData[nb].precParc = curBord;
522 swdData[curBord].suivParc = nb;
523 curBord = nb;
527 //printf("suite %d\n",curBord);
530 while (1 /*swdData[curBord].precParc >= 0 */ );
884 // the contour. the first and last edges of the contour are startBord and curBord
886 Shape::AddContour (Path * dest, int nbP, Path * *orig, int startBord, int curBord, bool splitWhenForced)
926 bord = ReFormeLineTo (bord, curBord, dest, from);
930 bord = ReFormeArcTo (bord, curBord, dest, from);
934 bord = ReFormeCubicTo (bord, curBord, dest, from);
943 bord = ReFormeLineTo (bord, curBord, dest, from);
947 bord = ReFormeBezierTo (bord, curBord, dest, from);
952 bord = ReFormeBezierTo (bord, curBord, dest, from);
993 Shape::ReFormeLineTo (int bord, int /*curBord*/, Path * dest, Path * /*orig*/)
1027 Shape::ReFormeArcTo (int bord, int /*curBord*/, Path * dest, Path * from)
1105 Shape::ReFormeCubicTo (int bord, int /*curBord*/, Path * dest, Path * from)
1151 Shape::ReFormeBezierTo (int bord, int /*curBord*/, Path * dest, Path * from)