LSST Applications  21.0.0+04719a4bac,21.0.0-1-ga51b5d4+f5e6047307,21.0.0-11-g2b59f77+a9c1acf22d,21.0.0-11-ga42c5b2+86977b0b17,21.0.0-12-gf4ce030+76814010d2,21.0.0-13-g1721dae+760e7a6536,21.0.0-13-g3a573fe+768d78a30a,21.0.0-15-g5a7caf0+f21cbc5713,21.0.0-16-g0fb55c1+b60e2d390c,21.0.0-19-g4cded4ca+71a93a33c0,21.0.0-2-g103fe59+bb20972958,21.0.0-2-g45278ab+04719a4bac,21.0.0-2-g5242d73+3ad5d60fb1,21.0.0-2-g7f82c8f+8babb168e8,21.0.0-2-g8f08a60+06509c8b61,21.0.0-2-g8faa9b5+616205b9df,21.0.0-2-ga326454+8babb168e8,21.0.0-2-gde069b7+5e4aea9c2f,21.0.0-2-gecfae73+1d3a86e577,21.0.0-2-gfc62afb+3ad5d60fb1,21.0.0-25-g1d57be3cd+e73869a214,21.0.0-3-g357aad2+ed88757d29,21.0.0-3-g4a4ce7f+3ad5d60fb1,21.0.0-3-g4be5c26+3ad5d60fb1,21.0.0-3-g65f322c+e0b24896a3,21.0.0-3-g7d9da8d+616205b9df,21.0.0-3-ge02ed75+a9c1acf22d,21.0.0-4-g591bb35+a9c1acf22d,21.0.0-4-g65b4814+b60e2d390c,21.0.0-4-gccdca77+0de219a2bc,21.0.0-4-ge8a399c+6c55c39e83,21.0.0-5-gd00fb1e+05fce91b99,21.0.0-6-gc675373+3ad5d60fb1,21.0.0-64-g1122c245+4fb2b8f86e,21.0.0-7-g04766d7+cd19d05db2,21.0.0-7-gdf92d54+04719a4bac,21.0.0-8-g5674e7b+d1bd76f71f,master-gac4afde19b+a9c1acf22d,w.2021.13
LSST Data Management Base Package
keyMap.cc
Go to the documentation of this file.
1 /*
2  * LSST Data Management System
3  *
4  * This product includes software developed by the
5  * LSST Project (http://www.lsst.org/).
6  * See the COPYRIGHT file
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 <pybind11/stl.h>
26 
27 #include "astshim/base.h"
28 #include "astshim/KeyMap.h"
29 #include "astshim/Object.h"
30 
31 namespace py = pybind11;
32 using namespace pybind11::literals;
33 
34 namespace ast {
35 namespace {
36 
37 PYBIND11_MODULE(keyMap, mod) {
38  py::module::import("astshim.object");
39 
40  py::class_<KeyMap, std::shared_ptr<KeyMap>, Object> cls(mod, "KeyMap");
41 
42  cls.def(py::init<std::string const &>(), "options"_a = "");
43 
44  cls.def("copy", &KeyMap::copy);
45  cls.def("defined", &KeyMap::defined, "key"_a);
46  cls.def("key", &KeyMap::key, "ind"_a);
47  cls.def("hasKey", &KeyMap::hasKey, "key"_a);
48  cls.def("length", &KeyMap::length);
49  cls.def("__len__", &KeyMap::size);
50 
51  cls.def("getD", py::overload_cast<std::string const &, int>(&KeyMap::getD, py::const_), "key"_a, "ind"_a);
52  cls.def("getD", py::overload_cast<std::string const &>(&KeyMap::getD, py::const_), "key"_a);
53  cls.def("getF", py::overload_cast<std::string const &, int>(&KeyMap::getF, py::const_), "key"_a, "ind"_a);
54  cls.def("getF", py::overload_cast<std::string const &>(&KeyMap::getF, py::const_), "key"_a);
55  cls.def("getI", py::overload_cast<std::string const &, int>(&KeyMap::getI, py::const_), "key"_a, "ind"_a);
56  cls.def("getI", py::overload_cast<std::string const &>(&KeyMap::getI, py::const_), "key"_a);
57  cls.def("getS", py::overload_cast<std::string const &, int>(&KeyMap::getS, py::const_), "key"_a, "ind"_a);
58  cls.def("getS", py::overload_cast<std::string const &>(&KeyMap::getS, py::const_), "key"_a);
59  cls.def("getB", py::overload_cast<std::string const &, int>(&KeyMap::getB, py::const_), "key"_a, "ind"_a);
60  cls.def("getB", py::overload_cast<std::string const &>(&KeyMap::getB, py::const_), "key"_a);
61  cls.def("getC", py::overload_cast<std::string const &, int>(&KeyMap::getC, py::const_), "key"_a, "ind"_a);
62  cls.def("getC", py::overload_cast<std::string const &>(&KeyMap::getC, py::const_), "key"_a);
63  cls.def("getA", py::overload_cast<std::string const &, int>(&KeyMap::getA, py::const_), "key"_a, "ind"_a);
64  cls.def("getA", py::overload_cast<std::string const &>(&KeyMap::getA, py::const_), "key"_a);
65 
66  cls.def("putD", py::overload_cast<std::string const &, double, std::string const &>(&KeyMap::putD),
67  "key"_a, "value"_a, "comment"_a = "");
68  cls.def("putD",
69  py::overload_cast<std::string const &, std::vector<double> const &, std::string const &>(
70  &KeyMap::putD),
71  "key"_a, "vec"_a, "comment"_a = "");
72  cls.def("putF", py::overload_cast<std::string const &, float, std::string const &>(&KeyMap::putF),
73  "key"_a, "value"_a, "comment"_a = "");
74  cls.def("putF",
75  py::overload_cast<std::string const &, std::vector<float> const &, std::string const &>(
76  &KeyMap::putF),
77  "key"_a, "vec"_a, "comment"_a = "");
78  cls.def("putI", py::overload_cast<std::string const &, int, std::string const &>(&KeyMap::putI), "key"_a,
79  "value"_a, "comment"_a = "");
80  cls.def("putI",
81  py::overload_cast<std::string const &, std::vector<int> const &, std::string const &>(
82  &KeyMap::putI),
83  "key"_a, "vec"_a, "comment"_a = "");
84  cls.def("putS", py::overload_cast<std::string const &, short int, std::string const &>(&KeyMap::putS),
85  "key"_a, "value"_a, "comment"_a = "");
86  cls.def("putS",
87  py::overload_cast<std::string const &, std::vector<short int> const &, std::string const &>(
88  &KeyMap::putS),
89  "key"_a, "vec"_a, "comment"_a = "");
90  cls.def("putB", py::overload_cast<std::string const &, char unsigned, std::string const &>(&KeyMap::putB),
91  "key"_a, "value"_a, "comment"_a = "");
92  cls.def("putB",
93  py::overload_cast<std::string const &, std::vector<char unsigned> const &, std::string const &>(
94  &KeyMap::putB),
95  "key"_a, "vec"_a, "comment"_a = "");
96  cls.def("putC",
97  py::overload_cast<std::string const &, std::string const &, std::string const &>(&KeyMap::putC),
98  "key"_a, "value"_a, "comment"_a = "");
99  cls.def("putC",
100  py::overload_cast<std::string const &, std::vector<std::string> const &, std::string const &>(
101  &KeyMap::putC),
102  "key"_a, "vec"_a, "comment"_a = "");
103  cls.def("putA",
104  py::overload_cast<std::string const &, Object const &, std::string const &>(&KeyMap::putA),
105  "key"_a, "value"_a, "comment"_a = "");
106  cls.def("putA",
107  py::overload_cast<std::string const &, std::vector<std::shared_ptr<Object const>> const &,
108  std::string const &>(&KeyMap::putA),
109  "key"_a, "vec"_a, "comment"_a = "");
110 
111  cls.def("putU", py::overload_cast<std::string const &, std::string const &>(&KeyMap::putU), "key"_a,
112  "comment"_a = "");
113 
114  // there no need to wrap float, short int and unsigned char versions since the type of the key
115  // is already known and the data will be cast
116  // list int first, then float because the first match is used
117  cls.def("append", py::overload_cast<std::string const &, int>(&KeyMap::append), "key"_a, "value"_a);
118  cls.def("append", py::overload_cast<std::string const &, double>(&KeyMap::append), "key"_a, "value"_a);
119  cls.def("append", py::overload_cast<std::string const &, std::string const &>(&KeyMap::append), "key"_a,
120  "value"_a);
121  cls.def("append", py::overload_cast<std::string const &, Object const &>(&KeyMap::append), "key"_a,
122  "value"_a);
123 
124  // there no need to wrap float, short int and unsigned char versions since the type of the key
125  // is already known and the data will be cast
126  // list int first, then float because the first match is used
127  cls.def("replace", py::overload_cast<std::string const &, int, int>(&KeyMap::replace), "key"_a, "ind"_a,
128  "value"_a);
129  cls.def("replace", py::overload_cast<std::string const &, int, double>(&KeyMap::replace), "key"_a,
130  "ind"_a, "value"_a);
131  cls.def("replace", py::overload_cast<std::string const &, int, std::string const &>(&KeyMap::replace),
132  "key"_a, "ind"_a, "value"_a);
133  cls.def("replace", py::overload_cast<std::string const &, int, Object const &>(&KeyMap::replace), "key"_a,
134  "ind"_a, "value"_a);
135 
136  cls.def("remove", &KeyMap::remove, "key"_a);
137  cls.def("rename", &KeyMap::rename, "oldKey"_a, "newKey"_a);
138  cls.def("type", &KeyMap::type, "key"_a);
139 }
140 
141 } // namespace
142 } // namespace ast
table::Key< int > type
Definition: Detector.cc:163
Key< U > key
Definition: Schema.cc:281
AST wrapper classes and functions.
std::shared_ptr< FrameSet > append(FrameSet const &first, FrameSet const &second)
Construct a FrameSet that performs two transformations in series.
Definition: functional.cc:33
PYBIND11_MODULE(_cameraGeom, mod)
Definition: _cameraGeom.cc:38
bool defined
Definition: slots.cc:27