LSST Applications g0f08755f38+82efc23009,g12f32b3c4e+e7bdf1200e,g1653933729+a8ce1bb630,g1a0ca8cf93+50eff2b06f,g28da252d5a+52db39f6a5,g2bbee38e9b+37c5a29d61,g2bc492864f+37c5a29d61,g2cdde0e794+c05ff076ad,g3156d2b45e+41e33cbcdc,g347aa1857d+37c5a29d61,g35bb328faa+a8ce1bb630,g3a166c0a6a+37c5a29d61,g3e281a1b8c+fb992f5633,g414038480c+7f03dfc1b0,g41af890bb2+11b950c980,g5fbc88fb19+17cd334064,g6b1c1869cb+12dd639c9a,g781aacb6e4+a8ce1bb630,g80478fca09+72e9651da0,g82479be7b0+04c31367b4,g858d7b2824+82efc23009,g9125e01d80+a8ce1bb630,g9726552aa6+8047e3811d,ga5288a1d22+e532dc0a0b,gae0086650b+a8ce1bb630,gb58c049af0+d64f4d3760,gc28159a63d+37c5a29d61,gcf0d15dbbd+2acd6d4d48,gd7358e8bfb+778a810b6e,gda3e153d99+82efc23009,gda6a2b7d83+2acd6d4d48,gdaeeff99f8+1711a396fd,ge2409df99d+6b12de1076,ge79ae78c31+37c5a29d61,gf0baf85859+d0a5978c5a,gf3967379c6+4954f8c433,gfb92a5be7c+82efc23009,gfec2e1e490+2aaed99252,w.2024.46
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>
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 = 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
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