Loading [MathJax]/extensions/tex2jax.js
LSST Applications g0fba68d861+83433b07ee,g16d25e1f1b+23bc9e47ac,g1ec0fe41b4+3ea9d11450,g1fd858c14a+9be2b0f3b9,g2440f9efcc+8c5ae1fdc5,g35bb328faa+8c5ae1fdc5,g4a4af6cd76+d25431c27e,g4d2262a081+c74e83464e,g53246c7159+8c5ae1fdc5,g55585698de+1e04e59700,g56a49b3a55+92a7603e7a,g60b5630c4e+1e04e59700,g67b6fd64d1+3fc8cb0b9e,g78460c75b0+7e33a9eb6d,g786e29fd12+668abc6043,g8352419a5c+8c5ae1fdc5,g8852436030+60e38ee5ff,g89139ef638+3fc8cb0b9e,g94187f82dc+1e04e59700,g989de1cb63+3fc8cb0b9e,g9d31334357+1e04e59700,g9f33ca652e+0a83e03614,gabe3b4be73+8856018cbb,gabf8522325+977d9fabaf,gb1101e3267+8b4b9c8ed7,gb89ab40317+3fc8cb0b9e,gc0af124501+57ccba3ad1,gcf25f946ba+60e38ee5ff,gd6cbbdb0b4+1cc2750d2e,gd794735e4e+7be992507c,gdb1c4ca869+be65c9c1d7,gde0f65d7ad+c7f52e58fe,ge278dab8ac+6b863515ed,ge410e46f29+3fc8cb0b9e,gf35d7ec915+97dd712d81,gf5e32f922b+8c5ae1fdc5,gf618743f1b+747388abfa,gf67bdafdda+3fc8cb0b9e,w.2025.18
LSST Data Management Base Package
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Modules Pages
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
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)
T str(T... args)