mirror of https://github.com/CGAL/cgal
Polynomial: Add overload which is only documented
This commit is contained in:
parent
94d45552bc
commit
b7d9f95b95
|
|
@ -197,6 +197,14 @@ square_free_factorize(const Polynomial_d& p, OutputIterator oi){
|
||||||
typedef Polynomial_traits_d<Polynomial_d> PT;
|
typedef Polynomial_traits_d<Polynomial_d> PT;
|
||||||
return typename PT::Square_free_factorize()(p,oi);
|
return typename PT::Square_free_factorize()(p,oi);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
template <typename Polynomial_d, typename OutputIterator> inline
|
||||||
|
OutputIterator
|
||||||
|
square_free_factorize(const Polynomial_d& p, OutputIterator oi, const typename Polynomial_traits_d<Polynomial_d>::Innermost_coefficient_type& a){
|
||||||
|
typedef Polynomial_traits_d<Polynomial_d> PT;
|
||||||
|
return typename PT::Square_free_factorize()(p,oi,a);
|
||||||
|
}
|
||||||
|
|
||||||
// MakeSquareFree
|
// MakeSquareFree
|
||||||
CGAL_UNARY_POLY_FUNCTION(Make_square_free, make_square_free)
|
CGAL_UNARY_POLY_FUNCTION(Make_square_free, make_square_free)
|
||||||
// IsSquareFree
|
// IsSquareFree
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue