/usr/include/CGAL/Polynomial/Interval_polynomial.h is in libcgal-dev 4.11-2build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 | // 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 <drussel@alumni.princeton.edu>
#ifndef CGAL_POLYNOMIAL_INTERVAL_POLYNOMIAL_H
#define CGAL_POLYNOMIAL_INTERVAL_POLYNOMIAL_H
#include <CGAL/Polynomial/basic.h>
#include <CGAL/Polynomial/internal/interval_arithmetic.h>
#include <CGAL/Polynomial/internal/Polynomial_impl.h>
namespace CGAL { namespace POLYNOMIAL {
//! A polynomial specialized for interval number types
/*!
This does not strip leading 0s.
*/
class Interval_polynomial: public internal::Polynomial_impl<Interval_polynomial, Interval_nt>
{
typedef internal::Polynomial_impl<Interval_polynomial, Interval_nt> Parent;
friend class internal::Polynomial_impl<Interval_polynomial, Interval_nt>;
public:
void finalize(){}
protected:
Interval_polynomial(const Parent &p): Parent(p){}
public:
Interval_polynomial(){}
Interval_polynomial(const Interval_nt &nt): Parent(nt){}
template <class It>
Interval_polynomial(It b, It e): Parent(b,e){}
void write(std::ostream &out) const
{
if (Parent::coefs_.size()==0) {
out << "0";
}
else {
for (unsigned int i=0; i< Parent::coefs_.size(); ++i) {
if (i==0) {
out << Parent::coefs_[i];
}
else {
if ( Parent::coefs_[i].inf() != 0 ||
Parent::coefs_[i].sup() != 0 ) {
out << "+";
out << Parent::coefs_[i] << "*t";
if (i != 1) {
out << "^" << i;
}
}
}
}
}
}
void set_coef(unsigned int c, Parent::NT v) {
CGAL_Polynomial_assertion(c < Parent::coefs_.size());
coefs_[c]=v;
}
};
inline std::ostream &operator<<(std::ostream &out, const Interval_polynomial& ip)
{
ip.write(out);
return out;
}
} } //namespace CGAL::POLYNOMIAL
#endif
|