LSSTApplications
18.0.0+106,18.0.0+50,19.0.0,19.0.0+1,19.0.0+10,19.0.0+11,19.0.0+13,19.0.0+17,19.0.0+2,19.0.0-1-g20d9b18+6,19.0.0-1-g425ff20,19.0.0-1-g5549ca4,19.0.0-1-g580fafe+6,19.0.0-1-g6fe20d0+1,19.0.0-1-g7011481+9,19.0.0-1-g8c57eb9+6,19.0.0-1-gb5175dc+11,19.0.0-1-gdc0e4a7+9,19.0.0-1-ge272bc4+6,19.0.0-1-ge3aa853,19.0.0-10-g448f008b,19.0.0-12-g6990b2c,19.0.0-2-g0d9f9cd+11,19.0.0-2-g3d9e4fb2+11,19.0.0-2-g5037de4,19.0.0-2-gb96a1c4+3,19.0.0-2-gd955cfd+15,19.0.0-3-g2d13df8,19.0.0-3-g6f3c7dc,19.0.0-4-g725f80e+11,19.0.0-4-ga671dab3b+1,19.0.0-4-gad373c5+3,19.0.0-5-ga2acb9c+2,19.0.0-5-gfe96e6c+2,w.2020.01
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.