LSST Applications g00274db5b6+edbf708997,g00d0e8bbd7+edbf708997,g199a45376c+5137f08352,g1fd858c14a+1d4b6db739,g262e1987ae+f4d9505c4f,g29ae962dfc+7156fb1a53,g2cef7863aa+73c82f25e4,g35bb328faa+edbf708997,g3e17d7035e+5b3adc59f5,g3fd5ace14f+852fa6fbcb,g47891489e3+6dc8069a4c,g53246c7159+edbf708997,g64539dfbff+9f17e571f4,g67b6fd64d1+6dc8069a4c,g74acd417e5+ae494d68d9,g786e29fd12+af89c03590,g7ae74a0b1c+a25e60b391,g7aefaa3e3d+536efcc10a,g7cc15d900a+d121454f8d,g87389fa792+a4172ec7da,g89139ef638+6dc8069a4c,g8d7436a09f+28c28d8d6d,g8ea07a8fe4+db21c37724,g92c671f44c+9f17e571f4,g98df359435+b2e6376b13,g99af87f6a8+b0f4ad7b8d,gac66b60396+966efe6077,gb88ae4c679+7dec8f19df,gbaa8f7a6c5+38b34f4976,gbf99507273+edbf708997,gc24b5d6ed1+9f17e571f4,gca7fc764a6+6dc8069a4c,gcc769fe2a4+97d0256649,gd7ef33dd92+6dc8069a4c,gdab6d2f7ff+ae494d68d9,gdbb4c4dda9+9f17e571f4,ge410e46f29+6dc8069a4c,geaed405ab2+e194be0d2b,w.2025.47
LSST Data Management Base Package
Loading...
Searching...
No Matches
indexing.h
Go to the documentation of this file.
1// This file is part of afw.
2//
3// Developed for the LSST Data Management System.
4// This product includes software developed by the LSST Project
5// (http://www.lsst.org).
6// See the COPYRIGHT file at the top-level directory of this distribution
7// for details of code ownership.
8//
9// This program is free software: you can redistribute it and/or modify
10// it under the terms of the GNU General Public License as published by
11// the Free Software Foundation, either version 3 of the License, or
12// (at your option) any later version.
13//
14// This program is distributed in the hope that it will be useful,
15// but WITHOUT ANY WARRANTY; without even the implied warranty of
16// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17// GNU General Public License for more details.
18//
19// You should have received a copy of the GNU General Public License
20// along with this program. If not, see <http://www.gnu.org/licenses/>.
21
22#ifndef LSST_AFW_IMAGE_PYTHON_INDEXING_H
23#define LSST_AFW_IMAGE_PYTHON_INDEXING_H
24
25#include "pybind11/pybind11.h"
26#include "lsst/geom/Box.h"
27
28namespace lsst { namespace afw { namespace image { namespace python {
29
30inline void checkBounds(geom::Point2I const & index, geom::Box2I const & bbox) {
31 if (!bbox.contains(index)) {
32 std::string msg = (boost::format("Index (%d, %d) outside image bounds (%d, %d) to (%d, %d).")
33 % index.getX() % index.getY() % bbox.getMinX() % bbox.getMinY()
34 % bbox.getMaxX() % bbox.getMaxY()).str();
35 if (index.getX() < 0 || index.getY() < 0) {
36 msg += " Note that negative indices are only interpreted as relative to the upper bound "
37 "when LOCAL coordinates are used.";
38 }
39 PyErr_SetString(PyExc_IndexError, msg.c_str());
40 throw pybind11::error_already_set();
41 }
42}
43
44}}}} // namespace lsst::afw::image::python
45
46#endif
47
T c_str(T... args)
An integer coordinate rectangle.
Definition Box.h:55
int getMinY() const noexcept
Definition Box.h:158
int getMinX() const noexcept
Definition Box.h:157
int getMaxX() const noexcept
Definition Box.h:161
bool contains(Point2I const &point) const noexcept
Return true if the box contains the point.
Definition Box.cc:114
int getMaxY() const noexcept
Definition Box.h:162
void checkBounds(geom::Point2I const &index, geom::Box2I const &bbox)
Definition indexing.h:30
Point< int, 2 > Point2I
Definition Point.h:321