LSST Applications g04e9c324dd+8c5ae1fdc5,g0644efc3f0+366663dc37,g123d84c11c+8c5ae1fdc5,g1ec0fe41b4+6ec6b74de1,g1fd858c14a+1be88e80db,g3533f9d6cb+366663dc37,g35bb328faa+8c5ae1fdc5,g35ef7ab7cf+285dd5b202,g53246c7159+8c5ae1fdc5,g60b5630c4e+366663dc37,g663da51e9b+41529343ca,g6735e52a0d+29de3d959a,g67b6fd64d1+57193d00fb,g7605de067c+8f72e4d2dc,g78460c75b0+7e33a9eb6d,g786e29fd12+668abc6043,g844c57033c+03ddc13274,g8852436030+e345a59dd4,g89139ef638+57193d00fb,g989de1cb63+57193d00fb,g9a0bdda227+852181cf57,g9f33ca652e+a2d35689ce,ga1e959baac+5fbc491aed,ga2f891cd6c+366663dc37,gabe3b4be73+8856018cbb,gabf8522325+cc757f8247,gac2eed3f23+57193d00fb,gb1101e3267+f6b489998a,gb89ab40317+57193d00fb,gcf25f946ba+e345a59dd4,gd107969129+227687db21,gd6cbbdb0b4+8e46defd2a,gde0f65d7ad+2dad650f79,ge278dab8ac+2322f1d6ea,ge410e46f29+57193d00fb,gf30d85a44d+8e3077faf9,gf5e32f922b+8c5ae1fdc5,gff02db199a+5c78c1866e,w.2025.28
LSST Data Management Base Package
Loading...
Searching...
No Matches
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 <>
35struct PointSpecialized<int> {
36 template <typename U>
37 static int convert(U scalar) {
38 return static_cast<int>(std::floor(scalar + 0.5));
39 }
40};
41
42template <>
43struct PointSpecialized<double> {
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>
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>
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>
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 = cpputils::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
A boolean coordinate.
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:218
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:275
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
bool constexpr IS_NOTHROW_CONVERTIBLE
Test that a type is nothrow-copy-convertible from U to T.
std::size_t hash_value(Extent< T, N > const &extent) noexcept
Definition Extent.cc:127