// 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/v5.1/Kernel_d/include/CGAL/Kernel_d/simple_objects.h $ // $Id: simple_objects.h 0779373 2020-03-26T13:31:46+01:00 Sébastien Loriot // SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Michael Seel #ifndef CGAL_SIMPLE_OBJECTS_H #define CGAL_SIMPLE_OBJECTS_H namespace CGAL { template 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 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 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