LSST Applications g0f08755f38+82efc23009,g12f32b3c4e+e7bdf1200e,g1653933729+a8ce1bb630,g1a0ca8cf93+50eff2b06f,g28da252d5a+52db39f6a5,g2bbee38e9b+37c5a29d61,g2bc492864f+37c5a29d61,g2cdde0e794+c05ff076ad,g3156d2b45e+41e33cbcdc,g347aa1857d+37c5a29d61,g35bb328faa+a8ce1bb630,g3a166c0a6a+37c5a29d61,g3e281a1b8c+fb992f5633,g414038480c+7f03dfc1b0,g41af890bb2+11b950c980,g5fbc88fb19+17cd334064,g6b1c1869cb+12dd639c9a,g781aacb6e4+a8ce1bb630,g80478fca09+72e9651da0,g82479be7b0+04c31367b4,g858d7b2824+82efc23009,g9125e01d80+a8ce1bb630,g9726552aa6+8047e3811d,ga5288a1d22+e532dc0a0b,gae0086650b+a8ce1bb630,gb58c049af0+d64f4d3760,gc28159a63d+37c5a29d61,gcf0d15dbbd+2acd6d4d48,gd7358e8bfb+778a810b6e,gda3e153d99+82efc23009,gda6a2b7d83+2acd6d4d48,gdaeeff99f8+1711a396fd,ge2409df99d+6b12de1076,ge79ae78c31+37c5a29d61,gf0baf85859+d0a5978c5a,gf3967379c6+4954f8c433,gfb92a5be7c+82efc23009,gfec2e1e490+2aaed99252,w.2024.46
LSST Data Management Base Package
Loading...
Searching...
No Matches
_random.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
23#include <pybind11/pybind11.h>
25#include <pybind11/stl.h>
26
29
30namespace py = pybind11;
31
32using namespace lsst::afw::math;
33using namespace pybind11::literals;
34namespace lsst {
35namespace afw {
36namespace math {
37template <typename ImageT>
39 wrappers.wrap([](auto &mod) {
40 mod.def("randomUniformImage", (void (*)(ImageT *, Random &))randomUniformImage<ImageT>);
41 mod.def("randomUniformPosImage", (void (*)(ImageT *, Random &))randomUniformPosImage<ImageT>);
42 mod.def("randomUniformIntImage",
43 (void (*)(ImageT *, Random &, unsigned long))randomUniformIntImage<ImageT>);
44 mod.def("randomFlatImage",
45 (void (*)(ImageT *, Random &, double const, double const))randomFlatImage<ImageT>);
46 mod.def("randomGaussianImage", (void (*)(ImageT *, Random &))randomGaussianImage<ImageT>);
47 mod.def("randomChisqImage", (void (*)(ImageT *, Random &, double const))randomChisqImage<ImageT>);
48 mod.def("randomPoissonImage", (void (*)(ImageT *, Random &, double const))randomPoissonImage<ImageT>);
49 });
50}
51
53 auto clsRandom = wrappers.wrapType(py::class_<Random>(wrappers.module, "Random"), [](auto &mod,
54 auto &cls) {
55 /* Constructors */
56 cls.def(py::init<Random::Algorithm, unsigned long>(), "algorithm"_a = Random::Algorithm::MT19937,
57 "seed"_a = 1);
58 cls.def(py::init<std::string const &, unsigned long>(), "algorithm"_a, "seed"_a = 1);
59
60 /* Members */
61 cls.def("deepCopy", &Random::deepCopy);
62 cls.def("getAlgorithm", &Random::getAlgorithm);
63 cls.def("getAlgorithmName", &Random::getAlgorithmName);
64 cls.def_static("getAlgorithmNames", &Random::getAlgorithmNames);
65 cls.def("getSeed", &Random::getSeed);
66 cls.def("uniform", &Random::uniform);
67 cls.def("uniformPos", &Random::uniformPos);
68 cls.def("uniformInt", &Random::uniformInt);
69 cls.def("flat", &Random::flat);
70 cls.def("gaussian", &Random::gaussian);
71 cls.def("chisq", &Random::chisq);
72 cls.def("poisson", &Random::poisson);
73
74 // getState and setState are special, their std::string cannot
75 // be converted to a Python string (needs to go to bytes instead)
76 // thus use the same solution as employed with Swig
77 cls.def("getState", [](Random &self) -> py::object {
78 std::string state = self.getState();
79 return py::reinterpret_steal<py::object>(PyBytes_FromStringAndSize(state.data(), state.size()));
80 });
81 cls.def("setState", [](Random &self, py::bytes const &state) { self.setState(state); });
82 });
83 /* Member types and enums */
84 wrappers.wrapType(py::enum_<Random::Algorithm>(clsRandom, "Algorithm"), [](auto &mod, auto &enm) {
85 enm.value("MT19937", Random::Algorithm::MT19937);
86 enm.value("RANLXS0", Random::Algorithm::RANLXS0);
87 enm.value("RANLXS1", Random::Algorithm::RANLXS1);
88 enm.value("RANLXS2", Random::Algorithm::RANLXS2);
89 enm.value("RANLXD1", Random::Algorithm::RANLXD1);
90 enm.value("RANLXD2", Random::Algorithm::RANLXD2);
91 enm.value("RANLUX", Random::Algorithm::RANLUX);
92 enm.value("RANLUX389", Random::Algorithm::RANLUX389);
93 enm.value("CMRG", Random::Algorithm::CMRG);
94 enm.value("MRG", Random::Algorithm::MRG);
95 enm.value("TAUS", Random::Algorithm::TAUS);
96 enm.value("TAUS2", Random::Algorithm::TAUS2);
97 enm.value("GFSR4", Random::Algorithm::GFSR4);
98 enm.value("NUM_ALGORITHMS", Random::Algorithm::NUM_ALGORITHMS);
99 enm.export_values();
100 });
101}
102
104 wrappers.addSignatureDependency("lsst.afw.image");
105 declareRandom(wrappers);
106 declareRandomImage<lsst::afw::image::Image<double>>(wrappers);
107 declareRandomImage<lsst::afw::image::Image<float>>(wrappers);
108}
109} // namespace math
110} // namespace afw
111} // namespace lsst
A class that can be used to generate sequences of random numbers according to a number of different a...
Definition Random.h:57
@ MT19937
The MT19937 "Mersenne Twister" generator of Makoto Matsumoto and Takuji Nishimura.
Definition Random.h:62
@ TAUS
A maximally equidistributed combined Tausworthe generator by L'Ecuyer.
Definition Random.h:85
@ RANLUX
Original version of the RANLUX algorithm, 24-bit output.
Definition Random.h:77
@ RANLXS2
Second-generation version of the RANLUX algorithm of Lüscher, 24-bit output, luxury level 2 (stronges...
Definition Random.h:71
@ RANLXD1
Double precision (48-bit) output using the RANLXS algorithm, luxury level 1 (weakest).
Definition Random.h:73
@ NUM_ALGORITHMS
Number of supported algorithms.
Definition Random.h:92
@ MRG
Fifth-order multiple recursive generator by L'Ecuyer, Blouin, and Coutre.
Definition Random.h:83
@ GFSR4
A fifth-order multiple recursive generator by L'Ecuyer, Blouin, and Coutre.
Definition Random.h:90
@ RANLXS1
Second-generation version of the RANLUX algorithm of Lüscher, 24-bit output, luxury level 1 (stronger...
Definition Random.h:68
@ RANLXD2
Double precision (48-bit) output using the RANLXS algorithm, luxury level 2 (strongest).
Definition Random.h:75
@ RANLXS0
Second-generation version of the RANLUX algorithm of Lüscher, 24-bit output, luxury level 0 (weakest)
Definition Random.h:65
@ CMRG
Combined multiple recursive generator by L'Ecuyer.
Definition Random.h:81
@ TAUS2
A maximally equidistributed combined Tausworthe generator by L'Ecuyer with improved seeding relative ...
Definition Random.h:88
@ RANLUX389
Original version of the RANLUX algorithm, 24-bit output (all bits are decorrelated).
Definition Random.h:79
void setState(State const &state)
Definition Random.cc:113
A helper class for subdividing pybind11 module across multiple translation units (i....
Definition python.h:242
void addSignatureDependency(std::string const &name)
Indicate an external module that provides a type used in function/method signatures.
Definition python.h:357
void wrap(WrapperCallback function)
Add a set of wrappers without defining a class.
Definition python.h:369
PyType wrapType(PyType cls, ClassWrapperCallback function, bool setModuleName=true)
Add a type (class or enum) wrapper, deferring method and other attribute definitions until finish() i...
Definition python.h:391
void declareRandomImage(lsst::cpputils::python::WrapperCollection &wrappers)
Definition _random.cc:38
void declareRandom(lsst::cpputils::python::WrapperCollection &wrappers)
Definition _random.cc:52
void wrapRandom(lsst::cpputils::python::WrapperCollection &)
Definition _random.cc:103