LSSTApplications  17.0+11,17.0+34,17.0+56,17.0+57,17.0+59,17.0+7,17.0-1-g377950a+33,17.0.1-1-g114240f+2,17.0.1-1-g4d4fbc4+28,17.0.1-1-g55520dc+49,17.0.1-1-g5f4ed7e+52,17.0.1-1-g6dd7d69+17,17.0.1-1-g8de6c91+11,17.0.1-1-gb9095d2+7,17.0.1-1-ge9fec5e+5,17.0.1-1-gf4e0155+55,17.0.1-1-gfc65f5f+50,17.0.1-1-gfc6fb1f+20,17.0.1-10-g87f9f3f+1,17.0.1-11-ge9de802+16,17.0.1-16-ga14f7d5c+4,17.0.1-17-gc79d625+1,17.0.1-17-gdae4c4a+8,17.0.1-2-g26618f5+29,17.0.1-2-g54f2ebc+9,17.0.1-2-gf403422+1,17.0.1-20-g2ca2f74+6,17.0.1-23-gf3eadeb7+1,17.0.1-3-g7e86b59+39,17.0.1-3-gb5ca14a,17.0.1-3-gd08d533+40,17.0.1-30-g596af8797,17.0.1-4-g59d126d+4,17.0.1-4-gc69c472+5,17.0.1-6-g5afd9b9+4,17.0.1-7-g35889ee+1,17.0.1-7-gc7c8782+18,17.0.1-9-gc4bbfb2+3,w.2019.22
LSSTDataManagementBasePackage
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
int minOutCoord
Minimum output coordinate axis for which to compute an output bounding box, starting from 1...
Definition: MapBox.h:95
AstObject const * getRawPtr() const
Get the raw AST pointer.
Definition: Object.h:292
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
AST wrapper classes and functions.
void assertOK(AstObject *rawPtr1=nullptr, AstObject *rawPtr2=nullptr)
Throw std::runtime_error if AST&#39;s state is bad.
Definition: base.cc:49
void astBadToNan(std::vector< double > &p)
Replace AST__BAD with a quiet NaN in a vector.
Definition: utils.h:59
An abstract base class for objects which transform one set of coordinates to another.
Definition: Mapping.h:59
T push_back(T... args)
T data(T... args)
std::vector< double > lbndOut
Lower bound of the output box.
Definition: MapBox.h:98
T str(T... args)
Array2D xl
2-d array of [out coord, an input point at which the lower bound occurred]
Definition: MapBox.h:100
T size(T... args)
int getNIn() const
Get NIn: the number of input axes.
Definition: Mapping.h:77
void assertEqual(T1 val1, std::string const &descr1, T2 val2, std::string const &descr2)
Definition: utils.h:48
int getNOut() const
Get NOut: the number of output axes.
Definition: Mapping.h:82
std::vector< double > ubndOut
Upper bound of the output box.
Definition: MapBox.h:99
Array2D xu
2-d array of [out coord, an input point at which the upper bound occurred]
Definition: MapBox.h:101
std::ostream * os
Definition: Schema.cc:746
T reserve(T... args)
int maxOutCoord
Maximum output coordinate axis for which to compute an output bounding box, starting from 1...
Definition: MapBox.h:97