Searched defs:order (Results 1 - 18 of 18) sorted by relevance

/inkscape/src/2geom/
H A Dbezier-to-sbasis.h44 inline SBasis bezier_to_sbasis(Coord const *handles, unsigned order) {
45 if(order == 0)
47 else if(order == 1)
50 return multiply(Linear(1, 0), bezier_to_sbasis(handles, order-1)) +
51 multiply(Linear(0, 1), bezier_to_sbasis(handles+1, order-1));
56 inline D2<SBasis> handles_to_sbasis(T const &handles, unsigned order)
58 double v[2][order+1];
59 for(unsigned i = 0; i <= order; i++)
62 return D2<SBasis>(bezier_to_sbasis(v[0], order),
63 bezier_to_sbasis(v[1], order));
70 handles_to_sbasis(T const& handles, unsigned order) argument
[all...]
H A Dsbasis-math.cpp34 //TODO: define a truncated compose(sb,sb, order) and extend it to pw<sb>.
35 //TODO: in all these functions, compute 'order' according to 'tol'.
140 int order){
142 if(f.isZero() || order == 0){
146 return sqrt_internal(-f,tol,order);
148 sqrtf.resize(order+1, Linear(0,0));
151 for(unsigned i = 1; int(i) <= order && i<r.size(); i++) {
155 r.truncate(order+1);
170 sqrtf0 = sqrt_internal(compose(f,Linear(0.,.5)),tol,order);
171 sqrtf1 = sqrt_internal(compose(f,Linear(.5,1.)),tol,order);
138 sqrt_internal(SBasis const &f, double tol, int order) argument
181 sqrt(SBasis const &f, double tol, int order) argument
188 sqrt(Piecewise<SBasis> const &f, double tol, int order) argument
209 sin( SBasis const &f, double tol, int order) argument
215 sin(Piecewise<SBasis> const &f, double tol, int order) argument
222 cos(Piecewise<SBasis> const &f, double tol, int order) argument
237 cos( SBasis const &f, double tol, int order) argument
274 truncateResult(Piecewise<SBasis> &f, int order) argument
329 reciprocal(SBasis const &f, double tol, int order) argument
335 reciprocal(Piecewise<SBasis> const &f, double tol, int order) argument
[all...]
H A Dbezier-curve.h59 /** @brief Get the order of the Bezier curve.
60 * A Bezier curve has order() + 1 control points. */
61 unsigned order() const { return inner[X].order(); } function in class:Geom::BezierCurve
63 unsigned size() const { return inner[X].order() + 1; }
65 * @param ix The (zero-based) index of the control point. Note that the caller is responsible for checking that this value is <= order().
70 * @return Vector with order() + 1 control points. */
75 * @param ix The zero-based index of the point to modify. Note that the caller is responsible for checking that this value is <= order().
82 * @param ps Vector which must contain order() + 1 points.
84 * @throws LogicalError Thrown when the size of the vector does not match the order
[all...]
H A Dbezier.h77 * @param order Order of the input polynomial, equal to one less the number of coefficients
80 inline T casteljau_subdivision(double t, T const *v, T *left, T *right, unsigned order) { argument
83 T val = bernstein_value_at(t, v, order);
91 std::copy(v, v + order + 1, left);
93 for (std::size_t i = order; i > 0; --i) {
94 for (std::size_t j = i; j <= order; ++j) {
98 left[order] = val;
99 return left[order];
103 std::copy(v, v + order + 1, right);
105 for (std::size_t i = 1; i <= order;
147 unsigned order() const { return c_.size()-1;} function in class:Geom::Bezier
162 unsigned order; member in struct:Geom::Bezier::Order
[all...]
H A Dd2.h524 //bounds specializations with order
525 inline OptRect bounds_fast(D2<SBasis> const & s, unsigned order=0) { argument
527 OptInterval xint = bounds_fast(s[X], order);
529 OptInterval yint = bounds_fast(s[Y], order);
536 inline OptRect bounds_local(D2<SBasis> const & s, OptInterval i, unsigned order=0) { argument
538 OptInterval xint = bounds_local(s[X], i, order);
539 OptInterval yint = bounds_local(s[Y], i, order);
H A Dsbasis-roots.cpp56 are in [0,1] for polys of order 5. I spent some time working out whether eigenvalue root finding
121 OptInterval bounds_fast(const SBasisOf<double> &sb, int order) { argument
123 OptInterval bounds_fast(const SBasis &sb, int order) {
127 for(int j = sb.size()-1; j>=order; j--) {
148 if (order>0) res*=std::pow(.25,order);
152 /** Find a small interval that bounds a(t) for t in i to order order
155 \param order number of terms
160 OptInterval bounds_local(const SBasisOf<double> &sb, const OptInterval &i, int order) { argument
[all...]
H A Dsbasis.cpp616 TODO: compute order according to tol?
619 SBasis compose_inverse(SBasis const &f, SBasis const &g, unsigned order, double zero){ argument
620 SBasis result(order, Linear(0.)); //result
623 Pk.truncate(order);
624 Qk.truncate(order);
625 Pk.resize(order,Linear(0.));
626 Qk.resize(order,Linear(0.));
627 r.resize(order,Linear(0.));
634 for (unsigned k=0; k<order; k+=vs){
657 Pk.resize(order,Linea
[all...]
H A Dsbasis-geometric.cpp153 \param order the maximum degree to use for approximation
157 Geom::atan2(Piecewise<D2<SBasis> > const &vect, double tol, unsigned order){ argument
166 angle = divide (x*derivative(y)-y*derivative(x), x*x+y*y, tol, order);
184 \param order the maximum degree to use for approximation
188 Geom::atan2(D2<SBasis> const &vect, double tol, unsigned order){ argument
189 return atan2(Piecewise<D2<SBasis> >(vect),tol,order);
195 \param order the maximum degree to use for approximation
199 Geom::tan2(SBasis const &angle, double tol, unsigned order){ argument
200 return tan2(Piecewise<SBasis>(angle), tol, order);
206 \param order th
210 tan2(Piecewise<SBasis> const &angle, double tol, unsigned order) argument
225 unitVector(D2<SBasis> const &V_in, double tol, unsigned order) argument
305 unitVector(Piecewise<D2<SBasis> > const &V, double tol, unsigned order) argument
402 arc_length_parametrization(D2<SBasis> const &M, unsigned order, double tol) argument
434 arc_length_parametrization(Piecewise<D2<SBasis> > const &M, unsigned order, double tol) argument
[all...]
/inkscape/src/filters/
H A Dconvolvematrix.h29 NumberOptNumber order; member in class:SPFeConvolveMatrix
/inkscape/src/libvpsc/
H A Dblocks.cpp47 list<Variable*> *order = new list<Variable*>; local
53 dfsVisit(vs[i],order);
56 return order;
58 // Recursive depth first search giving total order by pushing nodes in the DAG
60 void Blocks::dfsVisit(Variable *v, list<Variable*> *order) { argument
66 dfsVisit(c->right, order);
71 f<<" order="<<*v<<endl;
73 order->push_front(v);
/inkscape/src/libavoid/
H A Dvpsc.cpp420 // Because the constraint list is not order dependent we just
465 list<Variable*> *order = new list<Variable*>; local
471 dfsVisit(vs[i],order);
474 return order;
476 // Recursive depth first search giving total order by pushing nodes in the DAG
478 void Blocks::dfsVisit(Variable *v, list<Variable*> *order) { argument
484 dfsVisit(c->right, order);
489 f<<" order="<<*v<<endl;
491 order->push_front(v);
914 // in order t
[all...]
H A Dorthogonal.cpp127 int order(void) const function in class:Avoid::ShiftSegment
1989 PtOrder& order = it->second; local
1993 order.sort(dim);
2030 // If one of these is fixed, then determine order based on
2031 // fixed segment, that is, order so the fixed segment doesn't
2041 // C-bends that did not have a clear order with s-bends might
2042 // not have a good ordering here, so compare their order in
2045 const int lhsOrder = lhs.order();
2046 const int rhsOrder = rhs.order();
2063 // overlap (they are just collinear. The relative order fo
[all...]
/inkscape/src/helper/
H A Dgeom.cpp170 unsigned order = 0; local
172 order = b->order();
175 if (order == 1) { // line segment
181 } else if (order == 3) { // cubic bezier
354 unsigned order = 0; local
356 order = b->order();
358 if (order == 1) {
374 else if (order
[all...]
H A Dgeom-pathstroke.cpp844 size_t order = b->order(); local
845 switch (order) {
/inkscape/src/util/
H A Dziptool.cpp395 * put symbols in table sorted by length, by symbol order within each
653 static const int order[19] = // permutation of code length codes local
679 lengths[order[index]] = ret;
682 lengths[order[index]] = 0;
/inkscape/src/
H A Ddesktop.cpp156 // Temporary workaround for link order issues:
232 // The order in which these canvas items are added determines the z-order. It's therefore
235 // disappeared) reselect a node after snapping it. If the z-order is wrong however, this
1746 // place in the z-order stack
1750 int order = sp_canvas_item_order (desktop->page_border); local
1752 if (morder > order) sp_canvas_item_raise (desktop->page_border,
1753 morder - order);
/inkscape/src/display/
H A Dcairo-utils.cpp507 unsigned order = 0; local
509 order = b->order();
513 switch (order) {
/inkscape/src/extension/internal/
H A Dcairo-render-context.cpp1164 //as drawing whole strips in left-to-right order.
1460 CairoRenderContext::renderPathVector(Geom::PathVector const & pathv, SPStyle const *style, Geom::OptRect const &pbox, CairoPaintOrder order) argument
1483 order == STROKE_ONLY;
1485 style->stroke_opacity.value == 0 || order == FILL_ONLY;
1508 if (!no_fill && (order == STROKE_OVER_FILL || order == FILL_ONLY)) {
1520 if (no_fill || order == STROKE_OVER_FILL)
1526 if (!no_fill && order == FILL_OVER_STROKE) {

Completed in 243 milliseconds