LSST Applications g04e9c324dd+8c5ae1fdc5,g123d84c11c+8c5ae1fdc5,g1ec0fe41b4+6ec6b74de1,g1fd858c14a+3332b7fd5e,g29a0cc5914+63e6b38501,g32513d92db+32ea961568,g35bb328faa+8c5ae1fdc5,g46874a5070+b0fbcfa072,g4d44eb3520+57cbe129f8,g53246c7159+8c5ae1fdc5,g5c55814f68+d821c87bfa,g60b5630c4e+b0fbcfa072,g663da51e9b+005a425d83,g67b6fd64d1+d4e0e85a95,g67fd3c3899+b0fbcfa072,g71d780ea3c+e1dc163c68,g78460c75b0+7e33a9eb6d,g786e29fd12+668abc6043,g844c57033c+929b3e9e34,g851e132a97+e172830085,g8852436030+a7ec7e5967,g89139ef638+d4e0e85a95,g8d7436a09f+38661d0626,g989de1cb63+d4e0e85a95,g9f33ca652e+23636040bc,ga1e959baac+5fbc491aed,ga2f891cd6c+b0fbcfa072,gabe3b4be73+8856018cbb,gabf8522325+cc757f8247,gac2eed3f23+d4e0e85a95,gb1101e3267+68a34dc4ce,gb89ab40317+d4e0e85a95,gcf25f946ba+a7ec7e5967,gd107969129+28621171e6,gd6cbbdb0b4+8e46defd2a,ge410e46f29+d4e0e85a95,geaed405ab2+2322f1d6ea,gf5e32f922b+8c5ae1fdc5,w.2025.31
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
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)