LSSTApplications  18.0.0+106,18.0.0+50,19.0.0,19.0.0+1,19.0.0+10,19.0.0+11,19.0.0+13,19.0.0+17,19.0.0+2,19.0.0-1-g20d9b18+6,19.0.0-1-g425ff20,19.0.0-1-g5549ca4,19.0.0-1-g580fafe+6,19.0.0-1-g6fe20d0+1,19.0.0-1-g7011481+9,19.0.0-1-g8c57eb9+6,19.0.0-1-gb5175dc+11,19.0.0-1-gdc0e4a7+9,19.0.0-1-ge272bc4+6,19.0.0-1-ge3aa853,19.0.0-10-g448f008b,19.0.0-12-g6990b2c,19.0.0-2-g0d9f9cd+11,19.0.0-2-g3d9e4fb2+11,19.0.0-2-g5037de4,19.0.0-2-gb96a1c4+3,19.0.0-2-gd955cfd+15,19.0.0-3-g2d13df8,19.0.0-3-g6f3c7dc,19.0.0-4-g725f80e+11,19.0.0-4-ga671dab3b+1,19.0.0-4-gad373c5+3,19.0.0-5-ga2acb9c+2,19.0.0-5-gfe96e6c+2,w.2020.01
LSSTDataManagementBasePackage
PermMap.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 #include <memory>
23 #include <algorithm> // for std::max
24 #include <sstream>
25 #include <stdexcept>
26 
27 #include "astshim/base.h"
28 #include "astshim/Mapping.h"
29 #include "astshim/PermMap.h"
30 
31 namespace {
32 
40 void checkConstant(int numConst, std::vector<int> const& perm, std::string const& name) {
41  int maxConst = 0;
42  for (int const& innum : perm) {
43  maxConst = std::max(maxConst, -innum);
44  }
45  if (maxConst > numConst) {
47  os << name << " specifies max constant number (min negative number) " << maxConst << ", but only "
48  << numConst << " constants are available";
49  throw std::invalid_argument(os.str());
50  }
51 }
52 
53 } // anonymous namespace
54 
55 namespace ast {
56 
57 AstPermMap* PermMap::makeRawMap(std::vector<int> const& inperm, std::vector<int> const& outperm,
58  std::vector<double> const& constant, std::string const& options) {
59  if (inperm.empty()) {
60  throw std::invalid_argument("inperm has no elements");
61  }
62  if (outperm.empty()) {
63  throw std::invalid_argument("outperm has no elements");
64  }
65  // check `constant` (since AST does not)
66  checkConstant(constant.size(), inperm, "inperm");
67  checkConstant(constant.size(), outperm, "outperm");
68 
69  double const* constptr = constant.size() > 0 ? constant.data() : nullptr;
70  auto result = astPermMap(inperm.size(), inperm.data(), outperm.size(), outperm.data(), constptr, "%s",
71  options.c_str());
72  assertOK();
73  return result;
74 }
75 
76 } // namespace ast
T empty(T... args)
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
STL class.
T data(T... args)
T str(T... args)
T max(T... args)
T size(T... args)
T c_str(T... args)
std::ostream * os
Definition: Schema.cc:746
py::object result
Definition: _schema.cc:429