Loading [MathJax]/extensions/tex2jax.js
LSST Applications g0fba68d861+83433b07ee,g16d25e1f1b+23bc9e47ac,g1ec0fe41b4+3ea9d11450,g1fd858c14a+9be2b0f3b9,g2440f9efcc+8c5ae1fdc5,g35bb328faa+8c5ae1fdc5,g4a4af6cd76+d25431c27e,g4d2262a081+c74e83464e,g53246c7159+8c5ae1fdc5,g55585698de+1e04e59700,g56a49b3a55+92a7603e7a,g60b5630c4e+1e04e59700,g67b6fd64d1+3fc8cb0b9e,g78460c75b0+7e33a9eb6d,g786e29fd12+668abc6043,g8352419a5c+8c5ae1fdc5,g8852436030+60e38ee5ff,g89139ef638+3fc8cb0b9e,g94187f82dc+1e04e59700,g989de1cb63+3fc8cb0b9e,g9d31334357+1e04e59700,g9f33ca652e+0a83e03614,gabe3b4be73+8856018cbb,gabf8522325+977d9fabaf,gb1101e3267+8b4b9c8ed7,gb89ab40317+3fc8cb0b9e,gc0af124501+57ccba3ad1,gcf25f946ba+60e38ee5ff,gd6cbbdb0b4+1cc2750d2e,gd794735e4e+7be992507c,gdb1c4ca869+be65c9c1d7,gde0f65d7ad+c7f52e58fe,ge278dab8ac+6b863515ed,ge410e46f29+3fc8cb0b9e,gf35d7ec915+97dd712d81,gf5e32f922b+8c5ae1fdc5,gf618743f1b+747388abfa,gf67bdafdda+3fc8cb0b9e,w.2025.18
LSST Data Management Base Package
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Modules Pages
MapBox.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
23#include <vector>
24
25#include "ndarray.h"
26
27#include "astshim/base.h"
29#include "astshim/MapBox.h"
30#include "astshim/Mapping.h"
31
32namespace ast {
33
35 int minOutCoord, int maxOutCoord)
36 : lbndIn(lbnd),
37 ubndIn(ubnd),
39 maxOutCoord(maxOutCoord), // if 0 then _compute will set it to # of outputs
40 lbndOut(),
41 ubndOut(),
42 xl(),
43 xu() {
44 _compute(map, lbnd, ubnd, minOutCoord, maxOutCoord);
45}
46
47void MapBox::_compute(Mapping const& map, std::vector<double> const& lbnd, std::vector<double> const& ubnd,
48 int minOutCoord, int maxOutCoord) {
49 int const nin = map.getNIn();
50 int const nout = map.getNOut();
51 detail::assertEqual(lbnd.size(), "lbnd.size()", static_cast<std::size_t>(nin), "NIn");
52 detail::assertEqual(ubnd.size(), "ubnd.size()", static_cast<std::size_t>(nin), "NIn");
53 if (maxOutCoord == 0) {
54 maxOutCoord = nout;
55 this->maxOutCoord = maxOutCoord; // DM-10008
56 } else if ((maxOutCoord < 0) || (maxOutCoord > nout)) {
58 os << "maxOutCoord = " << maxOutCoord << " not in range [1, " << nout << "], or 0 for all remaining";
59 throw std::invalid_argument(os.str());
60 }
61 if ((minOutCoord < 0) || (minOutCoord > maxOutCoord)) {
62 std::ostringstream os;
63 os << "minOutCoord = " << minOutCoord << " not in range [1, " << maxOutCoord << "]";
64 throw std::invalid_argument(os.str());
65 }
66 int const npoints = 1 + maxOutCoord - minOutCoord;
67 lbndOut.reserve(npoints);
68 ubndOut.reserve(npoints);
69 xl = ndarray::allocate(ndarray::makeVector(npoints, nout));
70 xu = ndarray::allocate(ndarray::makeVector(npoints, nout));
71 bool const forward = true;
72 double lbndOut_i;
73 double ubndOut_i;
74 for (int i = 0, outcoord = minOutCoord; outcoord <= maxOutCoord; ++i, ++outcoord) {
75 auto xlrow = xl[i];
76 auto xurow = xu[i];
77 astMapBox(map.getRawPtr(), lbnd.data(), ubnd.data(), forward, outcoord, &lbndOut_i, &ubndOut_i,
78 xlrow.getData(), xurow.getData());
79 assertOK();
80 lbndOut.push_back(lbndOut_i);
81 ubndOut.push_back(ubndOut_i);
82 }
83
84 // convert AST__BAD to nan
89}
90
91} // namespace ast
std::vector< double > ubndIn
Upper bound of the input box.
Definition MapBox.h:93
int minOutCoord
Minimum output coordinate axis for which to compute an output bounding box, starting from 1.
Definition MapBox.h:95
MapBox(Mapping const &map, std::vector< double > const &lbnd, std::vector< double > const &ubnd, int minOutCoord=1, int maxOutCoord=0)
Find a bounding box for a Mapping.
Definition MapBox.cc:34
std::vector< double > lbndIn
Lower bound of the input box.
Definition MapBox.h:92
Array2D xu
2-d array of [out coord, an input point at which the upper bound occurred]
Definition MapBox.h:101
std::vector< double > ubndOut
Upper bound of the output box.
Definition MapBox.h:99
int maxOutCoord
Maximum output coordinate axis for which to compute an output bounding box, starting from 1.
Definition MapBox.h:97
Array2D xl
2-d array of [out coord, an input point at which the lower bound occurred]
Definition MapBox.h:100
std::vector< double > lbndOut
Lower bound of the output box.
Definition MapBox.h:98
An abstract base class for objects which transform one set of coordinates to another.
Definition Mapping.h:59
int getNOut() const
Get NOut: the number of output axes.
Definition Mapping.h:82
int getNIn() const
Get NIn: the number of input axes.
Definition Mapping.h:77
AstObject const * getRawPtr() const
Get the raw AST pointer.
Definition Object.h:292
T data(T... args)
T forward(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)
T str(T... args)