// 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$ // // // Author(s) : Daniel Russel #ifndef CGAL_POLYNOMIAL_INTERNAL_BELOW_AT_ROOT_H #define CGAL_POLYNOMIAL_INTERNAL_BELOW_AT_ROOT_H #include #include namespace CGAL { namespace POLYNOMIAL { namespace internal { //! Compute the sign after a root. /*! This has specializations for Explicit_roots. */ template class Sign_below: public Sign_below_rational { typedef Sign_below_rational P; public: Sign_below( K k): P(k) { } Sign_below(){} using P::operator(); typedef typename K::Function first_argument_type; typedef typename K::Root second_argument_type; typedef CGAL::Sign result_type; result_type operator()(const typename K::Function &, const typename K::Root &) const { CGAL_Polynomial_precondition(0); return ZERO; } }; } } } //namespace CGAL::POLYNOMIAL::internal #endif