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
Point.cc
Go to the documentation of this file.
1/*
2 * Developed for the LSST Data Management System.
3 * This product includes software developed by the LSST Project
4 * (https://www.lsst.org).
5 * See the COPYRIGHT file at the top-level directory of this distribution
6 * for details of code ownership.
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 GNU General Public License
19 * along with this program. If not, see <https://www.gnu.org/licenses/>.
20 */
21
22#include <cmath>
23
25#include "lsst/geom/Point.h"
26
27namespace lsst {
28namespace geom {
29namespace detail {
30
31template <typename T>
33
34template <>
36 template <typename U>
37 static int convert(U scalar) {
38 return static_cast<int>(std::floor(scalar + 0.5));
39 }
40};
41
42template <>
44 template <typename U>
45 static double convert(U scalar) {
46 return static_cast<double>(scalar);
47 }
48};
49} // namespace detail
50
51template <typename T, int N>
52template <typename U>
53Point<T, N>::Point(Point<U, N> const &other) noexcept(IS_NOTHROW_CONVERTIBLE<T, U>) : Super() {
54 for (int n = 0; n < N; ++n) {
55 this->_vector[n] = detail::PointSpecialized<T>::template convert<U>(other[n]);
56 }
57}
58
59template <typename T>
60template <typename U>
61Point<T, 2>::Point(Point<U, 2> const &other) noexcept(IS_NOTHROW_CONVERTIBLE<T, U>) : Super() {
62 for (int n = 0; n < 2; ++n) {
63 this->_vector[n] = detail::PointSpecialized<T>::template convert<U>(other[n]);
64 }
65}
66
67template <typename T>
68template <typename U>
69Point<T, 3>::Point(Point<U, 3> const &other) noexcept(IS_NOTHROW_CONVERTIBLE<T, U>) : Super() {
70 for (int n = 0; n < 3; ++n) {
71 this->_vector[n] = detail::PointSpecialized<T>::template convert<U>(other[n]);
72 }
73}
74
75template <typename T, int N>
78 for (int n = 0; n < N; ++n) r[n] = this->_vector[n] == other[n];
79 return r;
81
82template <typename T, int N>
85 for (int n = 0; n < N; ++n) r[n] = this->_vector[n] != other[n];
86 return r;
87}
88
89template <typename T, int N>
92 for (int n = 0; n < N; ++n) r[n] = this->_vector[n] < other[n];
93 return r;
94}
95
96template <typename T, int N>
99 for (int n = 0; n < N; ++n) r[n] = this->_vector[n] <= other[n];
100 return r;
101}
102
103template <typename T, int N>
106 for (int n = 0; n < N; ++n) r[n] = this->_vector[n] > other[n];
107 return r;
108}
109
110template <typename T, int N>
113 for (int n = 0; n < N; ++n) r[n] = this->_vector[n] >= other[n];
114 return r;
115}
116
117template <typename T, int N>
118std::size_t hash_value(Point<T, N> const &point) noexcept {
119 std::size_t result = 0; // Completely arbitrary seed
120 for (int n = 0; n < N; ++n) result = utils::hashCombine(result, point[n]);
121 return result;
122}
123
124#ifndef DOXYGEN
125#define INSTANTIATE_TYPE_DIM(TYPE, DIM) \
126 template class PointBase<TYPE, DIM>; \
127 template class Point<TYPE, DIM>; \
128 template std::size_t hash_value(Point<TYPE, DIM> const &);
129#define INSTANTIATE_DIM(DIM) \
130 INSTANTIATE_TYPE_DIM(int, DIM); \
131 INSTANTIATE_TYPE_DIM(double, DIM); \
132 template Point<int, DIM>::Point(Point<double, DIM> const &); \
133 template Point<double, DIM>::Point(Point<int, DIM> const &);
134
135INSTANTIATE_DIM(2);
136INSTANTIATE_DIM(3);
137#endif
138
139} // namespace geom
140} // namespace lsst
py::object result
Definition: _schema.cc:429
A boolean coordinate.
CoordinateExpr< N > ne(Point< T, N > const &other) const noexcept
Definition: Point.cc:83
CoordinateExpr< N > lt(Point< T, N > const &other) const noexcept
Definition: Point.cc:90
CoordinateExpr< N > le(Point< T, N > const &other) const noexcept
Definition: Point.cc:97
CoordinateExpr< N > ge(Point< T, N > const &other) const noexcept
Definition: Point.cc:111
CoordinateExpr< N > gt(Point< T, N > const &other) const noexcept
Definition: Point.cc:104
CoordinateExpr< N > eq(Point< T, N > const &other) const noexcept
Definition: Point.cc:76
A coordinate class intended to represent absolute positions.
Definition: Point.h:169
Point(T val=static_cast< T >(0)) noexcept(Super::IS_ELEMENT_NOTHROW_COPYABLE)
Construct a Point with all elements set to the same scalar value.
Definition: Point.h:176
T floor(T... args)
std::size_t hashCombine(std::size_t seed) noexcept
Combine hashes.
Definition: hashCombine.h:35
std::size_t hash_value(Extent< T, N > const &extent) noexcept
Definition: Extent.cc:127
A base class for image defects.