LSSTApplications  16.0-10-g0ee56ad,16.0-11-ga33d1f2+2,16.0-12-g3ef5c14+1,16.0-12-g71e5ef5+14,16.0-12-gbdf3636+2,16.0-13-g118c103+2,16.0-13-g8f68b0a,16.0-15-gbf5c1cb,16.0-16-gfd17674+2,16.0-17-g7c01f5c+2,16.0-18-g0a50484,16.0-20-ga20f992+3,16.0-21-g0e05fd4+2,16.0-21-g15e2d33,16.0-22-g62d8060,16.0-22-g847a80f,16.0-24-gfa57b64+1,16.0-28-g3990c221,16.0-3-gf928089+2,16.0-32-g88a4f23,16.0-34-gd7987ad,16.0-36-g6d07a18,16.0-4-g10fc685,16.0-4-g18f3627+24,16.0-4-g5f3a788+25,16.0-5-gaf5c3d7+1,16.0-5-gcc1f4bb,16.0-6-g3b92700,16.0-6-g4412fcd+2,16.0-6-g7235603+1,16.0-68-gb45e8e9d,16.0-7-g0913a87,16.0-7-g56728dd,16.0-8-g14ebd58,16.0-8-g2df868b,16.0-8-g4cec79c+1,16.0-81-g9604f5049,16.0-9-g5400cdc,16.0-9-ge6233d7+1,master-g2880f2d8cf+1,w.2019.05
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