Searched refs:levels (Results 1 - 7 of 7) sorted by relevance

/inkscape/src/2geom/
H A Dsbasis-roots.cpp193 let c and C be the levels below and above f(a):
205 static int upper_level(vector<double> const &levels,double x,double tol=0.){ argument
206 return(upper_bound(levels.begin(),levels.end(),x-tol)-levels.begin());
216 std::vector<double> const &levels,
227 idx=upper_level(levels,0,vtol);
228 if (idx<(int)levels.size()&&fabs(levels.at(idx))<=vtol){
236 // int idxa=upper_level(levels,f
210 multi_roots_internal(SBasis const &f, SBasis const &df, std::vector<double> const &levels, std::vector<std::vector<double> > &roots, double htol, double vtol, double a, double fa, double b, double fb) argument
346 multi_roots(SBasis const &f, std::vector<double> const &levels, double htol, double vtol, double a, double b) argument
370 upper_level(vector<Interval> const &levels, double x ) argument
407 level_sets_internal(SBasis const &f, SBasis const &df, std::vector<Interval> const &levels, std::vector<std::vector<Interval> > &solsets, double a, double fa, double b, double fb, double tol=1e-5) argument
530 level_sets(SBasis const &f, std::vector<Interval> const &levels, double a, double b, double tol) argument
555 level_sets(SBasis const &f, std::vector<double> const &levels, double vtol, double a, double b, double tol) argument
[all...]
H A Dpiecewise.cpp132 std::vector<double> const &levels,
140 if (std::max(idx0,idx1)==levels.size()){ //g([t0,t1]) is above the top level,
141 idx=levels.size()-1;
144 } else if(g((t0+t1)/2) < levels[idx0]) { //g([t0,t1]) is a 'U' under level idx0,
146 } else if(g((t0+t1)/2) > levels[idx0]) { //g([t0,t1]) is a 'bump' over level idx0,
149 idx = (idx0==levels.size())? idx0-1:idx0;
152 //move idx back from levels f.cuts
130 compose_findSegIdx(std::map<double,unsigned>::iterator const &cut, std::map<double,unsigned>::iterator const &next, std::vector<double> const &levels, SBasis const &g) argument
H A Dsbasis.h449 std::vector<double> const &levels,
490 \param levels vector of values, that should be sorted.
497 std::vector<double> const &levels,
505 \param levels vector of 'y' intervals, that should be disjoints and sorted.
511 std::vector<Interval> const &levels,
H A Dpiecewise.h756 std::vector<double> const &levels,
783 std::vector<double> levels;//we can forget first and last cuts...
784 levels.insert(levels.begin(),f.cuts.begin()+1,f.cuts.end()-1);
786 std::map<double,unsigned> cuts_pb = compose_pullback(levels,g);
795 // the levels/variations of f might be too close/fast...
796 int idx = compose_findSegIdx(cut,next,levels,g);
899 //std::vector<Interval> level_sets(Piecewise<SBasis> const &f, std::vector<Interval> const &levels, double tol=1e-5);
/inkscape/src/extension/internal/filter/
H A Dpaint.h501 "<param name=\"levels\" gui-text=\"" N_("Levels") "\" type=\"int\" appearance=\"full\" min=\"0\" max=\"10\">3</param>\n"
530 int levels = ext->get_param_int("levels") + 1; local
535 for ( int step = 1 ; step <= levels ; step++ ) {
860 "<param name=\"levels\" gui-text=\"" N_("Levels") "\" type=\"int\" appearance=\"full\" min=\"0\" max=\"15\">5</param>\n"
909 int levels = ext->get_param_int("levels") + 1; local
911 if (levels == 1) {
918 for ( int step = 1 ; step <= levels ; step++ ) {
919 float val = (float) step / levels;
1001 int levels = ext->get_param_int("levels") + 1; local
[all...]
/inkscape/src/helper/
H A Dgeom-pathstroke.cpp753 void offset_cubic(Geom::Path& p, Geom::CubicBezier const& bez, double width, double tol, size_t levels) argument
794 if (levels == 0) {
817 offset_cubic(p, s.first, width, tol, levels - 1);
818 offset_cubic(p, s.second, width, tol, levels - 1);
822 void offset_quadratic(Geom::Path& p, Geom::QuadraticBezier const& bez, double width, double tol, size_t levels) argument
831 offset_cubic(p, cub, width, tol, levels);
837 size_t levels = 8; local
851 offset_quadratic(res, q, width, tolerance, levels);
856 offset_cubic(res, cb, width, tolerance, levels);
/inkscape/src/live_effects/
H A Dlpe-rough-hatches.cpp41 // Some goodies to navigate through curve's levels.
349 // Generate the levels with random, growth...
385 std::vector<double> levels = generateLevels(*range, org[X]);
387 times = multi_roots(x,levels);
390 std::vector<std::vector<double> > cleaned_times(levels.size(),std::vector<double>());

Completed in 61 milliseconds