CGAL 4.4 - Polynomial
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
PolynomialTraits_d::MakeSquareFree Concept Reference

Definition

This AdaptableUnaryFunction computes the square-free part of a polynomial of type PolynomialTraits_d::Polynomial_d up to a constant factor.

A polynomial p can be factored into square-free and pairwise coprime non-constant factors gi with multiplicities mi and a constant factor a, such that p=agm11...gmnn, where all gi are canonicalized.

Given this decomposition, the square free part is defined as the product g1...gn, which is computed by this functor.

Refines:

AdaptableUnaryFunction

CopyConstructible

DefaultConstructible

See Also
Polynomial_d
PolynomialTraits_d
PolynomialTraits_d::Canonicalize
PolynomialTraits_d::SquareFreeFactorize
PolynomialTraits_d::IsSquareFree

Types

typedef
PolynomialTraits_d::Polynomial_d 
result_type
 
typedef
PolynomialTraits_d::Polynomial_d 
argument_type
 

Operations

result_type operator() (argument_type p)
 Returns the square-free part of p.