LSST Applications g0b6bd0c080+a72a5dd7e6,g1182afd7b4+2a019aa3bb,g17e5ecfddb+2b8207f7de,g1d67935e3f+06cf436103,g38293774b4+ac198e9f13,g396055baef+6a2097e274,g3b44f30a73+6611e0205b,g480783c3b1+98f8679e14,g48ccf36440+89c08d0516,g4b93dc025c+98f8679e14,g5c4744a4d9+a302e8c7f0,g613e996a0d+e1c447f2e0,g6c8d09e9e7+25247a063c,g7271f0639c+98f8679e14,g7a9cd813b8+124095ede6,g9d27549199+a302e8c7f0,ga1cf026fa3+ac198e9f13,ga32aa97882+7403ac30ac,ga786bb30fb+7a139211af,gaa63f70f4e+9994eb9896,gabf319e997+ade567573c,gba47b54d5d+94dc90c3ea,gbec6a3398f+06cf436103,gc6308e37c7+07dd123edb,gc655b1545f+ade567573c,gcc9029db3c+ab229f5caf,gd01420fc67+06cf436103,gd877ba84e5+06cf436103,gdb4cecd868+6f279b5b48,ge2d134c3d5+cc4dbb2e3f,ge448b5faa6+86d1ceac1d,gecc7e12556+98f8679e14,gf3ee170dca+25247a063c,gf4ac96e456+ade567573c,gf9f5ea5b4d+ac198e9f13,gff490e6085+8c2580be5c,w.2022.27
LSST Data Management Base Package
Function.cc
Go to the documentation of this file.
1/*
2 * LSST Data Management System
3 * Copyright 2008, 2009, 2010 LSST Corporation.
4 *
5 * This product includes software developed by the
6 * LSST Project (http://www.lsst.org/).
7 *
8 * This program is free software: you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version.
12 *
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
17 *
18 * You should have received a copy of the LSST License Statement and
19 * the GNU General Public License along with this program. If not,
20 * see <http://www.lsstcorp.org/LegalNotices/>.
21 */
22
23/*
24 * Support routines for
25 */
28
29namespace lsst {
30namespace afw {
31namespace math {
32
33template <typename ReturnT>
35 std::vector<double> coeffs(this->getNParameters());
36
37 //
38 // Go through params order by order, evaluating x^r y^s; we do this by first evaluating
39 // y^s for a complete order, then going through again multiplying by x^r
40 //
41 int i0 = 0; // starting index for this order's coefficients
42 for (int order = 0; order <= this->_order; ++order) {
43 coeffs[i0] = 1;
44 double zn = y; // y^s
45 for (int i = 1; i <= order; ++i) {
46 coeffs[i0 + i] = zn;
47 zn *= y;
48 }
49
50 zn = x; // x^r
51 for (int i = order - 1; i >= 0; --i) {
52 coeffs[i0 + i] *= zn;
53 zn *= x;
54 }
55
56 i0 += order + 1;
57 }
58
59 assert(i0 == static_cast<int>(coeffs.size()));
60
61 return coeffs;
62}
63
64} // namespace math
65
67#define INSTANTIATE(TYPE) \
68 template std::shared_ptr<math::Function<TYPE>> \
69 table::io::PersistableFacade<math::Function<TYPE>>::dynamicCast( \
70 std::shared_ptr<table::io::Persistable> const&); \
71 template std::shared_ptr<math::Function1<TYPE>> \
72 table::io::PersistableFacade<math::Function1<TYPE>>::dynamicCast( \
73 std::shared_ptr<table::io::Persistable> const&); \
74 template std::shared_ptr<math::Function2<TYPE>> \
75 table::io::PersistableFacade<math::Function2<TYPE>>::dynamicCast( \
76 std::shared_ptr<table::io::Persistable> const&); \
77 template std::vector<double> math::PolynomialFunction2<TYPE>::getDFuncDParameters(double x, double y) \
78 const
79
80INSTANTIATE(double);
81INSTANTIATE(float);
83} // namespace afw
84} // namespace lsst
double x
#define INSTANTIATE(FROMSYS, TOSYS)
Definition: Detector.cc:484
int y
Definition: SpanSet.cc:48
std::vector< double > getDFuncDParameters(double x, double y) const override
Return the coefficients of the Function's parameters, evaluated at (x, y) I.e.
Definition: Function.cc:34
A base class for image defects.
T size(T... args)
table::Key< int > order