cgal/Kinetic_data_structures/include/CGAL/Polynomial/internal/Rational
Laurent Rineau 9c3701e4fc Use boost::iterator_facade. Without it, it is very difficult to write
iterators that real are models of the iterator concepts.
2010-11-29 12:33:20 +00:00
..
Are_negations.h
Bezier_root_counter.h
Compare_isolated_roots_in_interval.h
Construct_function.h
Derivative.h Use boost::iterator_facade. Without it, it is very difficult to write 2010-11-29 12:33:20 +00:00
Descartes_has_root.h
Descartes_root_counter.h
Euclidean_Sturm_sequence.h
Evaluate_polynomial.h
Invert_variable.h
Map_rational_interval_to_positive.h
Monic_Sturm_sequence.h
Negate_variable.h
Primitive_part_Sturm_sequence.h
Pseudo_quotient.h
Pseudo_remainder.h
Quotient.h
Quotient_remainder.h
Rational_multiplicity.h
Rational_traits_base.h
Rational_translate_zero.h
Reduced_Sturm_sequence.h
Remainder.h
Root_bound_evaluator.h
Shift_power.h
Sign_Sturm_sequence.h
Sign_above_rational.h Removed default constructor as there exists a constructor with one argument having a default value 2010-08-05 06:41:44 +00:00
Sign_at_rational.h
Sign_below_rational.h Removed default constructor as there exists a constructor with one argument having a default value 2010-08-05 06:41:44 +00:00
Standard_sequence.h
Sturm_root_counter.h
Sturm_sequence.h
Sturm_sequence_base.h
Subresultant_Sturm_sequence.h