LSSTApplications  17.0+124,17.0+14,17.0+73,18.0.0+37,18.0.0+80,18.0.0-4-g68ffd23+4,18.1.0-1-g0001055+12,18.1.0-1-g03d53ef+5,18.1.0-1-g1349e88+55,18.1.0-1-g2505f39+44,18.1.0-1-g5315e5e+4,18.1.0-1-g5e4b7ea+14,18.1.0-1-g7e8fceb+4,18.1.0-1-g85f8cd4+48,18.1.0-1-g8ff0b9f+4,18.1.0-1-ga2c679d+1,18.1.0-1-gd55f500+35,18.1.0-10-gb58edde+2,18.1.0-11-g0997b02+4,18.1.0-13-gfe4edf0b+12,18.1.0-14-g259bd21+21,18.1.0-19-gdb69f3f+2,18.1.0-2-g5f9922c+24,18.1.0-2-gd3b74e5+11,18.1.0-2-gfbf3545+32,18.1.0-26-g728bddb4+5,18.1.0-27-g6ff7ca9+2,18.1.0-3-g52aa583+25,18.1.0-3-g8ea57af+9,18.1.0-3-gb69f684+42,18.1.0-3-gfcaddf3+6,18.1.0-32-gd8786685a,18.1.0-4-gf3f9b77+6,18.1.0-5-g1dd662b+2,18.1.0-5-g6dbcb01+41,18.1.0-6-gae77429+3,18.1.0-7-g9d75d83+9,18.1.0-7-gae09a6d+30,18.1.0-9-gc381ef5+4,w.2019.45
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