Searched refs:times (Results 1 - 10 of 10) sorted by relevance
/inkscape/src/live_effects/ |
H A D | lpe-knot.cpp | 106 std::vector<double> times; local 123 times.insert(times.end(), times_i.begin(), times_i.end() ); 125 std::sort( times.begin(), times.end() ); 126 std::vector<double>::iterator new_end = std::unique( times.begin(), times.end() ); 127 times.resize( new_end - times.begin() ); 131 if (!times 163 std::vector<std::pair<double,double> > times; local [all...] |
H A D | lpe-sketch.cpp | 257 std::vector<double> times; local 258 times = roots(piecelength-s0); 259 t0 = times.at(0);//there should be one and only one solution!! 276 times = roots(piecelength-s1); 277 if (times.empty()) break;//we should not be there. 278 t1 = times[0]; 331 std::vector<double> times; local 332 times = roots(repartition - proba); 333 double t = times.at(0);//there should be one and only one solution! 339 std::vector<double> times; [all...] |
H A D | lpe-rough-hatches.cpp | 93 LevelsCrossings(std::vector<std::vector<double> > const ×, argument 97 for (unsigned i=0; i<times.size(); i++){ 99 for (unsigned j=0; j<times[i].size(); j++){ 101 lc.pt = f.valueAt(times[i][j]); 102 lc.t = times[i][j]; 103 lc.sign = ( dx.valueAt(times[i][j])>0 ); 386 std::vector<std::vector<double> > times; local 387 times = multi_roots(x,levels); 391 for (unsigned i=0; i<times.size(); i++){ 392 if ( times[ [all...] |
H A D | lpe-fillet-chamfer.cpp | 539 std::vector<double> times = fillet_chamfer_values.get_times(counter, path_in, last); local 540 Curve *knotCurve1 = curve_it1->portion(times[0], times[1]); 544 path_out.start((*curve_it1).pointAt(times[0])); 546 Curve *knotCurve2 = curve_it2Fixed->portion(times[2], 1); 548 Point endArcPoint = curve_it2Fixed->pointAt(times[2]); 584 if (times[1] != 1) { 585 if (times[1] != gapHelper && times[1] != times[ [all...] |
/inkscape/src/2geom/ |
H A D | sbasis-math.cpp | 343 * \brief Retruns a Piecewise SBasis with prescribed values at prescribed times. 345 * \param times: vector of times at which the values are given. Should be sorted in increasing order. 346 * \param values: vector of prescribed values. Should have the same size as times and be sorted accordingly. 349 Piecewise<SBasis> interpolate(std::vector<double> times, std::vector<double> values, unsigned smoothness){ argument 350 assert ( values.size() == times.size() ); 361 result.cuts.push_back(times[0]); 363 result.push(bump_out*values[i]+bump_in*values[i+1],times[i+1]);
|
H A D | sbasis-math.h | 85 Piecewise<SBasis> interpolate( std::vector<double> times, std::vector<double> values, unsigned smoothness = 1);
|
/inkscape/src/live_effects/parameter/ |
H A D | filletchamferpointarray.cpp | 453 std::vector<double> times; local 456 times = get_times(index-1, subpaths, false); 461 times = get_times(last_index(index, subpaths), subpaths, true); 464 Geom::Point startArcPoint = A->toSBasis().valueAt(times[1]); 465 Geom::Point endArcPoint = B->toSBasis().valueAt(times[2]); 466 Curve *knotCurve1 = A->portion(times[0], times[1]); 467 Curve *knotCurve2 = B->portion(times[2], 1);
|
/inkscape/share/extensions/test/ |
H A D | inkweb-debug.js | 265 ** $times: how much times this item happens in sequence 272 if (!conf.format) { conf.format = "$F $T - $type - $logmsg - Happens $times." } 273 if (!conf.formatError) { conf.formatError = "$F $T - ERROR - $logmsg - Happens $times.\n$error" } 298 .replace( /\$times/g, (item.happens>1)? item.happens+" times" : "one time" ) 352 '<td>$T</td><td>$logmsg</td><td align="right">$times</td></tr>', 354 '<td>$T</td><td>$logmsg</td><td align="right">$times</td></tr>\n'+
|
/inkscape/src/ |
H A D | selection-chemistry.h | 121 void sp_selection_scale_times (Inkscape::Selection *selection, double times);
|
H A D | selection-chemistry.cpp | 2230 double const times = 1.0 + grow / max_len; local 2231 sp_selection_scale_relative(selection, center, Geom::Scale(times, times)); 2249 sp_selection_scale_times(Inkscape::Selection *selection, gdouble times) argument 2261 sp_selection_scale_relative(selection, center, Geom::Scale(times, times)); 3573 // multiple times, and this is done so that they don't clash)
|
Completed in 919 milliseconds