Lines Matching defs:spl
416 std::vector<double> spl = offset_doubles(curve_mono_splits(p[i]), i);
417 bool dx = p[i].initialPoint()[X] > (spl.empty()? p[i].finalPoint()[X] :
418 p.valueAt(spl.front(), X));
419 bool dy = p[i].initialPoint()[Y] > (spl.empty()? p[i].finalPoint()[Y] :
420 p.valueAt(spl.front(), Y));
426 append(ret, spl);
554 std::vector<double> spl;
555 spl.push_back(0);
556 append(spl, curve_mono_splits(a));
557 spl.push_back(1);
558 for(unsigned i = 1; i < spl.size(); i++)
559 for(unsigned j = i+1; j < spl.size(); j++)
560 pair_intersect(a, spl[i-1], spl[i], a, spl[j-1], spl[j], res);
601 std::vector<double> spl;
602 spl.push_back(0);
603 append(spl, curve_mono_splits(p[i]));
604 spl.push_back(1);
605 ret.push_back(spl);
623 std::vector<std::vector<double> > spl = curves_mono_splits(p);
624 std::vector<std::vector<Rect> > bnds = curves_split_bounds(p, spl);
627 for(unsigned k = 1; k < spl[i].size(); k++)
628 for(unsigned l = k+1; l < spl[i].size(); l++)
629 mono_curve_intersect(p[i], spl[i][k-1], spl[i][k], p[i], spl[i][l-1], spl[i][l], res);
640 mono_curve_intersect(p[i], spl[i][k-1], spl[i][k], p[j], spl[j][l-1], spl[j][l], res);