Lines Matching defs:nb
115 int nb = curBord;
120 int nnb = CycleNextAt (cPt, nb);
121 if (nnb == nb)
124 nb = -1;
127 nb = nnb;
128 if (nb < 0 || nb == curBord)
131 while (swdData[nb].misc != 0 || getEdge(nb).st != cPt);
133 if (nb < 0 || nb == curBord)
154 swdData[nb].misc = (void *) 1;
155 swdData[nb].ind = searchInd++;
156 swdData[nb].precParc = curBord;
157 swdData[curBord].suivParc = nb;
158 curBord = nb;
162 dest->LineTo (getPoint(getEdge(nb).en).x);
256 int nb = curBord;
260 int nnb = CycleNextAt (cPt, nb);
261 if (nnb == nb)
264 nb = -1;
267 nb = nnb;
268 if (nb < 0 || nb == curBord)
271 while (swdData[nb].misc != 0 || getEdge(nb).st != cPt);
273 if (nb < 0 || nb == curBord)
301 startBord = nb;
302 curStartPt=getEdge(nb).st;
308 startBord=nb;
311 swdData[nb].misc = (void *) 1;
312 swdData[nb].ind = searchInd++;
313 swdData[nb].precParc = curBord;
314 swdData[curBord].suivParc = nb;
315 curBord = nb;
427 int nb = curBord;
431 int nnb = CycleNextAt (cPt, nb);
432 if (nnb == nb)
435 nb = -1;
438 nb = nnb;
439 if (nb < 0 || nb == curBord)
442 while (swdData[nb].misc != 0 || getEdge(nb).st != cPt);
444 if (nb < 0 || nb == curBord)
490 startBord = nb;
491 curStartPt=getEdge(nb).st;
516 startBord=nb;
519 swdData[nb].misc = (void *)(intptr_t)(1 + nbNest);
520 swdData[nb].ind = searchInd++;
521 swdData[nb].precParc = curBord;
522 swdData[curBord].suivParc = nb;
523 curBord = nb;
524 if (nb == childEdge) {
941 if (nBData->nb == 0)
1167 nbInterm = nBData->nb;
1179 nbInterm = nBData->nb;