LSST Applications g07dc498a13+5a531fccd6,g1409bbee79+5a531fccd6,g1a7e361dbc+5a531fccd6,g1fd858c14a+bae9e05889,g28da252d5a+b6acab2954,g33399d78f5+749e2df9f6,g35bb328faa+e55fef2c71,g3bd4b5ce2c+753c3426d3,g3d4cdeeb7c+495e717508,g43bc871e57+32b9ddb877,g53246c7159+e55fef2c71,g60b5630c4e+f9e43d3906,g6e5c4a0e23+f441d97430,g78460c75b0+8427c4cc8f,g786e29fd12+307f82e6af,g8534526c7b+af2545e932,g85d8d04dbe+ded3a614ca,g89139ef638+5a531fccd6,g8b49a6ea8e+f9e43d3906,g9125e01d80+e55fef2c71,g989de1cb63+5a531fccd6,g9a9baf55bd+f1bd1a7c26,g9f33ca652e+c963d5c8aa,gaaedd4e678+5a531fccd6,gabe3b4be73+9c0c3c7524,gb092a606b0+a33ed67792,gb58c049af0+28045f66fd,gc2fcbed0ba+f9e43d3906,gca43fec769+e55fef2c71,gcf25f946ba+749e2df9f6,gd6cbbdb0b4+784e334a77,gde0f65d7ad+a0ab96d407,ge278dab8ac+25667260f6,geab183fbe5+f9e43d3906,gecb8035dfe+0fa5abcb94,gefa07fa684+89734069dd,gf58bf46354+e55fef2c71,gfe7187db8c+55cd7d2043,w.2025.01
LSST Data Management Base Package
Loading...
Searching...
No Matches
utils.cc
Go to the documentation of this file.
1/*
2 * LSST Data Management System
3 * Copyright 2017 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 */
23
24namespace ast {
25namespace detail {
26
27void astBadToNan(ast::Array2D const &arr) {
28 for (auto i = arr.begin(); i != arr.end(); ++i) {
29 for (auto j = i->begin(); j != i->end(); ++j) {
30 if (*j == AST__BAD) {
32 }
33 }
34 }
35}
36
37std::string getClassName(AstObject const *rawObj) {
38 std::string name = astGetC(rawObj, "Class");
39 assertOK();
40 if (name != "CmpMap") {
41 return name;
42 }
43 bool series = isSeries(reinterpret_cast<AstCmpMap const *>(rawObj));
44 return series ? "SeriesMap" : "ParallelMap";
45}
46
47bool isSeries(AstCmpMap const *cmpMap) {
48 AstMapping *rawMap1;
49 AstMapping *rawMap2;
50 int series, invert1, invert2;
51 astDecompose(cmpMap, &rawMap1, &rawMap2, &series, &invert1, &invert2);
52 astAnnul(rawMap1);
53 astAnnul(rawMap2);
54 assertOK();
55 return series;
56}
57
58} // namespace detail
59} // namespace ast
table::Key< std::string > name
Definition Amplifier.cc:116
std::string getClassName(AstObject const *rawObj)
Get the AST class name, changing CmpMap to SeriesMap or ParallelMap as appropriate.
Definition utils.cc:37
void astBadToNan(std::vector< double > &p)
Replace AST__BAD with a quiet NaN in a vector.
Definition utils.h:59
bool isSeries(AstCmpMap const *cmpMap)
Return true if the compound map is in series.
Definition utils.cc:47
AST wrapper classes and functions.
ndarray::Array< double, 2, 2 > Array2D
2D array of const double; typically used for lists of const points
Definition base.h:42
void assertOK(AstObject *rawPtr1=nullptr, AstObject *rawPtr2=nullptr)
Throw std::runtime_error if AST's state is bad.
Definition base.cc:49
T quiet_NaN(T... args)