LSST Applications g180d380827+0f66a164bb,g2079a07aa2+86d27d4dc4,g2305ad1205+7d304bc7a0,g29320951ab+500695df56,g2bbee38e9b+0e5473021a,g337abbeb29+0e5473021a,g33d1c0ed96+0e5473021a,g3a166c0a6a+0e5473021a,g3ddfee87b4+e42ea45bea,g48712c4677+36a86eeaa5,g487adcacf7+2dd8f347ac,g50ff169b8f+96c6868917,g52b1c1532d+585e252eca,g591dd9f2cf+c70619cc9d,g5a732f18d5+53520f316c,g5ea96fc03c+341ea1ce94,g64a986408d+f7cd9c7162,g858d7b2824+f7cd9c7162,g8a8a8dda67+585e252eca,g99cad8db69+469ab8c039,g9ddcbc5298+9a081db1e4,ga1e77700b3+15fc3df1f7,gb0e22166c9+60f28cb32d,gba4ed39666+c2a2e4ac27,gbb8dafda3b+c92fc63c7e,gbd866b1f37+f7cd9c7162,gc120e1dc64+02c66aa596,gc28159a63d+0e5473021a,gc3e9b769f7+b0068a2d9f,gcf0d15dbbd+e42ea45bea,gdaeeff99f8+f9a426f77a,ge6526c86ff+84383d05b3,ge79ae78c31+0e5473021a,gee10cc3b42+585e252eca,gff1a9f87cc+f7cd9c7162,w.2024.17
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 = 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