|
CGAL 4.3 - Polynomial
|
|
CGAL 4.3 - Polynomial
|
Functions | |
| Polynomial_traits_d < Polynomial_d > ::Canonicalize::result_type | CGAL::canonicalize (const Polynomial_d &p) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Compare::result_type | CGAL::compare (const Polynomial_d &p, const Polynomial_d &q) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Degree::result_type | CGAL::degree (const Polynomial_d &p, int i, index=Polynomial_traits_d< Polynomial_d >::d-1) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Degree_vector::result_type | CGAL::degree_vector (const Polynomial_d &p) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Differentiate::result_type | CGAL::differentiate (const Polynomial_d &p, index=Polynomial_traits_d< Polynomial_d >::d-1) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Evaluate_homogeneous::result_type | CGAL::evaluate_homogeneous (const Polynomial_d &p, Polynomial_traits_d< Polynomial_d >::Coefficient_type u, Polynomial_traits_d< Polynomial_d >::Coefficient_type v) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Evaluate::result_type | CGAL::evaluate (const Polynomial_d &p, Polynomial_traits_d< Polynomial_d >::Coefficient_type x) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Gcd_up_to_constant_factor::result_type | CGAL::gcd_up_to_constant_factor (const Polynomial_d &p, const Polynomial_d &q) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::get_coefficient::result_type | CGAL::get_coefficient (const Polynomial_d &p, int i) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::get_innermost_coefficient::result_type | CGAL::get_innermost_coefficient (const Polynomial_d &p, Exponent_vector ev) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Innermost_leading_coefficient::result_type | CGAL::innermost_leading_coefficient (const Polynomial_d &p) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Integral_division_up_to_constant_factor::result_type | CGAL::integral_division_up_to_constant_factor (const Polynomial_d &p, const Polynomial_d &q) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Invert::result_type | CGAL::invert (const Polynomial_d &p, int index=Polynomial_traits_d< Polynomial_d >::d-1) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Is_square_free::result_type | CGAL::is_square_free (const Polynomial_d &p) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Is_zero_at_homogeneous::result_type | CGAL::is_zero_at_homogeneous (const Polynomial_d &p, InputIterator begin, InputIterator end) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Is_zero_at::result_type | CGAL::is_zero_at (const Polynomial_d &p, InputIterator begin, InputIterator end) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Leading_coefficient::result_type | CGAL::leading_coefficient (const Polynomial_d &p) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Make_square_free::result_type | CGAL::make_square_free (const Polynomial_d &p) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Move::result_type | CGAL::move (const Polynomial_d &p, int i, int j) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Multivariate_content::result_type | CGAL::multivariate_content (const Polynomial_d &p) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Negate::result_type | CGAL::negate (const Polynomial_d &p, int index=Polynomial_traits_d< Polynomial_d >::d-1) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| int | CGAL::number_of_real_roots (Polynomial_d f) |
| computes the number of distinct real roots of \(f\). More... | |
| int | CGAL::number_of_real_roots (InputIterator start, InputIterator end) |
| computes the number of distinct real roots of \( f\) whose principal Sturm-Habicht coefficients are passed by the iterator range. More... | |
| Polynomial_traits_d < Polynomial_d > ::Permute::result_type | CGAL::permute (const Polynomial_d &p, InputIterator begin, InputIterator end) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| OutputIterator | CGAL::polynomial_subresultants (Polynomial_d p, Polynomial_d q, OutputIterator out) |
| computes the polynomial subresultants of \( p\) and \( q\), with respect to the outermost variable. More... | |
| OutputIterator1 | CGAL::polynomial_subresultants_with_cofactors (Polynomial_d p, Polynomial_d q, OutputIterator1 sres_out, OutputIterator2 coP_out, OutputIterator3 coQ_out) |
computes the polynomial subresultants of \( p\) and \( q\), sres_out, with respect to the outermost variable, and the cofactors for \( P\), coP_out and \( Q\), coQ_out. More... | |
| OutputIterator | CGAL::principal_sturm_habicht_sequence (typename Polynomial_d f, OutputIterator out) |
| computes the principal Sturm-Habicht coefficients of \( f\) with respect to the outermost variable. More... | |
| OutputIterator | CGAL::principal_subresultants (Polynomial_d p, Polynomial_d q, OutputIterator out) |
| computes the principal subresultants of \( p\) and \( q\), with respect to the outermost variable. More... | |
| void | CGAL::pseudo_division (const Polynomial_d &f, const Polynomial_d &g, Polynomial_d &q, Polynomial_d &r, Polynomial_traits_d< Polynomial_d >::Coefficient_type &D) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Pseudo_division_quotient::result_type | CGAL::pseudo_division_quotient (const Polynomial_d &p, const Polynomial_d &q) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Pseudo_division_remainder::result_type | CGAL::pseudo_division_remainder (const Polynomial_d &p, const Polynomial_d &q) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Resultant::result_type | CGAL::resultant (const Polynomial_d &p, const Polynomial_d &q) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Scale_homogeneous::result_type | CGAL::scale_homogeneous (const Polynomial_d &p, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &u, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &v, int index=Polynomial_traits_d< Polynomial_d >::d-1) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Scale::result_type | CGAL::scale (const Polynomial_d &p, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &a, int index=Polynomial_traits_d< Polynomial_d >::d-1) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Shift::result_type | CGAL::shift (const Polynomial_d &p, int i, int index=Polynomial_traits_d< Polynomial_d >::d-1) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Sign_at_homogeneous::result_type | CGAL::sign_at_homogeneous (const Polynomial_d &p, InputIterator begin, InputIterator end) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Sign_at::result_type | CGAL::sign_at (const Polynomial_d &p, InputIterator begin, InputIterator end) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| OutputIterator | CGAL::square_free_factorize (const Polynomial_d &p, OutputIterator it, Polynomial_traits_d< Polynomial >::Innermost_coefficient &a) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| OutputIterator | CGAL::square_free_factorize (const Polynomial_d &p, OutputIterator it) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| OutputIterator | CGAL::square_free_factorize_up_to_constant_factor (const Polynomial_d &p, OutputIterator it) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| OutputIterator | CGAL::sturm_habicht_sequence (Polynomial_d f, OutputIterator out) |
| computes the Sturm-Habicht-sequence of \( f\) with respect to the outermost variable. More... | |
| OutputIterator1 | CGAL::sturm_habicht_sequence_with_cofactors (Polynomial_d f, OutputIterator1 stha_out, OutputIterator2 cof_out, OutputIterator3 cofx_out) |
computes the Sturm-Habicht sequence of \( f\) stha_out, with respect to the outermost variable, and the cofactors for \( f\), cof_out and \( f'\), cofx_out. More... | |
| CGAL::Coercion_traits < Polynomial_traits_d < Polynomial_d > ::Innermost_coefficient, std::iterator_traits < Input_iterator >::value_type > ::Type | CGAL::substitute_homogeneous (const Polynomial_d &p, InputIterator begin, InputIterator end) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| CGAL::Coercion_traits < Polynomial_traits_d < Polynomial_d > ::Innermost_coefficient, std::iterator_traits < Input_iterator >::value_type > ::Type | CGAL::substitute (const Polynomial_d &p, InputIterator begin, InputIterator end) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Swap::result_type | CGAL::swap (const Polynomial_d &p, int i, int j) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Total_degree::result_type | CGAL::total_degree (const Polynomial_d &p) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Translate_homogeneous::result_type | CGAL::translate_homogeneous (const Polynomial_d &p, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &u, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &v, int index=Polynomial_traits_d< Polynomial_d >::d-1) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Translate::result_type | CGAL::translate (const Polynomial_d &p, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &a, int index=Polynomial_traits_d< Polynomial_d >::d-1) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Univariate_content::result_type | CGAL::univariate_content (const Polynomial_d &p) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
| Polynomial_traits_d < Polynomial_d > ::Univariate_content_up_to_constant_factor::result_type | CGAL::univariate_content_up_to_constant_factor (const Polynomial_d &p) |
For a given Polynomial_d, adapts the according functor in Polynomial_traits_d<Polynomial_d>. More... | |
1.8.4