LSSTApplications  19.0.0-14-gb0260a2+72efe9b372,20.0.0+7927753e06,20.0.0+8829bf0056,20.0.0+995114c5d2,20.0.0+b6f4b2abd1,20.0.0+bddc4f4cbe,20.0.0-1-g253301a+8829bf0056,20.0.0-1-g2b7511a+0d71a2d77f,20.0.0-1-g5b95a8c+7461dd0434,20.0.0-12-g321c96ea+23efe4bbff,20.0.0-16-gfab17e72e+fdf35455f6,20.0.0-2-g0070d88+ba3ffc8f0b,20.0.0-2-g4dae9ad+ee58a624b3,20.0.0-2-g61b8584+5d3db074ba,20.0.0-2-gb780d76+d529cf1a41,20.0.0-2-ged6426c+226a441f5f,20.0.0-2-gf072044+8829bf0056,20.0.0-2-gf1f7952+ee58a624b3,20.0.0-20-geae50cf+e37fec0aee,20.0.0-25-g3dcad98+544a109665,20.0.0-25-g5eafb0f+ee58a624b3,20.0.0-27-g64178ef+f1f297b00a,20.0.0-3-g4cc78c6+e0676b0dc8,20.0.0-3-g8f21e14+4fd2c12c9a,20.0.0-3-gbd60e8c+187b78b4b8,20.0.0-3-gbecbe05+48431fa087,20.0.0-38-ge4adf513+a12e1f8e37,20.0.0-4-g97dc21a+544a109665,20.0.0-4-gb4befbc+087873070b,20.0.0-4-gf910f65+5d3db074ba,20.0.0-5-gdfe0fee+199202a608,20.0.0-5-gfbfe500+d529cf1a41,20.0.0-6-g64f541c+d529cf1a41,20.0.0-6-g9a5b7a1+a1cd37312e,20.0.0-68-ga3f3dda+5fca18c6a4,20.0.0-9-g4aef684+e18322736b,w.2020.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
lsst::geom::CoordinateExpr
A boolean coordinate.
Definition: CoordinateExpr.h:50
std::floor
T floor(T... args)
lsst::geom::PointBase::ge
CoordinateExpr< N > ge(Point< T, N > const &other) const noexcept
Definition: Point.cc:111
lsst::geom::Point::Point
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
lsst::geom::PointBase::lt
CoordinateExpr< N > lt(Point< T, N > const &other) const noexcept
Definition: Point.cc:90
lsst::geom::detail::PointSpecialized< int >::convert
static int convert(U scalar)
Definition: Point.cc:37
lsst::geom::hash_value
std::size_t hash_value(Extent< T, N > const &extent) noexcept
Definition: Extent.cc:127
Point.h
hashCombine.h
lsst::geom::detail::PointSpecialized< double >::convert
static double convert(U scalar)
Definition: Point.cc:45
lsst::geom::PointBase
Definition: Point.h:38
lsst::geom::PointBase::eq
CoordinateExpr< N > eq(Point< T, N > const &other) const noexcept
Definition: Point.cc:76
other
ItemVariant const * other
Definition: Schema.cc:56
result
py::object result
Definition: _schema.cc:429
lsst::geom::detail::PointSpecialized
Definition: Point.cc:32
lsst
A base class for image defects.
Definition: imageAlgorithm.dox:1
lsst::geom
Definition: AffineTransform.h:36
lsst::utils::hashCombine
std::size_t hashCombine(std::size_t seed) noexcept
Combine hashes.
Definition: hashCombine.h:35
lsst::geom::Point
A coordinate class intended to represent absolute positions.
Definition: CoordinateBase.h:39
lsst::geom::PointBase::ne
CoordinateExpr< N > ne(Point< T, N > const &other) const noexcept
Definition: Point.cc:83
lsst::geom::PointBase::gt
CoordinateExpr< N > gt(Point< T, N > const &other) const noexcept
Definition: Point.cc:104
std::size_t
lsst::geom::PointBase::le
CoordinateExpr< N > le(Point< T, N > const &other) const noexcept
Definition: Point.cc:97