Lines Matching refs:cb
169 int cb = getPoint(nPt).incidentEdge[FIRST];
170 while ( cb >= 0 && cb < numberOfEdges() ) {
172 Shape::dg_arete const &e = getEdge(cb);
176 if ( ( d == DOWNWARDS && cb != upNo ) || ( d == UPWARDS && cb != dnNo ) ) {
179 SweepTree *node = swrData[cb].misc;
181 swrData[cb].misc = NULL;
186 cb = NextAt(nPt, cb);
234 int cb = getPoint(nPt).incidentEdge[FIRST];
235 while ( cb >= 0 && cb < numberOfEdges() ) {
236 Shape::dg_arete const &e = getEdge(cb);
238 if ( cb != dnNo && cb != upNo ) {
239 SweepTree *node = sTree->add(this, cb, 1, nPt, this);
240 swrData[cb].misc = node;
243 node->startPoint = Other(nPt, cb);
245 CreateEdge(cb, to, step);
248 cb = NextAt(nPt,cb);
266 int cb = curS->bord;
267 AvanceEdge(cb, to, true, step);
312 int cb = getPoint(nPt).incidentEdge[FIRST];
313 while ( cb >= 0 && cb < numberOfEdges() ) {
314 Shape::dg_arete const &e = getEdge(cb);
318 if ( cb != upNo ) {
319 QuickRasterSubEdge(cb);
322 cb = NextAt(nPt,cb);
338 int cb = getPoint(nPt).incidentEdge[FIRST];
339 while ( cb >= 0 && cb < numberOfEdges() ) {
340 Shape::dg_arete const &e = getEdge(cb);
344 if ( cb != dnNo ) {
345 ins_guess = QuickRasterAddEdge(cb, getPoint(nPt).x[0], ins_guess);
346 CreateEdge(cb, to, step);
349 cb = NextAt(nPt,cb);
365 int cb = qrsData[i].bord;
366 AvanceEdge(cb, to, true, step);
367 qrsData[i].x=swrData[cb].curX;
580 int cb = qrsData[firstQRas].bord;
582 while ( cb >= 0 ) {
583 int bI = qrsData[cb].ind;
592 QuickRasterSwapEdge(cb, ncb);
595 cb = ncb; // en fait inutile; mais bon...
598 cb = pcb;
601 cb = ncb;
699 int cb = curS->bord;
700 AvanceEdge(cb, to, true, step);
786 int cb = qrsData[i].bord;
787 AvanceEdge(cb, to, true, step);
788 qrsData[i].x = swrData[cb].curX;
820 int cb = curS->bord;
822 if ( swrData[cb].sens == false && curS->elem[LEFT] ) {
828 swrData[cb].curX,
829 to - swrData[cb].curY,0.0);
832 swrData[cb].guess = lastGuess;
868 int cb = getPoint(nPt).incidentEdge[FIRST];
869 while ( cb >= 0 && cb < numberOfEdges() ) {
870 Shape::dg_arete const &e = getEdge(cb);
872 if ( cb != upNo ) {
873 SweepTree* node = swrData[cb].misc;
875 _updateIntersection(cb, nPt);
877 DestroyEdge(cb, to, line);
883 cb = NextAt(nPt,cb);
911 int cb = getPoint(nPt).incidentEdge[FIRST];
912 while ( cb >= 0 && cb < numberOfEdges() ) {
913 Shape::dg_arete const &e = getEdge(cb);
915 if ( cb != dnNo ) {
916 SweepTree *node = sTree->add(this, cb, 1, nPt, this);
917 swrData[cb].misc = node;
919 CreateEdge(cb, to, step);
922 cb = NextAt(nPt,cb);
939 int cb = curS->bord;
940 AvanceEdge(cb, to, line, exact, step);
967 int cb = curS->bord;
971 line->AddBord(lastX,swrData[cb].curX,true);
973 lastX = swrData[cb].curX;
982 int cb = curS->bord;
984 if ( swrData[cb].sens ) {
991 line->AddBord(lastX, swrData[cb].curX, true);
993 lastX = swrData[cb].curX;
1002 int cb = curS->bord;
1004 if ( swrData[cb].sens ) {
1011 line->AddBord(lastX,swrData[cb].curX,true);
1013 lastX=swrData[cb].curX;
1025 int cb;
1045 int cb = getPoint(nPt).incidentEdge[FIRST];
1046 while ( cb >= 0 && cb < numberOfEdges() ) {
1047 Shape::dg_arete const &e = getEdge(cb);
1049 if ( cb != upNo ) {
1050 SweepTree* node=swrData[cb].misc;
1052 _updateIntersection(cb, nPt);
1053 DestroyEdge(cb, line);
1058 cb = NextAt(nPt,cb);
1087 cb = getPoint(nPt).incidentEdge[FIRST];
1088 while ( cb >= 0 && cb < numberOfEdges() ) {
1089 Shape::dg_arete const &e = getEdge(cb);
1091 if ( cb != dnNo ) {
1092 SweepTree* node = sTree->add(this, cb, 1, nPt, this);
1093 swrData[cb].misc = node;
1095 CreateEdge(cb, to, step);
1098 cb = NextAt(nPt, cb);
1114 int cb = curS->bord;
1115 AvanceEdge(cb, to, line, exact, step);
1154 int cb = getPoint(nPt).incidentEdge[FIRST];
1155 while ( cb >= 0 && cb < numberOfEdges() ) {
1156 Shape::dg_arete const &e = getEdge(cb);
1158 if ( cb != upNo ) {
1159 SweepTree* node = swrData[cb].misc;
1161 _updateIntersection(cb, nPt);
1162 DestroyEdge(cb, line);
1168 cb = NextAt(nPt,cb);
1196 int cb = getPoint(nPt).incidentEdge[FIRST];
1197 while ( cb >= 0 && cb < numberOfEdges() ) {
1198 Shape::dg_arete const &e = getEdge(cb);
1200 if ( cb != dnNo ) {
1201 SweepTree* node = sTree->add(this, cb, 1, nPt, this);
1202 swrData[cb].misc = node;
1204 CreateEdge(cb, to, step);
1207 cb = NextAt(nPt,cb);
1223 int cb = curS->bord;
1224 AvanceEdge(cb, to, line, exact, step);
1250 int cb = qrsData[i].bord;
1252 if ( swrData[cb].sens ) {
1262 swrData[cb].curX,
1263 to - swrData[cb].curY,
1266 swrData[cb].guess = lastGuess;
1273 // lastX = swrData[cb].curX;
1274 // lastY = swrData[cb].curY;
1275 lastB = cb;
1276 swrData[cb].guess = -1;
1279 swrData[cb].guess = -1;
1306 int cb = getPoint(nPt).incidentEdge[FIRST];
1307 while ( cb >= 0 && cb < numberOfEdges() ) {
1308 Shape::dg_arete const &e = getEdge(cb);
1310 if ( cb != upNo ) {
1311 QuickRasterSubEdge(cb);
1312 _updateIntersection(cb, nPt);
1313 DestroyEdge(cb, to, line);
1316 cb = NextAt(nPt, cb);
1337 int cb = getPoint(nPt).incidentEdge[FIRST];
1338 while ( cb >= 0 && cb < numberOfEdges() ) {
1339 Shape::dg_arete const &e = getEdge(cb);
1341 if ( cb != dnNo ) {
1342 ins_guess = QuickRasterAddEdge(cb, getPoint(nPt).x[0], ins_guess);
1343 CreateEdge(cb, to, step);
1346 cb = NextAt(nPt, cb);
1360 int cb = qrsData[i].bord;
1361 AvanceEdge(cb, to, line, true, step);
1362 qrsData[i].x = swrData[cb].curX;
1388 int cb = qrsData[i].bord;
1392 line->AddBord(lastX, swrData[cb].curX, true);
1394 lastX = swrData[cb].curX;
1401 int cb = qrsData[i].bord;
1403 if ( swrData[cb].sens ) {
1410 line->AddBord(lastX, swrData[cb].curX, true);
1412 lastX = swrData[cb].curX;
1418 int cb = qrsData[i].bord;
1420 if ( swrData[cb].sens ) {
1427 line->AddBord(lastX, swrData[cb].curX, true);
1429 lastX = swrData[cb].curX;
1458 int cb = getPoint(nPt).incidentEdge[FIRST];
1459 while ( cb >= 0 && cb < numberOfEdges() ) {
1460 Shape::dg_arete const &e = getEdge(cb);
1462 if ( cb != upNo ) {
1463 QuickRasterSubEdge(cb);
1464 _updateIntersection(cb, nPt);
1465 DestroyEdge(cb, line);
1468 cb = NextAt(nPt, cb);
1488 int cb = getPoint(nPt).incidentEdge[FIRST];
1489 while ( cb >= 0 && cb < numberOfEdges() ) {
1490 Shape::dg_arete const &e = getEdge(cb);
1492 if ( cb != dnNo ) {
1493 ins_guess = QuickRasterAddEdge(cb, getPoint(nPt).x[0], ins_guess);
1494 CreateEdge(cb, to, step);
1497 cb = NextAt(nPt,cb);
1511 int cb = qrsData[i].bord;
1512 AvanceEdge(cb, to, line, true, step);
1513 qrsData[i].x = swrData[cb].curX;
1552 int cb = getPoint(nPt).incidentEdge[FIRST];
1553 while ( cb >= 0 && cb < numberOfEdges() ) {
1554 Shape::dg_arete const &e = getEdge(cb);
1556 if ( cb != upNo ) {
1557 QuickRasterSubEdge(cb);
1558 _updateIntersection(cb, nPt);
1559 DestroyEdge(cb, line);
1562 cb = NextAt(nPt,cb);
1583 int cb = getPoint(nPt).incidentEdge[FIRST];
1584 while ( cb >= 0 && cb < numberOfEdges() ) {
1585 Shape::dg_arete const &e = getEdge(cb);
1587 if ( cb != dnNo ) {
1588 ins_guess = QuickRasterAddEdge(cb,getPoint(nPt).x[0], ins_guess);
1589 CreateEdge(cb, to, step);
1592 cb = NextAt(nPt,cb);
1606 int cb = qrsData[i].bord;
1607 AvanceEdge(cb, to, line, true, step);
1608 qrsData[i].x = swrData[cb].curX;