LSST Applications g0b6bd0c080+a72a5dd7e6,g1182afd7b4+2a019aa3bb,g17e5ecfddb+2b8207f7de,g1d67935e3f+06cf436103,g38293774b4+ac198e9f13,g396055baef+6a2097e274,g3b44f30a73+6611e0205b,g480783c3b1+98f8679e14,g48ccf36440+89c08d0516,g4b93dc025c+98f8679e14,g5c4744a4d9+a302e8c7f0,g613e996a0d+e1c447f2e0,g6c8d09e9e7+25247a063c,g7271f0639c+98f8679e14,g7a9cd813b8+124095ede6,g9d27549199+a302e8c7f0,ga1cf026fa3+ac198e9f13,ga32aa97882+7403ac30ac,ga786bb30fb+7a139211af,gaa63f70f4e+9994eb9896,gabf319e997+ade567573c,gba47b54d5d+94dc90c3ea,gbec6a3398f+06cf436103,gc6308e37c7+07dd123edb,gc655b1545f+ade567573c,gcc9029db3c+ab229f5caf,gd01420fc67+06cf436103,gd877ba84e5+06cf436103,gdb4cecd868+6f279b5b48,ge2d134c3d5+cc4dbb2e3f,ge448b5faa6+86d1ceac1d,gecc7e12556+98f8679e14,gf3ee170dca+25247a063c,gf4ac96e456+ade567573c,gf9f5ea5b4d+ac198e9f13,gff490e6085+8c2580be5c,w.2022.27
LSST Data Management Base Package
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),
38 minOutCoord(minOutCoord),
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)) {
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::ostream * os
Definition: Schema.cc:557
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
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 push_back(T... args)
T reserve(T... args)
T size(T... args)