Trivial fixes for the testsuite.

This commit is contained in:
Marc Glisse 2010-04-22 09:58:25 +00:00
parent ff0d2411be
commit 2256ae01e7
7 changed files with 8 additions and 8 deletions

View File

@ -78,7 +78,7 @@ namespace std {
static const bool has_infinity=true; static const bool has_infinity=true;
static double infinity() throw() {return (std::numeric_limits<double>::max)();} static double infinity() throw() {return (std::numeric_limits<double>::max)();}
}; };
}; }
CGAL_BEGIN_NAMESPACE CGAL_BEGIN_NAMESPACE

View File

@ -54,7 +54,7 @@ class Monic_Sturm_sequence
// NOT WORK CORRECTLY IF p IS THE ZERO POLYNOMIAL AND q IS NOT // NOT WORK CORRECTLY IF p IS THE ZERO POLYNOMIAL AND q IS NOT
// IN GENERAL I HAVE TO CONSIDER ALL THE LIMITING CASES // IN GENERAL I HAVE TO CONSIDER ALL THE LIMITING CASES
if ( p.degree() >= 0 ) { if ( p.degree() >= 0 ) {
add( p / abs(p[p.degree()]) ); this->add( p / abs(p[p.degree()]) );
this->size_++; this->size_++;
} }

View File

@ -31,7 +31,7 @@ CGAL::Sign sign_above(const typename Kernel::Function &p,
// to make sure this is not called in vain // to make sure this is not called in vain
CGAL_precondition( false ); CGAL_precondition( false );
// to avoid warning // to avoid warning
return 0; return CGAL::ZERO;
} }

View File

@ -49,7 +49,7 @@ class Sturm_sequence
// NOT WORK CORRECTLY IF p IS THE ZERO POLYNOMIAL AND q IS NOT // NOT WORK CORRECTLY IF p IS THE ZERO POLYNOMIAL AND q IS NOT
// IN GENERAL I HAVE TO CONSIDER ALL THE LIMITING CASES // IN GENERAL I HAVE TO CONSIDER ALL THE LIMITING CASES
if ( p.degree() >= 0 ) { if ( p.degree() >= 0 ) {
add( p ); this->add( p );
this->size_++; this->size_++;
} }

View File

@ -23,7 +23,7 @@
#include <CGAL/Polynomial/basic.h> #include <CGAL/Polynomial/basic.h>
#include <CGAL/Real_embeddable_traits.h> #include <CGAL/Real_embeddable_traits.h>
#include <vector> #include <vector>
CGAL_POLYNOMIAL_BEGIN_INTERNAL_NAMESPACE; CGAL_POLYNOMIAL_BEGIN_INTERNAL_NAMESPACE
//! A root represented as a bounding interval and a polynomial. //! A root represented as a bounding interval and a polynomial.
/*! /*!
@ -737,5 +737,5 @@ namespace std
static const bool tinyness_before =false; static const bool tinyness_before =false;
static const float_round_style round_stype = round_toward_zero; static const float_round_style round_stype = round_toward_zero;
}; };
}; }
#endif #endif

View File

@ -48,7 +48,7 @@ public:
} }
CGAL_assertion(lb() <= ub()); CGAL_assertion(lb() <= ub());
} }
bool is_valid() { bool is_valid() const {
return b_.first <= b_.second; return b_.first <= b_.second;
} }

View File

@ -160,7 +160,7 @@ namespace std {
static T max BOOST_PREVENT_MACRO_SUBSTITUTION () throw() {return T((P::max)());} static T max BOOST_PREVENT_MACRO_SUBSTITUTION () throw() {return T((P::max)());}
static T infinity() throw() {return P::infinity();} static T infinity() throw() {return P::infinity();}
}; };
}; }
int main(int argc, char* argv[]) int main(int argc, char* argv[])