LSST Applications  21.0.0-172-gfb10e10a+18fedfabac,22.0.0+297cba6710,22.0.0+80564b0ff1,22.0.0+8d77f4f51a,22.0.0+a28f4c53b1,22.0.0+dcf3732eb2,22.0.1-1-g7d6de66+2a20fdde0d,22.0.1-1-g8e32f31+297cba6710,22.0.1-1-geca5380+7fa3b7d9b6,22.0.1-12-g44dc1dc+2a20fdde0d,22.0.1-15-g6a90155+515f58c32b,22.0.1-16-g9282f48+790f5f2caa,22.0.1-2-g92698f7+dcf3732eb2,22.0.1-2-ga9b0f51+7fa3b7d9b6,22.0.1-2-gd1925c9+bf4f0e694f,22.0.1-24-g1ad7a390+a9625a72a8,22.0.1-25-g5bf6245+3ad8ecd50b,22.0.1-25-gb120d7b+8b5510f75f,22.0.1-27-g97737f7+2a20fdde0d,22.0.1-32-gf62ce7b1+aa4237961e,22.0.1-4-g0b3f228+2a20fdde0d,22.0.1-4-g243d05b+871c1b8305,22.0.1-4-g3a563be+32dcf1063f,22.0.1-4-g44f2e3d+9e4ab0f4fa,22.0.1-42-gca6935d93+ba5e5ca3eb,22.0.1-5-g15c806e+85460ae5f3,22.0.1-5-g58711c4+611d128589,22.0.1-5-g75bb458+99c117b92f,22.0.1-6-g1c63a23+7fa3b7d9b6,22.0.1-6-g50866e6+84ff5a128b,22.0.1-6-g8d3140d+720564cf76,22.0.1-6-gd805d02+cc5644f571,22.0.1-8-ge5750ce+85460ae5f3,master-g6e05de7fdc+babf819c66,master-g99da0e417a+8d77f4f51a,w.2021.48
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: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)