// Copyright (c) 2006-2008 Max-Planck-Institute Saarbruecken (Germany) // 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) : Michael Hemmer #ifndef CGAL_UTILS_H #define CGAL_UTILS_H #include namespace CGAL { // use Min template< class T > inline T min BOOST_PREVENT_MACRO_SUBSTITUTION ( const T& x , const T& y) { return Min()( x , y ); } template< class T , class Compare > inline T min BOOST_PREVENT_MACRO_SUBSTITUTION ( const T& x , const T& y, const Compare& c) { return Min(c)( x , y ); } // use Max template< class T > inline T max BOOST_PREVENT_MACRO_SUBSTITUTION ( const T& x , const T& y) { return Max()( x , y ); } template< class T , class Compare > inline T max BOOST_PREVENT_MACRO_SUBSTITUTION ( const T& x , const T& y, const Compare& c) { return Max(c)( x , y ); } // use Is_valid template< class T > inline bool is_valid( const T& x ) { return Is_valid< T >()( x ); } } //namespace CGAL #endif // CGAL_UTILS_H