// 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_FIXED_POLYNOMIAL_POLYNOMIAL_H_ #define CGAL_FIXED_POLYNOMIAL_POLYNOMIAL_H_ #include #include //#include #include namespace CGAL { namespace POLYNOMIAL { //! A basic polynomial class /*! The implementation is proved by internal::Polynomial_impl. This strips leading 0s. When debugging is on, a string representation of the polynomial is stored. This is fairly key for debugging, but rather slow. */ template class Fixed_polynomial: public internal::Fixed_polynomial_impl, NTT, D> { typedef Fixed_polynomial This; typedef internal::Fixed_polynomial_impl Parent; public: // hack to try to fix pgCC //using typename Parent::iterator; typedef typename Parent::iterator iterator; //================ // CONSTRUCTORS //================ //! Default Fixed_polynomial() { } //! Make a constant polynomial Fixed_polynomial(const NTT& c): Parent(c) { } //! Make a polynomial from an iterator range template Fixed_polynomial(Iterator first, Iterator beyond) : Parent(first,beyond) { } Fixed_polynomial(const Parent &p): Parent(p) { } }; } } //namespace CGAL::POLYNOMIAL #endif