LSSTApplications
17.0+11,17.0+34,17.0+56,17.0+57,17.0+59,17.0+7,17.0-1-g377950a+33,17.0.1-1-g114240f+2,17.0.1-1-g4d4fbc4+28,17.0.1-1-g55520dc+49,17.0.1-1-g5f4ed7e+52,17.0.1-1-g6dd7d69+17,17.0.1-1-g8de6c91+11,17.0.1-1-gb9095d2+7,17.0.1-1-ge9fec5e+5,17.0.1-1-gf4e0155+55,17.0.1-1-gfc65f5f+50,17.0.1-1-gfc6fb1f+20,17.0.1-10-g87f9f3f+1,17.0.1-11-ge9de802+16,17.0.1-16-ga14f7d5c+4,17.0.1-17-gc79d625+1,17.0.1-17-gdae4c4a+8,17.0.1-2-g26618f5+29,17.0.1-2-g54f2ebc+9,17.0.1-2-gf403422+1,17.0.1-20-g2ca2f74+6,17.0.1-23-gf3eadeb7+1,17.0.1-3-g7e86b59+39,17.0.1-3-gb5ca14a,17.0.1-3-gd08d533+40,17.0.1-30-g596af8797,17.0.1-4-g59d126d+4,17.0.1-4-gc69c472+5,17.0.1-6-g5afd9b9+4,17.0.1-7-g35889ee+1,17.0.1-7-gc7c8782+18,17.0.1-9-gc4bbfb2+3,w.2019.22
LSSTDataManagementBasePackage
|
Classes | |
class | BinomialMatrix |
A class that computes binomial coefficients up to a certain power. More... | |
Functions | |
int | computePackedOffset (int order) |
Compute the index of the first coefficient with the given order in a packed 2-d polynomial coefficient array. More... | |
int | computePackedSize (int order) |
Compute this size of a packed 2-d polynomial coefficient array. More... | |
void | computePowers (Eigen::VectorXd &r, double x) |
Fill an array with integer powers of x, so \($r[n] == r^n\). More... | |
Eigen::VectorXd | computePowers (double x, int n) |
Return an array with integer powers of x, so \($r[n] == r^n\). More... | |
|
inline |
Compute the index of the first coefficient with the given order in a packed 2-d polynomial coefficient array.
This defines the ordering as
(or the same with indices swapped).
Definition at line 45 of file polynomialUtils.h.
|
inline |
Compute this size of a packed 2-d polynomial coefficient array.
Definition at line 50 of file polynomialUtils.h.
void lsst::meas::astrom::detail::computePowers | ( | Eigen::VectorXd & | r, |
double | x | ||
) |
Fill an array with integer powers of x, so \($r[n] == r^n\).
When multiple powers are needed, this should be signficantly faster than repeated calls to std::pow().
Definition at line 33 of file polynomialUtils.cc.
Eigen::VectorXd lsst::meas::astrom::detail::computePowers | ( | double | x, |
int | n | ||
) |
Return an array with integer powers of x, so \($r[n] == r^n\).
When multiple powers are needed, this should be signficantly faster than repeated calls to std::pow().
Definition at line 40 of file polynomialUtils.cc.