LSST Applications g1653933729+34a971ddd9,g1a997c3884+34a971ddd9,g2160c40384+da0d0eec6b,g28da252d5a+1236b942f7,g2bbee38e9b+e5a1bc5b38,g2bc492864f+e5a1bc5b38,g2ca4be77d2+192fe503f0,g2cdde0e794+704103fe75,g3156d2b45e+6e87dc994a,g347aa1857d+e5a1bc5b38,g35bb328faa+34a971ddd9,g3a166c0a6a+e5a1bc5b38,g3e281a1b8c+8ec26ec694,g4005a62e65+ba0306790b,g414038480c+9f5be647b3,g41af890bb2+c3a10c924f,g5065538af8+e7237db731,g5a0bb5165c+eae055db26,g717e5f8c0f+b65b5c3ae4,g80478fca09+4ce5a07937,g82479be7b0+08790af60f,g858d7b2824+b65b5c3ae4,g9125e01d80+34a971ddd9,ga5288a1d22+5df949a35e,gae0086650b+34a971ddd9,gb58c049af0+ace264a4f2,gbd397ab92a+2141afb137,gc28159a63d+e5a1bc5b38,gc805d3fbd4+b65b5c3ae4,gcf0d15dbbd+97632ccc20,gd6b7c0dfd1+de826e8718,gda6a2b7d83+97632ccc20,gdaeeff99f8+7774323b41,ge2409df99d+e6cadbf968,ge33fd446bb+b65b5c3ae4,ge79ae78c31+e5a1bc5b38,gf0baf85859+890af219f9,gf5289d68f6+a27069ed62,w.2024.37
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)