LSST Applications g0b6bd0c080+a72a5dd7e6,g1182afd7b4+2a019aa3bb,g17e5ecfddb+2b8207f7de,g1d67935e3f+06cf436103,g38293774b4+ac198e9f13,g396055baef+6a2097e274,g3b44f30a73+6611e0205b,g480783c3b1+98f8679e14,g48ccf36440+89c08d0516,g4b93dc025c+98f8679e14,g5c4744a4d9+a302e8c7f0,g613e996a0d+e1c447f2e0,g6c8d09e9e7+25247a063c,g7271f0639c+98f8679e14,g7a9cd813b8+124095ede6,g9d27549199+a302e8c7f0,ga1cf026fa3+ac198e9f13,ga32aa97882+7403ac30ac,ga786bb30fb+7a139211af,gaa63f70f4e+9994eb9896,gabf319e997+ade567573c,gba47b54d5d+94dc90c3ea,gbec6a3398f+06cf436103,gc6308e37c7+07dd123edb,gc655b1545f+ade567573c,gcc9029db3c+ab229f5caf,gd01420fc67+06cf436103,gd877ba84e5+06cf436103,gdb4cecd868+6f279b5b48,ge2d134c3d5+cc4dbb2e3f,ge448b5faa6+86d1ceac1d,gecc7e12556+98f8679e14,gf3ee170dca+25247a063c,gf4ac96e456+ade567573c,gf9f5ea5b4d+ac198e9f13,gff490e6085+8c2580be5c,w.2022.27
LSST Data Management Base Package
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
31namespace {
32
40void 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
55namespace ast {
56
57AstPermMap* 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
py::object result
Definition: _schema.cc:429
table::Key< std::string > name
Definition: Amplifier.cc:116
std::ostream * os
Definition: Schema.cc:557
T c_str(T... args)
T data(T... args)
T empty(T... args)
T max(T... args)
AST wrapper classes and functions.
void assertOK(AstObject *rawPtr1=nullptr, AstObject *rawPtr2=nullptr)
Throw std::runtime_error if AST's state is bad.
Definition: base.cc:49
T size(T... args)