// Copyright (c) 2000,2001,2002,2003 // 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); you can redistribute it and/or // modify it under the terms of the GNU Lesser General Public License as // published by the Free Software Foundation; either version 3 of the License, // or (at your option) any later version. // // Licensees holding a valid commercial license may use this file in // accordance with the commercial license agreement provided with the software. // // This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE // WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. // // $URL$ // $Id$ // SPDX-License-Identifier: LGPL-3.0+ // // // Author(s) : Herve Bronnimann, Sylvain Pion #ifndef CGAL_CARTESIAN_H #define CGAL_CARTESIAN_H #include #include #include namespace CGAL { template < typename FT_, typename Kernel_ > struct Cartesian_base_ref_count : public Cartesian_base< Kernel_, FT_ > { typedef FT_ RT; typedef FT_ FT; // The mechanism that allows to specify reference-counting or not. template < typename T > struct Handle { typedef Handle_for type; }; template < typename Kernel2 > struct Base { typedef Cartesian_base_ref_count Type; }; // was in Cartesian_base typedef Kernel_ K; #define CGAL_Kernel_pred(Y,Z) typedef CartesianKernelFunctors::Y Y; \ Y Z() const { return Y(); } #define CGAL_Kernel_cons(Y,Z) CGAL_Kernel_pred(Y,Z) #include }; template < typename FT_ > struct Cartesian : public Type_equality_wrapper< Cartesian_base_ref_count >, Cartesian > {}; } //namespace CGAL #endif // CGAL_CARTESIAN_H