LSST Applications  21.0.0+04719a4bac,21.0.0-1-ga51b5d4+f5e6047307,21.0.0-11-g2b59f77+a9c1acf22d,21.0.0-11-ga42c5b2+86977b0b17,21.0.0-12-gf4ce030+76814010d2,21.0.0-13-g1721dae+760e7a6536,21.0.0-13-g3a573fe+768d78a30a,21.0.0-15-g5a7caf0+f21cbc5713,21.0.0-16-g0fb55c1+b60e2d390c,21.0.0-19-g4cded4ca+71a93a33c0,21.0.0-2-g103fe59+bb20972958,21.0.0-2-g45278ab+04719a4bac,21.0.0-2-g5242d73+3ad5d60fb1,21.0.0-2-g7f82c8f+8babb168e8,21.0.0-2-g8f08a60+06509c8b61,21.0.0-2-g8faa9b5+616205b9df,21.0.0-2-ga326454+8babb168e8,21.0.0-2-gde069b7+5e4aea9c2f,21.0.0-2-gecfae73+1d3a86e577,21.0.0-2-gfc62afb+3ad5d60fb1,21.0.0-25-g1d57be3cd+e73869a214,21.0.0-3-g357aad2+ed88757d29,21.0.0-3-g4a4ce7f+3ad5d60fb1,21.0.0-3-g4be5c26+3ad5d60fb1,21.0.0-3-g65f322c+e0b24896a3,21.0.0-3-g7d9da8d+616205b9df,21.0.0-3-ge02ed75+a9c1acf22d,21.0.0-4-g591bb35+a9c1acf22d,21.0.0-4-g65b4814+b60e2d390c,21.0.0-4-gccdca77+0de219a2bc,21.0.0-4-ge8a399c+6c55c39e83,21.0.0-5-gd00fb1e+05fce91b99,21.0.0-6-gc675373+3ad5d60fb1,21.0.0-64-g1122c245+4fb2b8f86e,21.0.0-7-g04766d7+cd19d05db2,21.0.0-7-gdf92d54+04719a4bac,21.0.0-8-g5674e7b+d1bd76f71f,master-gac4afde19b+a9c1acf22d,w.2021.13
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"
28 #include "astshim/detail/utils.h"
29 #include "astshim/MapBox.h"
30 #include "astshim/Mapping.h"
31 
32 namespace ast {
33 
34 MapBox::MapBox(Mapping const& map, std::vector<double> const& lbnd, std::vector<double> const& ubnd,
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 
47 void 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:746
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)