Lines Matching defs:rgtN
2732 int rgtN = lS->swsData[lB].rightRnd;
2735 if (rgtN > chRiN)
2736 chRiN = rgtN;
2737 // for (int n=lftN;n<=rgtN;n++) CreateIncidence(lS,lB,n);
2745 for (int n = rgtN + 1; n < lastPointNo; n++)
2758 int rgtN = rS->swsData[rB].rightRnd;
2761 if (rgtN > chRiN)
2762 chRiN = rgtN;
2763 // for (int n=lftN;n<=rgtN;n++) CreateIncidence(rS,rB,n);
2771 for (int n = rgtN + 1; n < lastPointNo; n++)
3122 int rgtN = lS->swsData[lB].rightRnd;
3133 for (int p = lftN; p <= rgtN; p++)
3141 for (int p = lftN; p <= rgtN; p++)
3153 for (int p = lftN; p <= rgtN; p++)
3178 for (int p = rgtN; p >= lftN; p--)
3180 if (avoidDiag && p == rgtN && getPoint(rgtN).x[0] == getPoint(lp).x[0] - dd)
3182 if (rgtN < numberOfPoints() && rgtN + 1 < lastPointNo
3183 && getPoint(rgtN + 1).x[0] == getPoint(lp).x[0])
3185 DoEdgeTo (lS, lB, rgtN + 1, direct, true);
3186 DoEdgeTo (lS, lB, rgtN, direct, true);
3190 DoEdgeTo (lS, lB, rgtN, direct, true);
3206 for (int p = rgtN; p >= lftN; p--)
3208 if (avoidDiag && p == rgtN && getPoint(rgtN).x[0] == getPoint(lp).x[0] - dd)
3210 if (rgtN < numberOfPoints() && rgtN + 1 < lastPointNo
3211 && getPoint(rgtN + 1).x[0] == getPoint(lp).x[0])
3213 DoEdgeTo (lS, lB, rgtN + 1, direct, false);
3214 DoEdgeTo (lS, lB, rgtN, direct, false);
3218 DoEdgeTo (lS, lB, rgtN, direct, false);
3231 for (int p = lftN; p <= rgtN; p++)