109 lines
2.3 KiB
C
109 lines
2.3 KiB
C
|
// Copyright (c) 2000
|
||
|
|
// Utrecht University (The Netherlands),
|
||
|
|
// ETH Zurich (Switzerland),
|
||
|
|
// INRIA Sophia-Antipolis (France),
|
||
|
|
// Max-Planck-Institute Saarbruecken (Germany),
|
||
|
|
// and Tel-Aviv University (Israel). All rights reserved.
|
||
|
|
//
|
||
|
|
// This file is part of CGAL (www.cgal.org)
|
||
|
|
//
|
||
|
|
// $URL: https://github.com/CGAL/cgal/blob/v5.1/Cartesian_kernel/include/CGAL/Cartesian/Point_2.h $
|
||
|
|
// $Id: Point_2.h 8bb22d5 2020-03-26T14:23:37+01:00 Sébastien Loriot
|
||
|
|
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
|
||
|
|
//
|
||
|
|
//
|
||
|
|
// Author(s) : Andreas Fabri, Herve Bronnimann
|
||
|
|
|
||
|
|
#ifndef CGAL_CARTESIAN_POINT_2_H
|
||
|
|
#define CGAL_CARTESIAN_POINT_2_H
|
||
|
|
|
||
|
|
#include <CGAL/Origin.h>
|
||
|
|
|
||
|
|
namespace CGAL {
|
||
|
|
|
||
|
|
template < class R_ >
|
||
|
|
class PointC2
|
||
|
|
{
|
||
|
|
typedef PointC2<R_> Self;
|
||
|
|
typedef typename R_::FT FT;
|
||
|
|
// https://doc.cgal.org/latest/Manual/devman_code_format.html#secprogramming_conventions
|
||
|
|
typedef typename R_::Vector_2 Vector_2_;
|
||
|
|
typedef typename R_::Point_2 Point_2;
|
||
|
|
|
||
|
|
// We do not use reference counting here as it is done at the Vector_2 level.
|
||
|
|
Vector_2_ base;
|
||
|
|
|
||
|
|
public:
|
||
|
|
|
||
|
|
typedef typename Vector_2_::Cartesian_const_iterator Cartesian_const_iterator;
|
||
|
|
|
||
|
|
typedef R_ R;
|
||
|
|
|
||
|
|
PointC2() {}
|
||
|
|
|
||
|
|
PointC2(const Origin &)
|
||
|
|
: base(NULL_VECTOR) {}
|
||
|
|
|
||
|
|
PointC2(const FT &x, const FT &y)
|
||
|
|
: base(x, y) {}
|
||
|
|
|
||
|
|
PointC2(const FT &hx, const FT &hy, const FT &hw)
|
||
|
|
: base(hx, hy, hw) {}
|
||
|
|
|
||
|
|
friend void swap(Self& a, Self& b)
|
||
|
|
#ifdef __cpp_lib_is_swappable
|
||
|
|
noexcept(std::is_nothrow_swappable_v<Vector_2_>)
|
||
|
|
#endif
|
||
|
|
{
|
||
|
|
using std::swap;
|
||
|
|
swap(a.base, b.base);
|
||
|
|
}
|
||
|
|
|
||
|
|
const FT& x() const
|
||
|
|
{
|
||
|
|
return base.x();
|
||
|
|
}
|
||
|
|
|
||
|
|
const FT& y() const
|
||
|
|
{
|
||
|
|
return base.y();
|
||
|
|
}
|
||
|
|
|
||
|
|
const FT& hx() const
|
||
|
|
{
|
||
|
|
return base.hx();
|
||
|
|
}
|
||
|
|
const FT& hy() const
|
||
|
|
{
|
||
|
|
return base.hy();
|
||
|
|
}
|
||
|
|
const FT& hw() const
|
||
|
|
{
|
||
|
|
return base.hw();
|
||
|
|
}
|
||
|
|
|
||
|
|
Cartesian_const_iterator cartesian_begin() const
|
||
|
|
{
|
||
|
|
return base.cartesian_begin();
|
||
|
|
}
|
||
|
|
|
||
|
|
Cartesian_const_iterator cartesian_end() const
|
||
|
|
{
|
||
|
|
return base.cartesian_end();
|
||
|
|
}
|
||
|
|
|
||
|
|
typename R_::Boolean operator==(const PointC2 &p) const
|
||
|
|
{
|
||
|
|
return base == p.base;
|
||
|
|
}
|
||
|
|
typename R_::Boolean operator!=(const PointC2 &p) const
|
||
|
|
{
|
||
|
|
return !(*this == p);
|
||
|
|
}
|
||
|
|
|
||
|
|
};
|
||
|
|
|
||
|
|
} //namespace CGAL
|
||
|
|
|
||
|
|
#endif // CGAL_CARTESIAN_POINT_2_H
|