LSST Applications  21.0.0-1-g8760c09+64c1bc5aa5,21.0.0-1-ga51b5d4+1350bb8745,21.0.0-120-g57749b33+77c36da417,21.0.0-14-g3bd782b+62bd888395,21.0.0-19-gd0ca341+838f035eb4,21.0.0-2-g103fe59+72fa3717e3,21.0.0-2-g45278ab+64c1bc5aa5,21.0.0-2-g7f82c8f+c94709d2a4,21.0.0-2-gde069b7+11a2aa21cd,21.0.0-2-gfc62afb+6396df189c,21.0.0-20-g1e553c2+573b22c308,21.0.0-21-g51ee50f4+4b5bad23d2,21.0.0-21-gb17f18e+23ef0c54f7,21.0.0-22-g57c5a76+ef01df0b67,21.0.0-27-gcbf119a+a00fe59290,21.0.0-3-g1b65d06+b174077c85,21.0.0-3-g357aad2+d6fe283175,21.0.0-3-g4a4ce7f+6396df189c,21.0.0-3-g4be5c26+6396df189c,21.0.0-3-ga324b9c+6396df189c,21.0.0-3-ge02ed75+ef01df0b67,21.0.0-3-gf9d8b05+c94709d2a4,21.0.0-33-g0da61bd6+3fb5ecf9cc,21.0.0-4-g7dab645+99b0103697,21.0.0-47-gf1d71818e+649249edd3,21.0.0-5-g5f8d297+2da38119fb,21.0.0-5-g8c1d971+02ffdaf10e,21.0.0-5-gcc89fd6+782b3b5ca8,21.0.0-5-gd00fb1e+5ffc17f859,21.0.0-6-g1930a60+782b3b5ca8,21.0.0-6-gc675373+6396df189c,21.0.0-7-g0503b2e+6b209d634c,21.0.0-7-g7aa11f2+ef01df0b67,21.0.0-7-g997b569+a0df6514ce,21.0.0-8-g949febb+64c1bc5aa5,21.0.0-9-g7058be7+37de8fccb6,master-ga86695c5c8+ef01df0b67,master-gcc5351303a+72fa3717e3,v22.0.0.rc2
LSST Data Management Base Package
Frame.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  */
22 #include <stdexcept>
23 #include <vector>
24 
25 #include "astshim/CmpFrame.h"
26 #include "astshim/Frame.h"
27 #include "astshim/FrameSet.h"
28 
29 namespace ast {
30 
32  auto *rawFrameSet =
33  reinterpret_cast<AstFrameSet *>(astConvert(getRawPtr(), to.getRawPtr(), domainlist.c_str()));
34  assertOK(reinterpret_cast<AstObject *>(rawFrameSet));
35  if (!rawFrameSet) {
37  }
38  return Object::fromAstObject<FrameSet>(reinterpret_cast<AstObject *>(rawFrameSet), false);
39 }
40 
41 std::shared_ptr<FrameSet> Frame::findFrame(Frame const &tmplt, std::string const &domainlist) {
42  auto *rawFrameSet =
43  reinterpret_cast<AstFrameSet *>(astFindFrame(getRawPtr(), tmplt.getRawPtr(), domainlist.c_str()));
44  assertOK(reinterpret_cast<AstObject *>(rawFrameSet));
45  if (!rawFrameSet) {
47  }
48  return Object::fromAstObject<FrameSet>(reinterpret_cast<AstObject *>(rawFrameSet), false);
49 }
50 
52  std::vector<double> const &b1, std::vector<double> const &b2) const {
53  int const naxes = 2;
54  detail::assertEqual(getNAxes(), "# axes", naxes, "");
55  detail::assertEqual(a1.size(), "a1.size()", static_cast<std::size_t>(naxes), "");
56  detail::assertEqual(a2.size(), "a2.size()", static_cast<std::size_t>(naxes), "");
57  detail::assertEqual(b1.size(), "b1.size()", static_cast<std::size_t>(naxes), "");
58  detail::assertEqual(b2.size(), "b2.size()", static_cast<std::size_t>(naxes), "");
59  std::vector<double> ret(naxes);
60  astIntersect(getRawPtr(), a1.data(), a2.data(), b1.data(), b2.data(), ret.data());
61  assertOK();
63  return ret;
64 }
65 
66 CmpFrame Frame::under(Frame const &next) const { return CmpFrame(*this, next); }
67 
69  AstMapping *rawMap;
70  auto *rawFrame =
71  reinterpret_cast<AstFrame *>(astPickAxes(getRawPtr(), axes.size(), axes.data(), &rawMap));
72  assertOK(reinterpret_cast<AstObject *>(rawFrame), reinterpret_cast<AstObject *>(rawMap));
74  try {
75  frame = Object::fromAstObject<Frame>(reinterpret_cast<AstObject *>(rawFrame), false);
76  } catch (...) {
77  astAnnul(rawMap);
78  throw;
79  }
80  auto map = Object::fromAstObject<Mapping>(reinterpret_cast<AstObject *>(rawMap), false);
81  return FrameMapping(frame, map);
82 }
83 
85  std::vector<double> const &point3) const {
86  int const naxes = getNAxes();
87  detail::assertEqual(point1.size(), "a1.size()", static_cast<std::size_t>(naxes), "");
88  detail::assertEqual(point2.size(), "a2.size()", static_cast<std::size_t>(naxes), "");
89  detail::assertEqual(point3.size(), "b1.size()", static_cast<std::size_t>(naxes), "");
90  ResolvedPoint ret(naxes);
91  astResolve(getRawPtr(), point1.data(), point2.data(), point3.data(), ret.point.data(), &ret.d1, &ret.d2);
92  assertOK();
94  return ret;
95 }
96 
97 } // namespace ast
table::Key< int > to
T c_str(T... args)
A CmpFrame is a compound Frame which allows two component Frames (of any class) to be merged together...
Definition: CmpFrame.h:60
Frame is used to represent a coordinate system.
Definition: Frame.h:157
int getNAxes() const
Get NAxes: the number of axes in the frame (i.e.
Definition: Frame.h:876
std::shared_ptr< FrameSet > findFrame(Frame const &tmplt, std::string const &domainlist="")
Find a coordinate system with specified characteristics.
Definition: Frame.cc:41
std::vector< double > intersect(std::vector< double > const &a1, std::vector< double > const &a2, std::vector< double > const &b1, std::vector< double > const &b2) const
Find the point of intersection between two geodesic curves.
Definition: Frame.cc:51
CmpFrame under(Frame const &next) const
Combine this frame with another to form a compound frame (CmpFrame), with the axes of this frame foll...
Definition: Frame.cc:66
FrameMapping pickAxes(std::vector< int > const &axes) const
Create a new Frame whose axes are copied from an existing Frame along with other Frame attributes,...
Definition: Frame.cc:68
ResolvedPoint resolve(std::vector< double > const &point1, std::vector< double > const &point2, std::vector< double > const &point3) const
Resolve a vector into two orthogonal components.
Definition: Frame.cc:84
std::shared_ptr< FrameSet > convert(Frame const &to, std::string const &domainlist="")
Compute a frameset that describes the conversion between this frame and another frame.
Definition: Frame.cc:31
Struct returned by Frame::pickAxes containing a frame and a mapping.
Definition: Frame.h:91
AstObject const * getRawPtr() const
Get the raw AST pointer.
Definition: Object.h:292
Struct returned by Frame::resolve containing a point and the resolved vector components.
Definition: Frame.h:75
std::vector< double > point
Point.
Definition: Frame.h:83
double d2
Resolved vector component 2.
Definition: Frame.h:85
double d1
Resolved vector component 1.
Definition: Frame.h:84
T data(T... args)
void assertEqual(T1 val1, std::string const &descr1, T2 val2, std::string const &descr2)
Definition: utils.h:48
void astBadToNan(std::vector< double > &p)
Replace AST__BAD with a quiet NaN in a vector.
Definition: utils.h:59
AST wrapper classes and functions.
void assertOK(AstObject *rawPtr1=nullptr, AstObject *rawPtr2=nullptr)
Throw std::runtime_error if AST's state is bad.
Definition: base.cc:49
T size(T... args)