LSST Applications 30.0.7,g0e76e35be5+e8e946ae08,g19811a7679+138f7293ba,g199a45376c+5e234f8357,g1fd858c14a+2f48dbc4c4,g262e1987ae+fb36cac54d,g29ae962dfc+d9108a0941,g2c21b0017a+4f59a27f16,g31e44d4a5c+b0138be388,g33ac35c1f1+28b9f72785,g35bb328faa+b0138be388,g40c9b15c53+823ad735c1,g47891489e3+bcc48a0b46,g53246c7159+b0138be388,g64539dfbff+e8e946ae08,g67b6fd64d1+bcc48a0b46,g74acd417e5+422380537a,g76965917b2+a5ca99c4d9,g786e29fd12+796b79145d,g7aefaa3e3d+dc0c200193,g86b635cae8+734fe384f0,g87389fa792+d8b5378923,g89139ef638+bcc48a0b46,g8bbb235e95+3f4f7f9447,g8ea07a8fe4+78a4c88802,g9290983e33+ffdc83c6f7,g92c671f44c+e8e946ae08,gaa753fd333+03f406da14,gbf99507273+b0138be388,gc49b57b85e+8df26ee1f0,gca7fc764a6+bcc48a0b46,gd7ef33dd92+bcc48a0b46,gdab6d2f7ff+422380537a,ge1c02a5578+b0138be388,ge410e46f29+bcc48a0b46,ge80df9fc40+e6db5413d1,geaed405ab2+1de65a85c6,gf5dcc679e7+35a0ce2edd,gf5f1c85443+e8e946ae08
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