SPAR/AIModule/BWTA/vendors/CGAL/CGAL/CORE/Expr.h File Reference

#include <CGAL/CORE/ExprRep.h>
#include <CGAL/CORE/poly/Poly.tcc>

Include dependency graph for Expr.h:

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

Go to the source code of this file.

Classes
class	Expr
	Expr is a class of Expression in Level 3. More...
Defines
#define	CORE_EXPR_ZERO   Expr::getZero()
Typedefs
typedef RCImpl< ExprRep >	RCExpr
Functions
std::ostream &	operator<< (std::ostream &o, const Expr &e)
	I/O Stream operator<<.
std::istream &	operator>> (std::istream &i, Expr &e)
	I/O Stream operator>>
BigInt	floor (const Expr &, Expr &)
	floor function
Expr	pow (const Expr &, unsigned long)
	power function
Expr	operator+ (const Expr &e1, const Expr &e2)
	addition
Expr	operator- (const Expr &e1, const Expr &e2)
	substraction
Expr	operator* (const Expr &e1, const Expr &e2)
	multiplication
Expr	operator/ (const Expr &e1, const Expr &e2)
	division
Expr	operator% (const Expr &e1, const Expr &e2)
	modulo operator
bool	operator== (const Expr &e1, const Expr &e2)
	operator ==
bool	operator!= (const Expr &e1, const Expr &e2)
	operator !=
bool	operator< (const Expr &e1, const Expr &e2)
	operator <
bool	operator<= (const Expr &e1, const Expr &e2)
	operator <=
bool	operator> (const Expr &e1, const Expr &e2)
	operator <
bool	operator>= (const Expr &e1, const Expr &e2)
	operator >=
int	sign (const Expr &e)
	return sign
bool	isZero (const Expr &e)
	is zero?
int	cmp (const Expr &e1, const Expr &e2)
	compare
Expr	abs (const Expr &x)
	absolute value
Expr	fabs (const Expr &x)
	absolute value (same as abs)
BigInt	floor (const Expr &e)
	floor
BigInt	ceil (const Expr &e)
	ceiling
long	floorLg (const Expr &e)
	floorLg
long	ceilLg (const Expr &e)
	ceilLg
Expr	power (const Expr &e, unsigned long p)
	power
bool	isDivisible (const Expr &e1, const Expr &e2)
	divisibility predicate
Expr	sqrt (const Expr &e)
	square root
Expr	gcd (const Expr &, const Expr &)
	gcd
Expr	div_exact (const Expr &x, const Expr &y)
template<class NT >
Expr	rootOf (const Polynomial< NT > &p, int n=0)
	helper function for constructing Polynomial node (n-th node)
template<class NT >
Expr	rootOf (const Polynomial< NT > &p, const BFInterval &I)
	helper function for constructing Polynomial node witb BFInterval
template<class NT >
Expr	rootOf (const Polynomial< NT > &p, const BigFloat &x, const BigFloat &y)
	helper function for constructing Polynomial node with pair of BigFloats
template<class NT >
Expr	rootOf (const Polynomial< NT > &p, double x, double y)
	helper function for constructing Polynomial node with pair of doubles
template<class NT >
Expr	rootOf (const Polynomial< NT > &p, int x, int y)
	helper function for constructing Polynomial node with pair of ints
template<class NT >
Expr	radical (const NT &n, int m)
	constructor for Polynomial node of the form x^m - n (i.e., radicals)

---

Define Documentation

#define CORE_EXPR_ZERO   Expr::getZero()

---

Typedef Documentation

typedef RCImpl<ExprRep> RCExpr

---

Function Documentation

Expr abs

(

const Expr &

x

)

[inline]

absolute value

Here is the call graph for this function:

BigInt ceil

(

const Expr &

e

)

[inline]

ceiling

Here is the call graph for this function:

Here is the caller graph for this function:

long ceilLg

(

const Expr &

e

)

[inline]

ceilLg

Here is the call graph for this function:

int cmp	(	const Expr &	e1,
		const Expr &	e2
	)		[inline]

compare

compare two Expr e1 and e2, return

Return values:

-1	if e1 < e2,
0	if e1 = e2,
1	if e1 > e2.

Here is the call graph for this function:

Expr div_exact	(	const Expr &	x,
		const Expr &	y
	)		[inline]

Expr fabs

(

const Expr &

x

)

[inline]

absolute value (same as abs)

Here is the call graph for this function:

Here is the caller graph for this function:

BigInt floor	(	const Expr &	,
		Expr &
	)

floor function

Here is the caller graph for this function:

BigInt floor

(

const Expr &

e

)

[inline]

floor

Here is the call graph for this function:

long floorLg

(

const Expr &

e

)

[inline]

floorLg

Here is the call graph for this function:

Expr gcd	(	const Expr &	,
		const Expr &
	)		[inline]

gcd

bool isDivisible	(	const Expr &	e1,
		const Expr &	e2
	)		[inline]

divisibility predicate

We do not check if e2 is 0.

Here is the call graph for this function:

bool isZero

(

const Expr &

e

)

[inline]

is zero?

Here is the call graph for this function:

bool operator!=	(	const Expr &	e1,
		const Expr &	e2
	)		[inline]

operator !=

Here is the call graph for this function:

Expr operator%	(	const Expr &	e1,
		const Expr &	e2
	)		[inline]

modulo operator

Here is the call graph for this function:

Expr operator*	(	const Expr &	e1,
		const Expr &	e2
	)		[inline]

multiplication

Here is the call graph for this function:

Expr operator+	(	const Expr &	e1,
		const Expr &	e2
	)		[inline]

addition

Here is the call graph for this function:

Expr operator-	(	const Expr &	e1,
		const Expr &	e2
	)		[inline]

substraction

Here is the call graph for this function:

Expr operator/	(	const Expr &	e1,
		const Expr &	e2
	)		[inline]

division

Here is the call graph for this function:

bool operator<	(	const Expr &	e1,
		const Expr &	e2
	)		[inline]

operator <

Here is the call graph for this function:

std::ostream& operator<<	(	std::ostream &	o,
		const Expr &	e
	)		[inline]

I/O Stream operator<<.

Here is the call graph for this function:

bool operator<=	(	const Expr &	e1,
		const Expr &	e2
	)		[inline]

operator <=

Here is the call graph for this function:

bool operator==	(	const Expr &	e1,
		const Expr &	e2
	)		[inline]

operator ==

this is inefficient if you compare to zero: e.g., if (e != 0) {...} use e.isZero() instead

Here is the call graph for this function:

bool operator>	(	const Expr &	e1,
		const Expr &	e2
	)		[inline]

operator <

Here is the call graph for this function:

bool operator>=	(	const Expr &	e1,
		const Expr &	e2
	)		[inline]

operator >=

Here is the call graph for this function:

std::istream& operator>>	(	std::istream &	i,
		Expr &	e
	)		[inline]

I/O Stream operator>>

Expr pow	(	const Expr &	,
		unsigned	long
	)

power function

Expr power	(	const Expr &	e,
		unsigned long	p
	)		[inline]

power

Here is the call graph for this function:

template<class NT >

Expr radical	(	const NT &	n,
		int	m
	)		[inline]

constructor for Polynomial node of the form x^m - n (i.e., radicals)

We assume that n >= 0 and m >= 1

Here is the call graph for this function:

Here is the caller graph for this function:

template<class NT >

Expr rootOf	(	const Polynomial< NT > &	p,
		int	n = 0
	)		[inline]

helper function for constructing Polynomial node (n-th node)

Here is the caller graph for this function:

template<class NT >

Expr rootOf	(	const Polynomial< NT > &	p,
		const BFInterval &	I
	)		[inline]

helper function for constructing Polynomial node witb BFInterval

template<class NT >

Expr rootOf	(	const Polynomial< NT > &	p,
		const BigFloat &	x,
		const BigFloat &	y
	)		[inline]

helper function for constructing Polynomial node with pair of BigFloats

template<class NT >

Expr rootOf	(	const Polynomial< NT > &	p,
		double	x,
		double	y
	)		[inline]

helper function for constructing Polynomial node with pair of doubles

template<class NT >

Expr rootOf	(	const Polynomial< NT > &	p,
		int	x,
		int	y
	)		[inline]

helper function for constructing Polynomial node with pair of ints

int sign

(

const Expr &

e

)

[inline]

return sign

Here is the call graph for this function:

Expr sqrt

(

const Expr &

e

)

[inline]

square root

Here is the call graph for this function: