LSST Applications  21.0.0-147-g0e635eb1+1acddb5be5,22.0.0+052faf71bd,22.0.0+1ea9a8b2b2,22.0.0+6312710a6c,22.0.0+729191ecac,22.0.0+7589c3a021,22.0.0+9f079a9461,22.0.1-1-g7d6de66+b8044ec9de,22.0.1-1-g87000a6+536b1ee016,22.0.1-1-g8e32f31+6312710a6c,22.0.1-10-gd060f87+016f7cdc03,22.0.1-12-g9c3108e+df145f6f68,22.0.1-16-g314fa6d+c825727ab8,22.0.1-19-g93a5c75+d23f2fb6d8,22.0.1-19-gb93eaa13+aab3ef7709,22.0.1-2-g8ef0a89+b8044ec9de,22.0.1-2-g92698f7+9f079a9461,22.0.1-2-ga9b0f51+052faf71bd,22.0.1-2-gac51dbf+052faf71bd,22.0.1-2-gb66926d+6312710a6c,22.0.1-2-gcb770ba+09e3807989,22.0.1-20-g32debb5+b8044ec9de,22.0.1-23-gc2439a9a+fb0756638e,22.0.1-3-g496fd5d+09117f784f,22.0.1-3-g59f966b+1e6ba2c031,22.0.1-3-g849a1b8+f8b568069f,22.0.1-3-gaaec9c0+c5c846a8b1,22.0.1-32-g5ddfab5d3+60ce4897b0,22.0.1-4-g037fbe1+64e601228d,22.0.1-4-g8623105+b8044ec9de,22.0.1-5-g096abc9+d18c45d440,22.0.1-5-g15c806e+57f5c03693,22.0.1-7-gba73697+57f5c03693,master-g6e05de7fdc+c1283a92b8,master-g72cdda8301+729191ecac,w.2021.39
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)