1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
|
// Copyright (c) 1997-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/v6.1/Kernel_d/include/CGAL/Kernel_d/simple_objects.h $
// $Id: include/CGAL/Kernel_d/simple_objects.h b26b07a1242 $
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
//
//
// Author(s) : Michael Seel <seel@mpi-sb.mpg.de>
#ifndef CGAL_SIMPLE_OBJECTS_H
#define CGAL_SIMPLE_OBJECTS_H
namespace CGAL {
template <class R>
struct Lt_from_compare {
typedef typename R::Point_d Point_d;
bool operator()(const Point_d& p1, const Point_d& p2) const
{ typename R::Compare_lexicographically_d cmp;
return cmp(p1,p2) == SMALLER; }
};
template <class R>
struct Le_from_compare {
typedef typename R::Point_d Point_d;
bool operator()(const Point_d& p1, const Point_d& p2) const
{ typename R::Compare_lexicographically_d cmp;
return cmp(p1,p2) != LARGER; }
};
template <class R>
struct Eq_from_method {
typedef typename R::Point_d Point_d;
bool operator()(const Point_d& p1, const Point_d& p2) const
{ return p1 == p2; }
};
} //namespace CGAL
#endif // CGAL_SIMPLE_OBJECTS_H
|
