songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

-Wall -pedantic -Wno-long-long -Wstrict-overflow=0

This commit is contained in:
Michael Hemmer 2010-04-21 16:20:47 +00:00
parent d2572ea9e5
commit 028e6132d9
6 changed files with 15 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
Algebraic_foundations/include/CGAL/Chinese_remainder_traits.h
View File

@ -57,10 +57,11 @@ public:
struct Chinese_remainder{
void operator() (
const Scalar_type& m1, const Scalar_type& m2, const Scalar_type& m,
const Scalar_type& s, const Scalar_type& t,
const Scalar_type& s, const Scalar_type& CGAL_precondition_code(t),
NT u1, NT u2,
NT& u) const {
#ifndef NDEBUG
#ifndef CGAL_NDEBUG
NT tmp,s_,t_;
tmp = CGAL::extended_euclidean_algorithm(m1,m2,s_,t_);
CGAL_precondition(tmp == NT(1));

2
Polynomial/include/CGAL/Polynomial/Algebraic_structure_traits.h
View File

@ -213,7 +213,7 @@ class Polynomial_algebraic_structure_traits_base< POLY, Unique_factorization_dom
typedef typename Polynomial_traits_d<POLY>::Multivariate_content Mcontent;
typedef typename Mcontent::result_type ICoeff;
ICoeff gcd_help(const ICoeff& x, const ICoeff& y, Field_tag) const {
ICoeff gcd_help(const ICoeff& , const ICoeff& , Field_tag) const {
return ICoeff(1);
}
ICoeff gcd_help(const ICoeff& x, const ICoeff& y,

4
Polynomial/include/CGAL/Polynomial/modular_filter.h
View File

@ -86,8 +86,8 @@ namespace internal {
}
template <class NT> inline
bool may_have_common_factor_(const Polynomial<NT>& p1,
const Polynomial<NT>& p2,
bool may_have_common_factor_(const Polynomial<NT>& ,
const Polynomial<NT>& ,
::CGAL::Tag_false) {return true;}
/*! \ingroup CGAL_polynomial_utils

2
Polynomial/include/CGAL/Polynomial/subresultants.h
View File

@ -549,7 +549,7 @@ CGAL_BEGIN_NAMESPACE
}
int i = p+1;
int j = p;
int k;
int k = 0;
while(!CGAL::is_zero(sResP[j-1])) {
k=degree(sResP[j-1]);
if(k>=j-1) {

14
Polynomial/include/CGAL/Polynomial_traits_d.h
View File

@ -366,12 +366,10 @@ public:
return Exponent_vector();
}
};
struct Get_innermost_coefficient
: public std::binary_function< ICoeff, Polynomial_d, Exponent_vector > {
ICoeff operator()( const Polynomial_d& p, Exponent_vector ev ) {
CGAL_precondition( ev.empty() );
ICoeff operator()( const Polynomial_d& p, Exponent_vector ) {
return p;
}
};
@ -387,14 +385,14 @@ public:
Innermost_coefficient_type>::Type
operator()(
const Innermost_coefficient_type& p,
Input_iterator begin,
Input_iterator end) const {
Input_iterator CGAL_precondition_code(begin),
Input_iterator CGAL_precondition_code(end) ) const {
CGAL_precondition(end == begin);
typedef typename std::iterator_traits<Input_iterator>::value_type
value_type;
typedef CGAL::Coercion_traits<Innermost_coefficient_type,value_type> CT;
return typename CT::Cast()(p);
}
}
};
struct Substitute_homogeneous{
@ -410,7 +408,7 @@ public:
operator()(
const Innermost_coefficient_type& p,
Input_iterator begin,
Input_iterator end,
Input_iterator CGAL_precondition_code(end),
int hdegree) const {
typedef typename std::iterator_traits<Input_iterator>::value_type

4
Polynomial/test/Polynomial/Coercion_traits.cpp
View File

@ -13,7 +13,7 @@
template<class A, class B> void test_coercion_from_to(A, B){
CGAL::test_explicit_interoperable<A,B,B>();
};
}
template <typename AK>
void test_coercion_traits(){
@ -163,4 +163,4 @@ int main(){
test_coercion_traits<AK>();
#endif
return 0;
};
}