LSSTApplications  16.0-11-g09ed895+2,16.0-11-g12e47bd,16.0-11-g9bb73b2+6,16.0-12-g5c924a4+6,16.0-14-g9a974b3+1,16.0-15-g1417920+1,16.0-15-gdd5ca33+1,16.0-16-gf0259e2,16.0-17-g31abd91+7,16.0-17-g7d7456e+7,16.0-17-ga3d2e9f+13,16.0-18-ga4d4bcb+1,16.0-18-gd06566c+1,16.0-2-g0febb12+21,16.0-2-g9d5294e+69,16.0-2-ga8830df+6,16.0-20-g21842373+7,16.0-24-g3eae5ec,16.0-28-gfc9ea6c+4,16.0-29-ge8801f9,16.0-3-ge00e371+34,16.0-4-g18f3627+13,16.0-4-g5f3a788+20,16.0-4-ga3eb747+10,16.0-4-gabf74b7+29,16.0-4-gb13d127+6,16.0-49-g42e581f7+6,16.0-5-g27fb78a+7,16.0-5-g6a53317+34,16.0-5-gb3f8a4b+87,16.0-6-g9321be7+4,16.0-6-gcbc7b31+42,16.0-6-gf49912c+29,16.0-7-gd2eeba5+51,16.0-71-ge89f8615e,16.0-8-g21fd5fe+29,16.0-8-g3a9f023+20,16.0-8-g4734f7a+1,16.0-8-g5858431+3,16.0-9-gf5c1f43+8,master-gd73dc1d098+1,w.2019.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  return astPermMap(inperm.size(), inperm.data(), outperm.size(), outperm.data(), constptr, "%s",
71  options.c_str());
72 }
73 
74 } // namespace ast
T empty(T... args)
AST wrapper classes and functions.
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