Namespaces
	cpp11

Classes
class	Compact_container_base

class	Compact_container

class	Compact_container_traits

class	Compact

class	Fast

class	Default

class	Fourtuple

class	Cast_function_object

class	Compare_to_less

class	Creator_1

class	Creator_2

class	Creator_3

class	Creator_4

class	Creator_5

class	Creator_uniform_2

class	Creator_uniform_3

class	Creator_uniform_4

class	Creator_uniform_5

class	Creator_uniform_6

class	Creator_uniform_7

class	Creator_uniform_8

class	Creator_uniform_9

class	Creator_uniform_d

class	Dereference

class	Get_address

class	Identity

class	Project_facet

class	Project_next

class	Project_next_opposite

class	Project_normal

class	Project_opposite_prev

class	Project_plane

class	Project_point

class	Project_prev

class	Project_vertex

class	In_place_list_base

class	In_place_list

class	Const_oneset_iterator

class	Counting_iterator

class	Dispatch_or_drop_output_iterator

class	Dispatch_output_iterator

class	Emptyset_iterator

class	Filter_iterator

class	Insert_iterator

class	Inverse_index

class	Join_input_iterator_1

class	Join_input_iterator_2

class	Join_input_iterator_3

class	N_step_adaptor

class	Oneset_iterator

class	Random_access_adaptor

class	Random_access_value_adaptor

class	Location_policy

class	Multiset

class	Object

class	Sixtuple

class	Boolean_tag

struct	Null_functor

struct	Sequential_tag

struct	Parallel_tag

class	Null_tag

class	Threetuple

class	Twotuple

class	Uncertain

class	Quadruple

class	Triple

class	Protect_FPU_rounding

class	Set_ieee_double_precision

class	Gmpfi

class	Gmpfr

class	Gmpq

class	Gmpz

class	Gmpzf

class	Interval_nt

class	Lazy_exact_nt

class	MP_Float

class	NT_converter

class	Number_type_checker

class	Quotient

class	Rational_traits

class	Root_of_traits

class	Sqrt_extension

class	Is_valid

class	Max

class	Min

class	Algebraic_structure_traits
	An instance of `Algebraic_structure_traits` is a model of `AlgebraicStructureTraits`, where T is the associated type. More...

class	Euclidean_ring_tag
	Tag indicating that a type is a model of the `EuclideanRing` concept. More...

class	Field_tag
	Tag indicating that a type is a model of the `Field` concept. More...

class	Field_with_kth_root_tag
	Tag indicating that a type is a model of the `FieldWithKthRoot` concept. More...

class	Field_with_root_of_tag
	Tag indicating that a type is a model of the `FieldWithRootOf` concept. More...

class	Field_with_sqrt_tag
	Tag indicating that a type is a model of the `FieldWithSqrt` concept. More...

class	Integral_domain_tag
	Tag indicating that a type is a model of the `IntegralDomain` concept. More...

class	Integral_domain_without_division_tag
	Tag indicating that a type is a model of the `IntegralDomainWithoutDivision` concept. More...

class	Unique_factorization_domain_tag
	Tag indicating that a type is a model of the `UniqueFactorizationDomain` concept. More...

class	Coercion_traits
	An instance of `Coercion_traits` reflects the type coercion of the types A and B, it is symmetric in the two template arguments. More...

class	Fraction_traits
	An instance of `Fraction_traits` is a model of `FractionTraits`, where `T` is the associated type. More...

class	Real_embeddable_traits
	An instance of `Real_embeddable_traits` is a model of `RealEmbeddableTraits`, where T is the associated type. More...

Typedefs
typedef Interval_nt< false >	Interval_nt_advanced

Functions
NT	abs (const NT &x)
	The template function `abs()` returns the absolute value of a number. More...

result_type	compare (const NT &x, const NT &y)
	The template function `compare()` compares the first argument with respect to the second, i.e. it returns `CGAL::LARGER` if \( x\) is larger then \( y\). More...

result_type	div (const NT1 &x, const NT2 &y)
	The function `div()` computes the integral quotient of division with remainder. More...

void	div_mod (const NT1 &x, const NT2 &y, result_type &q, result_type &r)
	computes the quotient \( q\) and remainder \( r\), such that \( x = q*y + r\) and \( r\) minimal with respect to the Euclidean Norm of the `result_type`. More...

result_type	gcd (const NT1 &x, const NT2 &y)
	The function `gcd()` computes the greatest common divisor of two values. More...

result_type	integral_division (const NT1 &x, const NT2 &y)
	The function `integral_division()` (a.k.a. exact division or division without remainder) maps ring elements \( (x,y)\) to ring element \( z\) such that \( x = yz\) if such a \( z\) exists (i.e. if \( x\) is divisible by \( y\)). More...

NT	inverse (const NT &x)
	The function `inverse()` returns the inverse element with respect to multiplication. More...

result_type	is_negative (const NT &x)
	The template function `is_negative()` determines if a value is negative or not. More...

result_type	is_one (const NT &x)
	The function `is_one()` determines if a value is equal to 1 or not. More...

result_type	is_positive (const NT &x)
	The template function `is_positive()` determines if a value is positive or not. More...

result_type	is_square (const NT &x)
	An ring element \( x\) is said to be a square iff there exists a ring element \( y\) such that \( x= y*y\). More...

result_type	is_square (const NT &x, NT &y)
	An ring element \( x\) is said to be a square iff there exists a ring element \( y\) such that \( x= y*y\). More...

result_type	is_zero (const NT &x)
	The function `is_zero()` determines if a value is equal to 0 or not. More...

NT	kth_root (int k, const NT &x)
	The function `kth_root()` returns the k-th root of a value. More...

result_type	mod (const NT1 &x, const NT2 &y)
	The function `mod()` computes the remainder of division with remainder. More...

NT	root_of (int k, InputIterator begin, InputIterator end)
	returns the k-th real root of the univariate polynomial, which is defined by the iterator range, where begin refers to the constant term. More...

result_type	sign (const NT &x)
	The template function `sign()` returns the sign of its argument. More...

void	simplify (const NT &x)
	The function `simplify()` may simplify a given object. More...

NT	sqrt (const NT &x)
	The function `sqrt()` returns the square root of a value. More...

NT	square (const NT &x)
	The function `square()` returns the square of a number. More...

double	to_double (const NT &x)
	The template function `to_double()` returns an double approximation of a number. More...

std::pair< double, double >	to_interval (const NT &x)
	The template function `to_interval()` computes for a given real embeddable number \( x\) a double interval containing \( x\). More...

NT	unit_part (const NT &x)
	The function `unit_part()` computes the unit part of a given ring element. More...

void	Assert_circulator (const C &c)

void	Assert_iterator (const I &i)

void	Assert_circulator_or_iterator (const IC &i)

void	Assert_input_category (const I &i)

void	Assert_output_category (const I &i)

void	Assert_forward_category (const IC &ic)

void	Assert_bidirectional_category (const IC &ic)

void	Assert_random_access_category (const IC &ic)

C::difference_type	circulator_distance (C c, C d)

C::size_type	circulator_size (C c)

bool	is_empty_range (const IC &i, const IC &j)

iterator_traits< IC > ::difference_type	iterator_distance (IC ic1, IC ic2)

Iterator_tag	query_circulator_or_iterator (const I &i)

Circulator_tag	query_circulator_or_iterator (const C &c)

Mode	get_mode (std::ios &s)

Mode	set_ascii_mode (std::ios &s)

Mode	set_binary_mode (std::ios &s)

Mode	set_mode (std::ios &s, IO::Mode m)

Mode	set_pretty_mode (std::ios &s)

bool	is_ascii (std::ios &s)

bool	is_binary (std::ios &s)

bool	is_pretty (std::ios &s)

Output_rep< T >	oformat (const T &t)

Input_rep< T >	iformat (const T &t)

Output_rep< T, F >	oformat (const T &t, F)

ostream &	operator<< (ostream &os, Class c)

istream &	operator>> (istream &is, Class c)

bool	has_in_x_range (const Circular_arc_2< CircularKernel > &ca, const Circular_arc_point_2< CircularKernel > &p)

bool	has_in_x_range (const Line_arc_2< CircularKernel > &ca, const Circular_arc_point_2< CircularKernel > &p)

bool	has_on (const Circle_2< CircularKernel > &c, const Circular_arc_point_2< CircularKernel > &p)

OutputIterator	make_x_monotone (const Circular_arc_2< CircularKernel > &ca, OutputIterator res)

OutputIterator	make_xy_monotone (const Circular_arc_2< CircularKernel > &ca, OutputIterator res)

Circular_arc_point_2 < CircularKernel >	x_extremal_point (const Circle_2< CircularKernel > &c, bool b)

OutputIterator	x_extremal_points (const Circle_2< CircularKernel > &c, OutputIterator res)

Circular_arc_point_2 < CircularKernel >	y_extremal_point (const Circle_2< CircularKernel > &c, bool b)

OutputIterator	y_extremal_points (const Circle_2< CircularKernel > &c, OutputIterator res)

CGAL::Comparison_result	compare_y_to_right (const Circular_arc_2< CircularKernel > &ca1, const Circular_arc_2< CircularKernel > &ca2, Circular_arc_point_2< CircularKernel > &p)

bool	is_finite (double x)

bool	is_finite (float x)

bool	is_finite (long double x)

OutputIterator	compute_roots_of_2 (const RT &a, const RT &b, const RT &c, OutputIterator oit)

Root_of_traits< RT >::Root_of_2	make_root_of_2 (const RT &a, const RT &b, const RT &c, bool s)

Root_of_traits< RT >::Root_of_2	make_root_of_2 (RT alpha, RT beta, RT gamma)

Root_of_traits< RT >::Root_of_2	make_sqrt (const RT &x)

Rational	simplest_rational_in_interval (double d1, double d2)

Rational	to_rational (double d)

bool	is_valid (const T &x)

T	max (const T &x, const T &y)

T	min (const T &x, const T &y)

Namespaces

Classes

Typedefs

Functions