PolynomialTraits_d::SquareFreeFactorizeUpToConstantFactor

Definition

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 = g1m1 · ... · gnmn, 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.

Refines

Assignable
CopyConstructible
DefaultConstructible

Operations

template<class OutputIterator>
OutputIterator fo ( 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.
Precondition:  std::iterator_traits< OutputIterator >::value_type must be constructible from std::pair<PolynomialTraits_d::Polynomial_d,int>.

See Also

Polynomial_d
PolynomialTraits_d
PolynomialTraits_d::SquareFreeFactorize