LSST Applications g042eb84c57+730a74494b,g04e9c324dd+8c5ae1fdc5,g134cb467dc+1f1e3e7524,g199a45376c+0ba108daf9,g1fd858c14a+fa7d31856b,g210f2d0738+f66ac109ec,g262e1987ae+83a3acc0e5,g29ae962dfc+d856a2cb1f,g2cef7863aa+aef1011c0b,g35bb328faa+8c5ae1fdc5,g3fd5ace14f+a1e0c9f713,g47891489e3+0d594cb711,g4d44eb3520+c57ec8f3ed,g4d7b6aa1c5+f66ac109ec,g53246c7159+8c5ae1fdc5,g56a1a4eaf3+fd7ad03fde,g64539dfbff+f66ac109ec,g67b6fd64d1+0d594cb711,g67fd3c3899+f66ac109ec,g6985122a63+0d594cb711,g74acd417e5+3098891321,g786e29fd12+668abc6043,g81db2e9a8d+98e2ab9f28,g87389fa792+8856018cbb,g89139ef638+0d594cb711,g8d7436a09f+80fda9ce03,g8ea07a8fe4+760ca7c3fc,g90f42f885a+033b1d468d,g97be763408+a8a29bda4b,g99822b682c+e3ec3c61f9,g9d5c6a246b+0d5dac0c3d,ga41d0fce20+9243b26dd2,gbf99507273+8c5ae1fdc5,gd7ef33dd92+0d594cb711,gdab6d2f7ff+3098891321,ge410e46f29+0d594cb711,geaed405ab2+c4bbc419c6,gf9a733ac38+8c5ae1fdc5,w.2025.38
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