SPAR/AIModule/BWTA/vendors/CGAL/CGAL/Polynomial/polynomial_gcd.h File Reference

Greatest common divisors and related operations on polynomials. More...

#include <CGAL/basic.h>
#include <CGAL/Residue.h>
#include <CGAL/Polynomial.h>
#include <CGAL/Scalar_factor_traits.h>
#include <CGAL/Real_timer.h>
#include <CGAL/Polynomial/Polynomial_type.h>
#include <CGAL/Polynomial/misc.h>
#include <CGAL/Polynomial/polynomial_gcd_implementations.h>
#include <CGAL/polynomial_utils.h>
#include <CGAL/Polynomial/modular_gcd.h>

Include dependency graph for polynomial_gcd.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces
namespace	CGAL
namespace	CGAL::CGALi
Defines
#define	CGAL_USE_INTERNAL_MODULAR_GCD   1
Functions
template<class NT >
Polynomial< NT >	CGAL::CGALi::gcd_ (const Polynomial< NT > &, const Polynomial< NT > &, Field_tag)
template<class NT >
Polynomial< NT >	CGAL::CGALi::gcd_ (const Polynomial< NT > &, const Polynomial< NT > &, Unique_factorization_domain_tag)
template<class NT >
Polynomial< NT >	CGAL::CGALi::gcd_utcf_ (const Polynomial< NT > &, const Polynomial< NT > &)
template<class NT >
Polynomial< NT >	CGAL::CGALi::gcd_utcf_is_fraction_ (const Polynomial< NT > &, const Polynomial< NT > &,::CGAL::Tag_true)
template<class NT >
Polynomial< NT >	CGAL::CGALi::gcd_utcf_is_fraction_ (const Polynomial< NT > &, const Polynomial< NT > &,::CGAL::Tag_false)
template<class NT >
Polynomial< NT >	CGAL::CGALi::gcd_utcf_modularizable_algebra_ (const Polynomial< NT > &, const Polynomial< NT > &,::CGAL::Tag_false, Integral_domain_tag)
template<class NT >
Polynomial< NT >	CGAL::CGALi::gcd_utcf_modularizable_algebra_ (const Polynomial< NT > &, const Polynomial< NT > &,::CGAL::Tag_false, Unique_factorization_domain_tag)
template<class NT >
Polynomial< NT >	CGAL::CGALi::gcd_utcf_modularizable_algebra_ (const Polynomial< NT > &, const Polynomial< NT > &,::CGAL::Tag_false, Field_tag)
template<class NT >
Polynomial< NT >	CGAL::CGALi::gcd_utcf_modularizable_algebra_ (const Polynomial< NT > &, const Polynomial< NT > &,::CGAL::Tag_true, Integral_domain_tag)
template<class NT >
Polynomial< NT >	CGAL::CGALi::gcd_utcf_modularizable_algebra_ (const Polynomial< NT > &, const Polynomial< NT > &,::CGAL::Tag_true, Unique_factorization_domain_tag)
template<class NT >
Polynomial< NT >	CGAL::CGALi::gcd_utcf_modularizable_algebra_ (const Polynomial< NT > &, const Polynomial< NT > &,::CGAL::Tag_true, Field_tag)
template<class NT >
Polynomial< NT >	CGAL::CGALi::gcd_utcf_modularizable_algebra_ (const Polynomial< NT > &p1, const Polynomial< NT > &p2,::CGAL::Tag_false, Euclidean_ring_tag)
template<class NT >
Polynomial< NT >	CGAL::CGALi::gcd_utcf_modularizable_algebra_ (const Polynomial< NT > &p1, const Polynomial< NT > &p2,::CGAL::Tag_true, Euclidean_ring_tag)
template<class NT >
Polynomial< NT >	CGAL::CGALi::gcd_utcf (const Polynomial< NT > &, const Polynomial< NT > &)
template<class NT >
Polynomial< NT >	CGAL::CGALi::gcdex_ (Polynomial< NT > x, Polynomial< NT > y, Polynomial< NT > &xf, Polynomial< NT > &yf,::CGAL::Tag_false)
template<class NT >
Polynomial< NT >	CGAL::CGALi::gcdex_ (Polynomial< NT > x, Polynomial< NT > y, Polynomial< NT > &xf, Polynomial< NT > &yf, Field_tag)
template<class NT >
Polynomial< NT >	CGAL::CGALi::gcdex_ (Polynomial< NT > x, Polynomial< NT > y, Polynomial< NT > &xf, Polynomial< NT > &yf,::CGAL::Tag_true)

---

Detailed Description

Greatest common divisors and related operations on polynomials.

---

Define Documentation

#define CGAL_USE_INTERNAL_MODULAR_GCD   1