Cross Reference: /inkscape/src/2geom/path-intersection.cpp

Lines Matching defs:res
32     Cmp res = cmp(p[0].finalPoint()[Y], y);
44                     res = c;
49     return res < 0;
450         std::vector<Rect> res;
452             res.push_back(Rect(p[i].pointAt(splits[i][j-1]), p[i].pointAt(splits[i][j])));
453         ret.push_back(res);
485             Crossings res;
494                               res, .1);
498             for(unsigned k = 0; k < res.size(); k++) { res[k].a = i; res[k].b = jc; }
500             merge_crossings(results[i], res, i);
501             merge_crossings(results[i], res, jc);
527             Crossings res;
536                               res, .1);
540             for(unsigned k = 0; k < res.size(); k++) { res[k].a = i; res[k].b = j; }
542             merge_crossings(results[i], res, i);
543             merge_crossings(results[j], res, j);
553     Crossings res;
560             pair_intersect(a, spl[i-1], spl[i], a, spl[j-1], spl[j], res);
561     return res;
612         std::vector<Rect> res;
614             res.push_back(Rect(p.pointAt(splits[i][j-1]+i), p.pointAt(splits[i][j]+i)));
615         ret.push_back(res);
626         Crossings res;
629                 mono_curve_intersect(p[i], spl[i][k-1], spl[i][k], p[i], spl[i][l-1], spl[i][l], res);
630         offset_crossings(res, i, i);
631         append(ret, res);
634             res.clear();
640                     mono_curve_intersect(p[i], spl[i][k-1], spl[i][k], p[j], spl[j][l-1], spl[j][l], res);
646                 for(unsigned k = 0; k < res.size(); k++) {
647                     if(res[k].ta != 0 && res[k].ta != 1 && res[k].tb != 0 && res[k].tb != 1) {
648                         res.push_back(res[k]);
651                 res = res2;
653             offset_crossings(res, i, j);
654             append(ret, res);
665         Crossings res = curve_self_crossings(p[i]);
666         offset_crossings(res, i, i);
667         append(ret, res);
670             res.clear();
671             pair_intersect(p[i], 0, 1, p[j], 0, 1, res);
675                 for(unsigned k = 0; k < res.size(); k++) {
676                     if(res[k].ta != 0 && res[k].ta != 1 && res[k].tb != 0 && res[k].tb != 1) {
677                         res2.push_back(res[k]);
680                 res = res2;
682             offset_crossings(res, i, j);
683             append(ret, res);
702         Crossings res = self_crossings(p[i]);
703         for(unsigned k = 0; k < res.size(); k++) { res[k].a = res[k].b = i; }
704         merge_crossings(results[i], res, i);
705         flip_crossings(res);
706         merge_crossings(results[i], res, i);
710             Crossings res = cc.crossings(p[i], p[j]);
711             for(unsigned k = 0; k < res.size(); k++) { res[k].a = i; res[k].b = j; }
712             merge_crossings(results[i], res, i);
713             merge_crossings(results[j], res, j);