// Copyright (c) 2005 Stanford University (USA). // 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$ $Date$ // // // Author(s) : Daniel Russel #ifndef CGAL_POLYNOMIAL_INTERNAL_TO_ISOLATING_INTERVAL_H #define CGAL_POLYNOMIAL_INTERNAL_TO_ISOLATING_INTERVAL_H #include #ifdef CGAL_USE_CORE #include #include #endif #include namespace CGAL { namespace POLYNOMIAL { namespace internal { //! Compute the sign after a root. template class To_isolating_interval { public: To_isolating_interval(){ } typedef typename std::pair result_type; typedef typename K::Root argument_type; template const result_type& operator()(const Simple_interval_root &v) const { return v.isolating_interval(); } #ifdef CGAL_USE_CORE result_type operator()(const CORE::Expr &r) const { double a,b; r.doubleInterval(a,b); // do something return std::make_pair(typename K::FT(a), typename K::FT(b)); } #endif std::pair operator()(double v) const { return std::make_pair(v,v); } }; } } } //namespace CGAL::POLYNOMIAL::internal #endif