CGAL 4.4 - Polynomial
|
This AdaptableFunctor
computes a square-free factorization up to a constant factor (utcf) of a PolynomialTraits_d::Polynomial_d
.
A polynomial p is factored into square-free and pairwise coprime non-constant factors gi with multiplicities mi, such that a⋅p=gm11⋅...⋅gmnn, where a is some constant factor.
The pairs (gi,mi) are written into the given output iterator.
The constant factor a is not computed.
This functor is well defined even though PolynomialTraits_d::Innermost_coefficient_type
may not be a UniqueFactorizationDomain
.
Operations | |
template<class OutputIterator > | |
OutputIterator | operator() (PolynomialTraits_d::Polynomial_d p, OutputIterator it) |
Computes the square-free factorization of p and returns the past-the-end iterator of the written range. More... | |
OutputIterator PolynomialTraits_d::SquareFreeFactorizeUpToConstantFactor::operator() | ( | PolynomialTraits_d::Polynomial_d | p, |
OutputIterator | it | ||
) |
Computes the square-free factorization of p and returns the past-the-end iterator of the written range.
std::iterator_traits< OutputIterator >::value_type
must be constructible from std::pair<PolynomialTraits_d::Polynomial_d,int>
.