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
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.
py::object result
Definition: schema.cc:418
void assertOK(AstObject *rawPtr1=nullptr, AstObject *rawPtr2=nullptr)
Throw std::runtime_error if AST&#39;s state is bad.
Definition: base.cc:49
tuple options
Definition: lsstimport.py:47
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