LSSTApplications  17.0+124,17.0+14,17.0+73,18.0.0+37,18.0.0+80,18.0.0-4-g68ffd23+4,18.1.0-1-g0001055+12,18.1.0-1-g03d53ef+5,18.1.0-1-g1349e88+55,18.1.0-1-g2505f39+44,18.1.0-1-g5315e5e+4,18.1.0-1-g5e4b7ea+14,18.1.0-1-g7e8fceb+4,18.1.0-1-g85f8cd4+48,18.1.0-1-g8ff0b9f+4,18.1.0-1-ga2c679d+1,18.1.0-1-gd55f500+35,18.1.0-10-gb58edde+2,18.1.0-11-g0997b02+4,18.1.0-13-gfe4edf0b+12,18.1.0-14-g259bd21+21,18.1.0-19-gdb69f3f+2,18.1.0-2-g5f9922c+24,18.1.0-2-gd3b74e5+11,18.1.0-2-gfbf3545+32,18.1.0-26-g728bddb4+5,18.1.0-27-g6ff7ca9+2,18.1.0-3-g52aa583+25,18.1.0-3-g8ea57af+9,18.1.0-3-gb69f684+42,18.1.0-3-gfcaddf3+6,18.1.0-32-gd8786685a,18.1.0-4-gf3f9b77+6,18.1.0-5-g1dd662b+2,18.1.0-5-g6dbcb01+41,18.1.0-6-gae77429+3,18.1.0-7-g9d75d83+9,18.1.0-7-gae09a6d+30,18.1.0-9-gc381ef5+4,w.2019.45
LSSTDataManagementBasePackage
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 
24 #include "lsst/utils/hashCombine.h"
25 #include "lsst/geom/Point.h"
26 
27 namespace lsst {
28 namespace geom {
29 namespace detail {
30 
31 template <typename T>
32 struct PointSpecialized {};
33 
34 template <>
35 struct 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 
42 template <>
43 struct PointSpecialized<double> {
44  template <typename U>
45  static double convert(U scalar) {
46  return static_cast<double>(scalar);
47  }
48 };
49 } // namespace detail
50 
51 template <typename T, int N>
52 template <typename U>
53 Point<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 
59 template <typename T>
60 template <typename U>
61 Point<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 
67 template <typename T>
68 template <typename U>
69 Point<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 
75 template <typename T, int N>
78  for (int n = 0; n < N; ++n) r[n] = this->_vector[n] == other[n];
79  return r;
80 }
81 
82 template <typename T, int N>
85  for (int n = 0; n < N; ++n) r[n] = this->_vector[n] != other[n];
86  return r;
87 }
88 
89 template <typename T, int N>
92  for (int n = 0; n < N; ++n) r[n] = this->_vector[n] < other[n];
93  return r;
94 }
95 
96 template <typename T, int N>
99  for (int n = 0; n < N; ++n) r[n] = this->_vector[n] <= other[n];
100  return r;
101 }
102 
103 template <typename T, int N>
106  for (int n = 0; n < N; ++n) r[n] = this->_vector[n] > other[n];
107  return r;
108 }
109 
110 template <typename T, int N>
113  for (int n = 0; n < N; ++n) r[n] = this->_vector[n] >= other[n];
114  return r;
115 }
116 
117 template <typename T, int N>
118 std::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 
135 INSTANTIATE_DIM(2);
136 INSTANTIATE_DIM(3);
137 #endif
138 
139 } // namespace geom
140 } // namespace lsst
CoordinateExpr< N > ne(Point< T, N > const &other) const noexcept
Definition: Point.cc:83
A coordinate class intended to represent absolute positions.
CoordinateExpr< N > eq(Point< T, N > const &other) const noexcept
Definition: Point.cc:76
T floor(T... args)
ItemVariant const * other
Definition: Schema.cc:56
std::size_t hash_value(Extent< T, N > const &extent) noexcept
Definition: Extent.cc:127
A base class for image defects.
CoordinateExpr< N > ge(Point< T, N > const &other) const noexcept
Definition: Point.cc:111
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:176
CoordinateExpr< N > lt(Point< T, N > const &other) const noexcept
Definition: Point.cc:90
std::size_t hashCombine(std::size_t seed) noexcept
Combine hashes.
Definition: hashCombine.h:35
py::object result
Definition: _schema.cc:429
CoordinateExpr< N > le(Point< T, N > const &other) const noexcept
Definition: Point.cc:97
CoordinateExpr< N > gt(Point< T, N > const &other) const noexcept
Definition: Point.cc:104