Lines Matching defs:to

19  * in the file COPYING-LGPL-2.1; if not, write to the Free Software
24 * The contents of this file are subject to the Mozilla Public License
42 \param tail first term to chop
61 \param t position to evaluate
65 There is an elegant way to compute the value and n derivatives for a polynomial using a variant of horner's rule. Someone will someday work out how for sbasis.
81 \returns sbasis equal to a+b
103 \returns sbasis equal to a-b
125 \returns sbasis equal to a+b
144 \returns sbasis equal to a-b
163 \returns sbasis equal to a*b
175 \returns sbasis equal to a*b
251 \returns sbasis equal to a*b+c
278 \returns sbasis equal to a*b
368 It is recommended to use the piecewise version unless you have good reason.
369 TODO: convert int k to unsigned k, and remove cast
396 It is recommended to use the piecewise version unless you have good reason.
411 /** Compute a / b to k terms
415 It is recommended to use the piecewise version unless you have good reason.
454 /** Compute a composed with b to k terms
471 SBasis portion(const SBasis &t, double from, double to) {
473 double tv = t.valueAt(to);
474 SBasis ret = compose(t, Linear(from, to));
486 for i:=0 to k do
495 /** find the function a^-1 such that a^-1 composed with a to k terms is the identity function
534 for(unsigned i = 0; i < (unsigned)k; i++) { // for i:=0 to k do
552 // change from v to u parameterisation
555 // We can truncate this to the number of final terms, as no following terms can
556 // contribute to the result.
573 /** Compute the sine of a to k terms
577 It is recommended to use the piecewise version unless you have good reason.
603 It is recommended to use the piecewise version unless you have good reason.
616 TODO: compute order according to tol?
617 TODO: requires g(0)=0 & g(1)=1 atm... adaptation to other cases should be obvious!
630 if (vs == 0) { // to prevent infinite loop
635 double p10 = Pk.at(k)[0];// we have to solve the linear system: