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
_functionLibrary.cc
Go to the documentation of this file.
1/*
2 * LSST Data Management System
3 * Copyright 2008-2016 AURA/LSST.
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 <https://www.lsstcorp.org/LegalNotices/>.
21 */
22#include <memory>
23
24#include <pybind11/pybind11.h>
25#include <lsst/utils/python.h>
26
27#include <pybind11/stl.h>
28
29#include "lsst/geom/Box.h"
30#include "lsst/geom/Point.h"
31
34
35namespace py = pybind11;
36using namespace pybind11::literals;
37
39
40namespace lsst {
41namespace afw {
42namespace math {
43
44template <typename ReturnT>
45void declarePolynomialFunctions(lsst::utils::python::WrapperCollection &wrappers, const std::string &suffix) {
46 /* PolynomialFunction1 */
47
48 wrappers.wrapType(
50 Function1<ReturnT>>(wrappers.module, ("PolynomialFunction1" + suffix).c_str()),
51 [](auto &mod, auto &cls) {
52 cls.def(py::init<std::vector<double> const &>(), "params"_a);
53 cls.def(py::init<unsigned int>(), "order"_a);
54
55 cls.def("__call__", &PolynomialFunction1<ReturnT>::operator(), "x"_a);
56 cls.def("clone", &PolynomialFunction1<ReturnT>::clone);
57 cls.def("isLinearCombination", &PolynomialFunction1<ReturnT>::isLinearCombination);
58 cls.def("getOrder", &PolynomialFunction1<ReturnT>::getOrder);
59 cls.def("toString", &PolynomialFunction1<ReturnT>::toString, "prefix"_a = "");
60 });
61 /* PolynomialFunction2 */
63 BasePolynomialFunction2<ReturnT>>(wrappers.module,
64 ("PolynomialFunction2" + suffix).c_str()),
65 [](auto &mod, auto &cls) {
66 cls.def(py::init<std::vector<double> const &>(), "params"_a);
67 cls.def(py::init<unsigned int>(), "order"_a);
68
69 cls.def("__call__", &PolynomialFunction2<ReturnT>::operator(), "x"_a, "y"_a);
70 cls.def("clone", &PolynomialFunction2<ReturnT>::clone);
71 cls.def("getOrder", &PolynomialFunction2<ReturnT>::getOrder);
72 cls.def("getDFuncDParameters", &PolynomialFunction2<ReturnT>::getDFuncDParameters);
73 cls.def("toString", &PolynomialFunction2<ReturnT>::toString, "prefix"_a = "");
74 cls.def("isPersistable", &PolynomialFunction2<ReturnT>::isPersistable);
75 });
76};
77
78template <typename ReturnT>
79void declareChebyshevFunctions(lsst::utils::python::WrapperCollection &wrappers, const std::string &suffix) {
80 /* Chebyshev1Function1 */
81
82 wrappers.wrapType(
84 Function1<ReturnT>>(wrappers.module, ("Chebyshev1Function1" + suffix).c_str()),
85 [](auto &mod, auto &cls) {
86 cls.def(py::init<std::vector<double>, double, double>(), "params"_a, "minX"_a = -1,
87 "maxX"_a = 1);
88 cls.def(py::init<unsigned int, double, double>(), "order"_a, "minX"_a = -1, "maxX"_a = 1);
89
90 cls.def("__call__", &Chebyshev1Function1<ReturnT>::operator(), "x"_a);
91 cls.def("clone", &Chebyshev1Function1<ReturnT>::clone);
92 cls.def("getMinX", &Chebyshev1Function1<ReturnT>::getMinX);
93 cls.def("getMaxX", &Chebyshev1Function1<ReturnT>::getMaxX);
94 cls.def("getOrder", &Chebyshev1Function1<ReturnT>::getOrder);
95 cls.def("isLinearCombination", &Chebyshev1Function1<ReturnT>::isLinearCombination);
96 cls.def("toString", &Chebyshev1Function1<ReturnT>::toString, "prefix"_a = "");
97
98 /* Chebyshev1Function2 */
99 });
101 BasePolynomialFunction2<ReturnT>>(wrappers.module,
102 ("Chebyshev1Function2" + suffix).c_str()),
103 [](auto &mod, auto &cls) {
104 cls.def(py::init<std::vector<double>, lsst::geom::Box2D const &>(), "params"_a,
105 "xyRange"_a = lsst::geom::Box2D(lsst::geom::Point2D(-1.0, -1.0),
106 lsst::geom::Point2D(1.0, 1.0)));
107 cls.def(py::init<unsigned int, lsst::geom::Box2D const &>(), "order"_a,
108 "xyRange"_a = lsst::geom::Box2D(lsst::geom::Point2D(-1.0, -1.0),
109 lsst::geom::Point2D(1.0, 1.0)));
110
111 cls.def("__call__", &Chebyshev1Function2<ReturnT>::operator(), "x"_a, "y"_a);
112 cls.def("clone", &Chebyshev1Function2<ReturnT>::clone);
113 cls.def("getXYRange", &Chebyshev1Function2<ReturnT>::getXYRange);
114 cls.def("truncate", &Chebyshev1Function2<ReturnT>::truncate, "order"_a);
115 cls.def("toString", &Chebyshev1Function2<ReturnT>::toString, "prefix"_a = "");
116 cls.def("isPersistable", &Chebyshev1Function2<ReturnT>::isPersistable);
117 });
118};
119
120template <typename ReturnT>
121void declareGaussianFunctions(lsst::utils::python::WrapperCollection &wrappers, const std::string &suffix) {
122 /* GaussianFunction1 */
124 Function1<ReturnT>>(wrappers.module, ("GaussianFunction1" + suffix).c_str()),
125 [](auto &mod, auto &cls) {
126 cls.def(py::init<double>(), "sigma"_a);
127
128 cls.def("__call__", &GaussianFunction1<ReturnT>::operator(), "x"_a);
129 cls.def("clone", &GaussianFunction1<ReturnT>::clone);
130 cls.def("toString", &GaussianFunction1<ReturnT>::toString, "prefix"_a = "");
131 });
132
134 Function2<ReturnT>>(wrappers.module, ("GaussianFunction2" + suffix).c_str()),
135 [](auto &mod, auto &cls) {
136 /* GaussianFunction2 */
137
138 cls.def(py::init<double, double, double>(), "sigma1"_a, "sigma2"_a,
139 "angle"_a = 0.0);
140
141 cls.def("__call__", &GaussianFunction2<ReturnT>::operator(), "x"_a, "y"_a);
142 cls.def("clone", &GaussianFunction2<ReturnT>::clone);
143 cls.def("toString", &GaussianFunction2<ReturnT>::toString, "prefix"_a = "");
144 cls.def("isPersistable", &GaussianFunction2<ReturnT>::isPersistable);
145 });
146 /* DoubleGaussianFunction2 */
147
148 wrappers.wrapType(
150 Function2<ReturnT>>(wrappers.module, ("DoubleGaussianFunction2" + suffix).c_str()),
151 [](auto &mod, auto &cls) {
152 cls.def(py::init<double, double, double>(), "sigma1"_a, "sigma2"_a = 0, "ampl"_a = 0);
153
154 cls.def("__call__", &DoubleGaussianFunction2<ReturnT>::operator(), "x"_a, "y"_a);
155 cls.def("clone", &DoubleGaussianFunction2<ReturnT>::clone);
156 cls.def("toString", &DoubleGaussianFunction2<ReturnT>::toString, "prefix"_a = "");
157 cls.def("isPersistable", &DoubleGaussianFunction2<ReturnT>::isPersistable);
158 });
159};
160
161template <typename ReturnT>
162void declareIntegerDeltaFunctions(lsst::utils::python::WrapperCollection &wrappers,
163 const std::string &suffix) {
164 /* IntegerDeltaFunction1 */
165
166 wrappers.wrapType(
168 Function1<ReturnT>>(wrappers.module, ("IntegerDeltaFunction1" + suffix).c_str()),
169 [](auto &mod, auto &cls) {
170 cls.def(py::init<double>(), "xo"_a);
171
172 cls.def("__call__", &IntegerDeltaFunction1<ReturnT>::operator(), "x"_a);
173 cls.def("clone", &IntegerDeltaFunction1<ReturnT>::clone);
174 cls.def("toString", &IntegerDeltaFunction1<ReturnT>::toString, "prefix"_a = "");
175 });
176 /* IntegerDeltaFunction2 */
177
178 wrappers.wrapType(
180 Function2<ReturnT>>(wrappers.module, ("IntegerDeltaFunction2" + suffix).c_str()),
181 [](auto &mod, auto &cls) {
182 cls.def(py::init<double, double>(), "xo"_a, "yo"_a);
183
184 cls.def("__call__", &IntegerDeltaFunction2<ReturnT>::operator(), "x"_a, "y"_a);
185 cls.def("clone", &IntegerDeltaFunction2<ReturnT>::clone);
186 cls.def("toString", &IntegerDeltaFunction2<ReturnT>::toString, "prefix"_a = "");
187 });
188};
189
190template <typename ReturnT>
191void declareLanczosFunctions(lsst::utils::python::WrapperCollection &wrappers, const std::string &suffix) {
192 /* LanczosFunction1 */
193
195 Function1<ReturnT>>(wrappers.module, ("LanczosFunction1" + suffix).c_str()),
196 [](auto &mod, auto &cls) {
197 cls.def(py::init<unsigned int, double>(), "n"_a, "xOffset"_a = 0.0);
198
199 cls.def("__call__", &LanczosFunction1<ReturnT>::operator(), "x"_a);
200 cls.def("clone", &LanczosFunction1<ReturnT>::clone);
201 cls.def("getOrder", &LanczosFunction1<ReturnT>::getOrder);
202 cls.def("toString", &LanczosFunction1<ReturnT>::toString, "prefix"_a = "");
203 });
204 /* LanczosFunction2 */
205
207 Function2<ReturnT>>(wrappers.module, ("LanczosFunction2" + suffix).c_str()),
208 [](auto &mod, auto &cls) {
209 /* LanczosFunction2 */
210 cls.def(py::init<unsigned int, double, double>(), "n"_a, "xOffset"_a = 0.0,
211 "yOffset"_a = 0.0);
212
213 cls.def("__call__", &LanczosFunction2<ReturnT>::operator(), "x"_a, "y"_a);
214 cls.def("clone", &LanczosFunction2<ReturnT>::clone);
215 cls.def("getOrder", &LanczosFunction2<ReturnT>::getOrder);
216 cls.def("toString", &LanczosFunction2<ReturnT>::toString, "prefix"_a = "");
217 });
218};
219
220void wrapFunctionLibrary(lsst::utils::python::WrapperCollection &wrappers) {
221 wrappers.addInheritanceDependency("lsst.geom");
222 declarePolynomialFunctions<float>(wrappers, "F");
223 declareChebyshevFunctions<float>(wrappers, "F");
224 declareGaussianFunctions<float>(wrappers, "F");
225 declareIntegerDeltaFunctions<float>(wrappers, "F");
226 declareLanczosFunctions<float>(wrappers, "F");
227
228 declarePolynomialFunctions<double>(wrappers, "D");
229 declareChebyshevFunctions<double>(wrappers, "D");
230 declareGaussianFunctions<double>(wrappers, "D");
231 declareIntegerDeltaFunctions<double>(wrappers, "D");
232 declareLanczosFunctions<double>(wrappers, "D");
233}
234
235} // namespace math
236} // namespace afw
237} // namespace lsst
PYBIND11_DECLARE_HOLDER_TYPE(MyType, std::shared_ptr< MyType >)
Base class for 2-dimensional polynomials of the form:
Definition: Function.h:326
1-dimensional weighted sum of Chebyshev polynomials of the first kind.
2-dimensional weighted sum of Chebyshev polynomials of the first kind.
double Guassian (sum of two Gaussians)
A Function taking one argument.
Definition: Function.h:202
A Function taking two arguments.
Definition: Function.h:259
1-dimensional integer delta function.
2-dimensional integer delta function.
1-dimensional Lanczos function
2-dimensional separable Lanczos function
1-dimensional polynomial function.
2-dimensional polynomial function with cross terms
void declareChebyshevFunctions(lsst::utils::python::WrapperCollection &wrappers, const std::string &suffix)
void declarePolynomialFunctions(lsst::utils::python::WrapperCollection &wrappers, const std::string &suffix)
void declareIntegerDeltaFunctions(lsst::utils::python::WrapperCollection &wrappers, const std::string &suffix)
void declareGaussianFunctions(lsst::utils::python::WrapperCollection &wrappers, const std::string &suffix)
void wrapFunctionLibrary(lsst::utils::python::WrapperCollection &wrappers)
void declareLanczosFunctions(lsst::utils::python::WrapperCollection &wrappers, const std::string &suffix)
A base class for image defects.