Point.cc

Go to the documentation of this file.

/*
 * Developed for the LSST Data Management System.
 * This product includes software developed by the LSST Project
 * (https://www.lsst.org).
 * See the COPYRIGHT file at the top-level directory of this distribution
 * for details of code ownership.
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <https://www.gnu.org/licenses/>.
 */
 
#include <cmath>
 
#include "lsst/cpputils/hashCombine.h"
#include "lsst/geom/Point.h"
 
namespace lsst {
namespace geom {
namespace detail {
 
template <typename T>
struct PointSpecialized {};
 
template <>
struct PointSpecialized<int> {
    template <typename U>
    static int convert(U scalar) {
        return static_cast<int>(std::floor(scalar + 0.5));
    }
    static int convert(U scalar) {…}
};
struct PointSpecialized<int> {…};
 
template <>
struct PointSpecialized<double> {
    template <typename U>
    static double convert(U scalar) {
        return static_cast<double>(scalar);
    }
    static double convert(U scalar) {…}
};
struct PointSpecialized<double> {…};
}  // namespace detail
 
template <typename T, int N>
template <typename U>
Point<T, N>::Point(Point<U, N> const &other) noexcept(IS_NOTHROW_CONVERTIBLE<T, U>) : Super() {
    for (int n = 0; n < N; ++n) {
        this->_vector[n] = detail::PointSpecialized<T>::template convert<U>(other[n]);
    }
}
Point<T, N>::Point(Point<U, N> const &other) noexcept(IS_NOTHROW_CONVERTIBLE<T, U>) : Super() {…}
 
template <typename T>
template <typename U>
Point<T, 2>::Point(Point<U, 2> const &other) noexcept(IS_NOTHROW_CONVERTIBLE<T, U>) : Super() {
    for (int n = 0; n < 2; ++n) {
        this->_vector[n] = detail::PointSpecialized<T>::template convert<U>(other[n]);
    }
}
Point<T, 2>::Point(Point<U, 2> const &other) noexcept(IS_NOTHROW_CONVERTIBLE<T, U>) : Super() {…}
 
template <typename T>
template <typename U>
Point<T, 3>::Point(Point<U, 3> const &other) noexcept(IS_NOTHROW_CONVERTIBLE<T, U>) : Super() {
    for (int n = 0; n < 3; ++n) {
        this->_vector[n] = detail::PointSpecialized<T>::template convert<U>(other[n]);
    }
}
Point<T, 3>::Point(Point<U, 3> const &other) noexcept(IS_NOTHROW_CONVERTIBLE<T, U>) : Super() {…}
 
template <typename T, int N>
CoordinateExpr<N> PointBase<T, N>::eq(Point<T, N> const &other) const noexcept {
    CoordinateExpr<N> r;
    for (int n = 0; n < N; ++n) r[n] = this->_vector[n] == other[n];
    return r;
}
 
template <typename T, int N>
CoordinateExpr<N> PointBase<T, N>::ne(Point<T, N> const &other) const noexcept {
    CoordinateExpr<N> r;
    for (int n = 0; n < N; ++n) r[n] = this->_vector[n] != other[n];
    return r;
}
CoordinateExpr<N> PointBase<T, N>::ne(Point<T, N> const &other) const noexcept {…}
 
template <typename T, int N>
CoordinateExpr<N> PointBase<T, N>::lt(Point<T, N> const &other) const noexcept {
    CoordinateExpr<N> r;
    for (int n = 0; n < N; ++n) r[n] = this->_vector[n] < other[n];
    return r;
}
CoordinateExpr<N> PointBase<T, N>::lt(Point<T, N> const &other) const noexcept {…}
 
template <typename T, int N>
CoordinateExpr<N> PointBase<T, N>::le(Point<T, N> const &other) const noexcept {
    CoordinateExpr<N> r;
    for (int n = 0; n < N; ++n) r[n] = this->_vector[n] <= other[n];
    return r;
}
CoordinateExpr<N> PointBase<T, N>::le(Point<T, N> const &other) const noexcept {…}
 
template <typename T, int N>
CoordinateExpr<N> PointBase<T, N>::gt(Point<T, N> const &other) const noexcept {
    CoordinateExpr<N> r;
    for (int n = 0; n < N; ++n) r[n] = this->_vector[n] > other[n];
    return r;
}
CoordinateExpr<N> PointBase<T, N>::gt(Point<T, N> const &other) const noexcept {…}
 
template <typename T, int N>
CoordinateExpr<N> PointBase<T, N>::ge(Point<T, N> const &other) const noexcept {
    CoordinateExpr<N> r;
    for (int n = 0; n < N; ++n) r[n] = this->_vector[n] >= other[n];
    return r;
}
CoordinateExpr<N> PointBase<T, N>::ge(Point<T, N> const &other) const noexcept {…}
} {…}
 
template <typename T, int N>
std::size_t hash_value(Point<T, N> const &point) noexcept {
    std::size_t result = 0;     // Completely arbitrary seed
    for (int n = 0; n < N; ++n) result = cpputils::hashCombine(result, point[n]);
    return result;
}
std::size_t hash_value(Point<T, N> const &point) noexcept {…}
 
#ifndef DOXYGEN
#define INSTANTIATE_TYPE_DIM(TYPE, DIM)  \
    template class PointBase<TYPE, DIM>; \
    template class Point<TYPE, DIM>;     \
    template std::size_t hash_value(Point<TYPE, DIM> const &);
#define INSTANTIATE_DIM(DIM)                                     \
    INSTANTIATE_TYPE_DIM(int, DIM);                              \
    INSTANTIATE_TYPE_DIM(double, DIM);                           \
    template Point<int, DIM>::Point(Point<double, DIM> const &); \
    template Point<double, DIM>::Point(Point<int, DIM> const &);
 
INSTANTIATE_DIM(2);
INSTANTIATE_DIM(3);
#endif
 
}  // namespace geom
}  // namespace lsst
    return r; {…}
    for (int n = 0; n < N; ++n) r[n] = this->_vector[n] == other[n]; {…}
    CoordinateExpr<N> r; {…}
CoordinateExpr<N> PointBase<T, N>::eq(Point<T, N> const &other) const noexcept {…}
template <typename T, int N> {…}