// Copyright (c) 2000-2004 Utrecht University (The Netherlands), // ETH Zurich (Switzerland), Freie Universitaet Berlin (Germany), // INRIA Sophia-Antipolis (France), Martin-Luther-University Halle-Wittenberg // (Germany), Max-Planck-Institute Saarbruecken (Germany), RISC Linz (Austria), // 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; version 2.1 of the License. // See the file LICENSE.LGPL distributed with CGAL. // // 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. // // $Source$ // $Revision$ $Date$ // $Name$ // // Author(s) : Herve Bronnimann, Sylvain Pion #ifndef CGAL_SIMPLE_CARTESIAN_H #define CGAL_SIMPLE_CARTESIAN_H #include #include #include CGAL_BEGIN_NAMESPACE template < typename FT_, typename Kernel > struct Cartesian_base_no_ref_count : public Cartesian_base< Kernel > { typedef FT_ RT; typedef FT_ FT; // The mecanism that allows to specify reference-counting or not. template < typename T > struct Handle { typedef T type; }; template < typename Kernel2 > struct Base { typedef Cartesian_base_no_ref_count Type; }; // TODO: cleanup (use Rational_traits<> instead) static FT make_FT(const RT & num, const RT& denom) { return num/denom;} static FT make_FT(const RT & num) { return num;} static RT FT_numerator(const FT &r) { return r;} static RT FT_denominator(const FT &) { return RT(1);} }; template < typename FT_ > struct Simple_cartesian : public Type_equality_wrapper< Cartesian_base_no_ref_count >, Simple_cartesian > {}; CGAL_END_NAMESPACE #endif // CGAL_SIMPLE_CARTESIAN_H