| /inkscape/src/ui/tools/ |
| H A D | spiral-tool.h | 50 gdouble t0; member in class:Inkscape::UI::Tools::SpiralTool
|
| /inkscape/src/ |
| H A D | sp-spiral.h | 37 * where spiral curve is drawn for {t | t0 <= t <= 1}. The rad and arg
52 float t0; member in class:SPSpiral
55 void setPosition(double cx, double cy, double exp, double revo, double rad, double arg, double t0);
|
| H A D | sp-spiral.cpp | 39 , t0(0)
55 this->readAttr("sodipodi:t0");
65 * sodipodi:spiral="cx cy exp revo rad arg t0"
74 sp_repr_set_svg_double(repr, "sodipodi:t0", this->t0);
171 this->t0 = g_ascii_strtod (value, NULL);
172 this->t0 = CLAMP (this->t0, 0.0, 0.999);
181 this->t0 = 0.0;
291 if (*t == spiral->t0 || *
390 setPosition(gdouble cx, gdouble cy, gdouble exp, gdouble revo, gdouble rad, gdouble arg, gdouble t0) argument
[all...] |
| /inkscape/src/live_effects/ |
| H A D | lpe-tangent_to_curve.cpp | 138 double t0 = nearest_time(s, pwd2); local
139 lpe->t_attach.param_set_value(t0);
|
| H A D | lpe-sketch.cpp | 243 //- Choose a rdm seg [s0,s1], find corresponding [t0,t1],
244 //- Pick a rdm perturbation delta(s), collect 'piece(t)+delta(s(t))' over [t0,t1] into output.
248 double t1, t0; local
259 t0 = times.at(0);//there should be one and only one solution!!
282 pwperturb = compose(pwperturb,portion(piecelength,t0,t1));
284 output.concat(portion(piece,t0,t1)+pwperturb);
|
| H A D | lpe-taperstroke.cpp | 484 double t0 = nearest_time(s, pwd2); local
485 lpe->attach_start.param_set_value(t0);
512 double t0 = nearest_time(s, pwd2); local
513 lpe->attach_end.param_set_value(t0);
|
| /inkscape/src/widgets/ |
| H A D | spiral-toolbar.cpp | 116 sp_spl_tb_value_changed(adj, tbl, "t0");
128 gdouble t0 = 0.0; local
138 adj = GTK_ADJUSTMENT(g_object_get_data(obj, "t0"));
139 gtk_adjustment_set_value(adj, t0);
174 adj = GTK_ADJUSTMENT(g_object_get_data(G_OBJECT(tbl), "t0"));
175 double t0 = 0.0; local
176 sp_repr_get_double(repr, "sodipodi:t0", &t0);
177 gtk_adjustment_set_value(adj, t0);
274 "/tools/shapes/spiral/t0", 0.
[all...] |
| /inkscape/src/2geom/ |
| H A D | bezier-curve.cpp | 489 t0 = 0.5*(a1 + a2), local
491 b2 = 0.5*(b1 + t0),
492 c2 = 0.5*(t0 + c1),
|
| H A D | piecewise.cpp | 134 double t0=(*cut).first; local
138 assert(t0<t1);
140 if (std::max(idx0,idx1)==levels.size()){ //g([t0,t1]) is above the top level,
142 } else if (idx0 != idx1){ //g([t0,t1]) crosses from level idx0 to idx1,
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,
148 } else { //g([t0,t1]) is contained in level idx0!...
|
| H A D | recursive-bezier-intersection.cpp | 218 void recursively_intersect( OldBezier a, double t0, double t1, int deptha, argument
228 double tmid = (t0+t1)*0.5;
237 recursively_intersect( A[0], t0, tmid, deptha,
245 recursively_intersect( A[0], t0, tmid, deptha,
256 recursively_intersect( A[0], t0, tmid, deptha,
273 recursively_intersect( a, t0, t1, deptha,
277 recursively_intersect( a, t0, t1, deptha,
299 parameters.push_back(std::pair<double, double>(t0 + s * ( t1 - t0 ),
|
| H A D | sbasis-roots.cpp | 164 double t0=i->min(), t1=i->max(), lo=0., hi=0.; local
171 if (lo>=0 || t<t0 || t>t1) {
172 lo = std::min(a*(1-t0)+b*t0+lo*t0*(1-t0),a*(1-t1)+b*t1+lo*t1*(1-t1));
178 if (hi<=0 || t<t0 || t>t1) {
179 hi = std::max(a*(1-t0)+b*t0+hi*t0*(
297 double t0,t1; local
497 double t0=std::min(ta_hi,ta_lo); local
[all...] |
| H A D | sbasis-geometric.cpp | 410 double t0=s.cuts[i],t1=s.cuts[i+1]; local
411 if ( are_near(s(t0),s(t1)) ) {
414 D2<SBasis> sub_M = compose(M,Linear(t0,t1));
|