IntNumTheoDom< RandIter > Class Template Reference

#include <givintnumtheo.h>

Inheritance diagram for IntNumTheoDom< RandIter >:

Public Types
typedef IntFactorDom< RandIter >	Father_t
typedef IntFactorDom< RandIter > ::Rep	Rep
typedef RandIter	random_generator
typedef Rep	Element
Public Member Functions
	IntNumTheoDom (RandIter g=RandIter())
template<template< class, class > class Container, template< class > class Alloc>
Rep &	phi (Rep &res, const Container< Rep, Alloc< Rep > > &Lf, const Rep &n) const
Rep &	phi (Rep &r, const Rep &n) const
Rep &	prim_root (Rep &, const Rep &) const
Rep &	prim_root (Rep &, unsigned long &, const Rep &) const
Rep &	prim_root_of_prime (Rep &, const Rep &) const
template<class Array >
Rep &	prim_root_of_prime (Rep &A, const Array &Lf, const Rep &phin, const Rep &n) const
	Add Jacobi for quadratic nonresidue.
Rep &	probable_prim_root (Rep &, double &, const Rep &n, const unsigned long L=10000000) const
Rep &	probable_prim_root (Rep &, double &, const Rep &n, const double epsilon) const
Rep &	lowest_prim_root (Rep &, const Rep &) const
bool	is_prim_root (const Rep &, const Rep &) const
Rep &	order (Rep &, const Rep &, const Rep &) const
bool	isorder (const Rep &, const Rep &, const Rep &) const
Rep &	prim_inv (Rep &, const Rep &) const
Rep &	prim_elem (Rep &, const Rep &) const
Rep &	lambda_primpow (Rep &, const Rep &, unsigned long) const
Rep &	lambda_inv_primpow (Rep &, const Rep &, unsigned long) const
Rep &	lambda (Rep &, const Rep &) const
Rep &	lambda_inv (Rep &, const Rep &) const
template<template< class, class > class Container, template< class > class Alloc>
short	mobius (const Container< Rep, Alloc< Rep > > &lpow) const
short	mobius (const Rep &a) const
Rep &	factor (Rep &r, const Rep &n, unsigned long loops=0) const
Rep &	iffactorprime (Rep &r, const Rep &n, unsigned long loops=0) const
Rep &	primefactor (Rep &r, const Rep &n) const
template<class Container1 , class Container2 >
bool	set (Container1 &setint, Container2 &setpwd, const Rep &a, unsigned long loops=0) const
	Factors with primes.
template<class Container >
void	set (Container &, const Rep &) const
template<class Container >
void	Erathostene (Container &, const Rep &) const
Rep &	Erathostene (Rep &, const Rep &p) const
	returns a small factor
template<class Container , class Cont2 , class Cont3 >
Container &	divisors (Container &L, const Cont2 &Lf, const Cont3 &Le) const
template<class Container >
Container &	divisors (Container &, const Rep &) const
Rep &	Pollard (const RandIter &, Rep &, const Rep &n, unsigned long threshold=0) const
Rep &	Lenstra (const RandIter &, Rep &, const Rep &n, const Rep &B1=10000000, const unsigned long curves=30) const
std::ostream &	write (std::ostream &o, const Rep &n) const
template<class Array >
std::ostream &	write (std::ostream &o, Array &, const Rep &n) const
std::ostream &	write (std::ostream &o) const
std::ostream &	write (std::ostream &o, const Rep &n) const
int	isprime (const Rep &n, int r=_GIVARO_ISPRIMETESTS_) const
unsigned int	isprimepower (Rep &, const Rep &) const
template<class RandIter >
unsigned int	Miller (RandIter &g, const Rep &n=_GIVARO_ISPRIMETESTS_) const
template<class RandIter >
Rep &	test_Lehmann (RandIter &g, Rep &, const Rep &n=_GIVARO_ISPRIMETESTS_) const
template<class RandIter >
int	Lehmann (RandIter &g, const Rep &n=_GIVARO_ISPRIMETESTS_) const
int	isprime_Tabule (const int n) const
int	isprime_Tabule2 (const int n) const
Rep &	nextprime (Rep &, const Rep &, int r=_GIVARO_ISPRIMETESTS_) const
Rep &	prevprime (Rep &, const Rep &, int r=_GIVARO_ISPRIMETESTS_) const
Rep &	nextprimein (Rep &, int r=_GIVARO_ISPRIMETESTS_) const
Rep &	prevprimein (Rep &, int r=_GIVARO_ISPRIMETESTS_) const
int	local_prime (const Rep &n, int r=_GIVARO_ISPRIMETESTS_) const
int	operator== (const IntegerDom &) const
int	operator!= (const IntegerDom &) const
Rep &	init (Rep &a) const
Rep &	init (Rep &a, const Rep &b) const
Rep &	read (Rep &a, const long i) const
Rep &	read (Rep &a, const unsigned long i) const
Rep &	read (Rep &a, const int i) const
Rep &	read (Rep &a, const unsigned int i) const
std::istream &	read (std::istream &i)
std::istream &	read (std::istream &i, Rep &n) const
Rep &	convert (Rep &a, const Rep &b) const
template<class XXX >
XXX &	convert (XXX &x, const Rep &a) const
Rep &	assign (Rep &a, const Rep &b) const
const Rep &	access (const Rep &a) const
Rep &	mul (Rep &r, const Rep &a, const Rep &b) const
Rep &	div (Rep &r, const Rep &a, const Rep &b) const
Rep &	mod (Rep &r, const Rep &a, const Rep &b) const
Rep &	add (Rep &r, const Rep &a, const Rep &b) const
Rep &	sub (Rep &r, const Rep &a, const Rep &b) const
Rep &	divmod (Rep &q, Rep &r, const Rep &a, const Rep &b) const
Rep &	divexact (Rep &q, const Rep &a, const Rep &b) const
Rep &	mulin (Rep &r, const Rep &a) const
Rep &	divin (Rep &r, const Rep &a) const
Rep &	modin (Rep &r, const Rep &a) const
Rep &	addin (Rep &r, const Rep &a) const
Rep &	subin (Rep &r, const Rep &a) const
Rep &	axpy (Rep &r, const Rep &a, const Rep &b, const Rep &c) const
Rep &	maxpy (Rep &r, const Rep &a, const Rep &b, const Rep &c) const
Rep &	maxpyin (Rep &r, const Rep &a, const Rep &b) const
Rep &	axmy (Rep &r, const Rep &a, const Rep &b, const Rep &c) const
Rep &	axpyin (Rep &r, const Rep &a, const Rep &b) const
Rep &	axmyin (Rep &r, const Rep &a, const Rep &b) const
Rep &	neg (Rep &r, const Rep &a) const
Rep &	negin (Rep &r) const
Rep &	gcd (Rep &g, Rep &u, Rep &v, const Rep &a, const Rep &b) const
Rep &	gcd (Rep &g, const Rep &a, const Rep &b) const
Rep &	lcm (Rep &l, const Rep &a, const Rep &b) const
Rep &	lcmin (Rep &l, const Rep &a) const
Rep &	inv (Rep &u, const Rep &a, const Rep &b) const
Rep &	invin (Rep &u, const Rep &b) const
Rep &	pow (Rep &r, const Rep &n, const long l) const
Rep &	pow (Rep &r, const Rep &n, const unsigned long l) const
Rep &	pow (Rep &r, const Rep &n, const int l) const
Rep &	pow (Rep &r, const Rep &n, const unsigned int l) const
Rep &	sqrt (Rep &s, const Rep &n) const
Rep &	sqrt (Rep &s, Rep &r, const Rep &n) const
long	logp (const Rep &a, const Rep &p) const
Rep &	powmod (Rep &r, const Rep &n, const long e, const Rep &m) const
Rep &	powmod (Rep &r, const Rep &n, const Rep &e, const Rep &m) const
unsigned long	length (const Rep &a) const
int	sign (const Rep &a) const
bool	isZero (const Rep &a) const
bool	isOne (const Rep &a) const
bool	areEqual (const Rep &a, const Rep &b) const
bool	areNEqual (const Rep &a, const Rep &b) const
bool	isgeq (const Rep &a, const Rep &b) const
bool	isgeq (const long b, const Rep &a) const
bool	isgeq (const Rep &a, const long b) const
bool	isleq (const Rep &a, const Rep &b) const
bool	isleq (const long b, const Rep &a) const
bool	isleq (const Rep &a, const long b) const
bool	isgt (const Rep &a, const Rep &b) const
bool	isgt (const long b, const Rep &a) const
bool	isgt (const Rep &a, const long b) const
bool	islt (const Rep &a, const Rep &b) const
bool	islt (const long b, const Rep &a) const
bool	islt (const Rep &a, const long b) const
template<class RandIter >
Rep &	random (RandIter &, Rep &r, long s=1) const
template<class RandIter >
Rep &	random (RandIter &, Rep &r, const Rep &b) const
template<class RandIter >
Rep &	nonzerorandom (RandIter &, Rep &r, long s=1) const
template<class RandIter >
Rep &	nonzerorandom (RandIter &, Rep &r, const Rep &b) const
Data Fields
const Integer	one
const Integer	zero
Protected Attributes
RandIter	_g

---

Detailed Description

template<class RandIter = GivRandom>
class Givaro::IntNumTheoDom< RandIter >

Examples:

examples/Integer/isproot.C, examples/Integer/lambda.C, examples/Integer/lambda_inv.C, examples/Integer/order.C, examples/Integer/phi.C, examples/Integer/primitiveelement.C, examples/Integer/primitiveroot.C, and examples/Integer/probable_primroot.C.

---

Member Typedef Documentation

typedef IntFactorDom<RandIter> Father_t

typedef IntFactorDom<RandIter>::Rep Rep

Reimplemented from IntegerDom.

typedef RandIter random_generator [inherited]

Reimplemented in IntRSADom< RandIter >.

typedef Rep Element [inherited]

Reimplemented in IntRSADom< RandIter >, and Poly1PadicDom< Domain, Dense >.

Examples:

examples/Integer/lambda.C, examples/Integer/lambda_inv.C, examples/Integer/phi.C, examples/Integer/primitiveelement.C, examples/Integer/primitiveroot.C, and examples/Integer/probable_primroot.C.

---

Constructor & Destructor Documentation

IntNumTheoDom

(

RandIter

g = RandIter()

)

[inline]

---

Member Function Documentation

IntNumTheoDom< RandIter >::Rep & phi	(	Rep &	res,
		const Container< Rep, Alloc< Rep > > &	Lf,
		const Rep &	n
	)		const

IntNumTheoDom< RandIter >::Rep & phi	(	Rep &	r,
		const Rep &	n
	)		const

IntNumTheoDom< RandIter >::Rep & prim_root	(	Rep &	A,
		const Rep &	n
	)		const

IntNumTheoDom< RandIter >::Rep & prim_root	(	Rep &	A,
		unsigned long &	runs,
		const Rep &	n
	)		const

IntNumTheoDom< RandIter >::Rep & prim_root_of_prime	(	Rep &	A,
		const Rep &	n
	)		const

IntNumTheoDom< RandIter >::Rep & prim_root_of_prime	(	Rep &	A,
		const Array &	Lf,
		const Rep &	phin,
		const Rep &	n
	)		const

Add Jacobi for quadratic nonresidue.

IntNumTheoDom< RandIter >::Rep & probable_prim_root	(	Rep &	primroot,
		double &	error,
		const Rep &	n,
		const unsigned long	L = 10000000
	)		const

IntNumTheoDom< RandIter >::Rep & probable_prim_root	(	Rep &	primroot,
		double &	error,
		const Rep &	n,
		const double	epsilon
	)		const

IntNumTheoDom< RandIter >::Rep & lowest_prim_root	(	Rep &	A,
		const Rep &	n
	)		const

bool is_prim_root	(	const Rep &	p,
		const Rep &	n
	)		const

IntNumTheoDom< RandIter >::Rep & order	(	Rep &	g,
		const Rep &	p,
		const Rep &	n
	)		const

bool isorder	(	const Rep &	g,
		const Rep &	p,
		const Rep &	n
	)		const

IntNumTheoDom< RandIter >::Rep & prim_inv	(	Rep &	A,
		const Rep &	n
	)		const

IntNumTheoDom< RandIter >::Rep & prim_elem	(	Rep &	A,
		const Rep &	n
	)		const

IntNumTheoDom< RandIter >::Rep & lambda_primpow	(	Rep &	z,
		const Rep &	p,
		unsigned long	e
	)		const

IntNumTheoDom< RandIter >::Rep & lambda_inv_primpow	(	Rep &	z,
		const Rep &	p,
		unsigned long	e
	)		const

IntNumTheoDom< RandIter >::Rep & lambda	(	Rep &	z,
		const Rep &	m
	)		const

IntNumTheoDom< RandIter >::Rep & lambda_inv	(	Rep &	z,
		const Rep &	m
	)		const

short mobius

(

const Container< Rep, Alloc< Rep > > &

lpow

)

const

short mobius

(

const Rep &

a

)

const

Rep& factor	(	Rep &	r,
		const Rep &	n,
		unsigned long	loops = 0
	)		const [inline, inherited]

Rep& iffactorprime	(	Rep &	r,
		const Rep &	n,
		unsigned long	loops = 0
	)		const [inline, inherited]

Rep& primefactor	(	Rep &	r,
		const Rep &	n
	)		const [inline, inherited]

bool set	(	Container1 &	setint,
		Container2 &	setpwd,
		const Rep &	a,
		unsigned long	loops = 0
	)		const [inherited]

Factors with primes.

void set	(	Container &	Lf,
		const Rep &	n
	)		const [inherited]

void Erathostene	(	Container &	Lf,
		const Rep &	p
	)		const [inherited]

Rep& Erathostene	(	Rep &	,
		const Rep &	p
	)		const [inherited]

returns a small factor

Container & divisors	(	Container &	L,
		const Cont2 &	Lf,
		const Cont3 &	Le
	)		const [inherited]

Container & divisors	(	Container &	L,
		const Rep &	n
	)		const [inherited]

IntFactorDom< RandIter >::Rep & Pollard	(	const RandIter &	gen,
		Rep &	g,
		const Rep &	n,
		unsigned long	threshold = 0
	)		const [inherited]

IntFactorDom< RandIter >::Rep & Lenstra	(	const RandIter &	gen,
		Rep &	g,
		const Rep &	n,
		const Rep &	B1 = 10000000,
		const unsigned long	curves = 30
	)		const [inherited]

std::ostream & write	(	std::ostream &	o,
		const Rep &	n
	)		const [inherited]

std::ostream & write	(	std::ostream &	o,
		Array &	Lf,
		const Rep &	n
	)		const [inherited]

std::ostream& write

(

std::ostream &

o

)

const [inline, inherited]

Examples:

examples/Integer/lambda.C, examples/Integer/lambda_inv.C, examples/Integer/phi.C, examples/Integer/primitiveelement.C, and examples/Integer/probable_primroot.C.

std::ostream& write	(	std::ostream &	o,
		const Rep &	n
	)		const [inline, inherited]

int isprime	(	const Rep &	n,
		int	r = _GIVARO_ISPRIMETESTS_
	)		const [inline, inherited]

Examples:

examples/Integer/isprime.C, examples/Integer/nb_primes.C, and examples/Integer/ProbLucas.C.

unsigned int isprimepower	(	Rep &	q,
		const Rep &	u
	)		const [inherited]

Examples:

examples/Integer/ispower.C.

unsigned int Miller	(	RandIter &	g,
		const Rep &	n = _GIVARO_ISPRIMETESTS_
	)		const [inherited]

IntPrimeDom::Rep & test_Lehmann	(	RandIter &	g,
		Rep &	r,
		const Rep &	n = _GIVARO_ISPRIMETESTS_
	)		const [inherited]

int Lehmann	(	RandIter &	g,
		const Rep &	n = _GIVARO_ISPRIMETESTS_
	)		const [inherited]

int isprime_Tabule

(

const int

n

)

const [inherited]

int isprime_Tabule2

(

const int

n

)

const [inherited]

IntPrimeDom::Rep & nextprime	(	Rep &	n,
		const Rep &	p,
		int	r = _GIVARO_ISPRIMETESTS_
	)		const [inherited]

IntPrimeDom::Rep & prevprime	(	Rep &	n,
		const Rep &	p,
		int	r = _GIVARO_ISPRIMETESTS_
	)		const [inherited]

IntPrimeDom::Rep & nextprimein	(	Rep &	n,
		int	r = _GIVARO_ISPRIMETESTS_
	)		const [inherited]

Examples:

examples/Integer/nb_primes.C, examples/Integer/nextprime.C, and examples/Polynomial/PolynomialCRT.C.

IntPrimeDom::Rep & prevprimein	(	Rep &	n,
		int	r = _GIVARO_ISPRIMETESTS_
	)		const [inherited]

Examples:

examples/Integer/prevprime.C.

int local_prime	(	const Rep &	n,
		int	r = _GIVARO_ISPRIMETESTS_
	)		const [inline, inherited]

int operator==

(

const IntegerDom &

)

const [inline, inherited]

int operator!=

(

const IntegerDom &

)

const [inline, inherited]

Rep& init

(

Rep &

a

)

const [inline, inherited]

Rep& init	(	Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

Rep& read	(	Rep &	a,
		const long	i
	)		const [inline, inherited]

Rep& read	(	Rep &	a,
		const unsigned long	i
	)		const [inline, inherited]

Rep& read	(	Rep &	a,
		const int	i
	)		const [inline, inherited]

Rep& read	(	Rep &	a,
		const unsigned int	i
	)		const [inline, inherited]

std::istream& read

(

std::istream &

i

)

[inline, inherited]

std::istream& read	(	std::istream &	i,
		Rep &	n
	)		const [inline, inherited]

Rep& convert	(	Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

XXX& convert	(	XXX &	x,
		const Rep &	a
	)		const [inline, inherited]

Rep& assign	(	Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

const Rep& access

(

const Rep &

a

)

const [inline, inherited]

Rep& mul	(	Rep &	r,
		const Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

Examples:

examples/Integer/ilcm.C.

Rep& div	(	Rep &	r,
		const Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

Rep& mod	(	Rep &	r,
		const Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

Rep& add	(	Rep &	r,
		const Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

Rep& sub	(	Rep &	r,
		const Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

Examples:

examples/Integer/ProbLucas.C.

Rep& divmod	(	Rep &	q,
		Rep &	r,
		const Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

Rep& divexact	(	Rep &	q,
		const Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

Rep& mulin	(	Rep &	r,
		const Rep &	a
	)		const [inline, inherited]

Examples:

examples/Integer/ilcm.C, and examples/Integer/ProbLucas.C.

Rep& divin	(	Rep &	r,
		const Rep &	a
	)		const [inline, inherited]

Examples:

examples/Integer/ilcm.C.

Rep& modin	(	Rep &	r,
		const Rep &	a
	)		const [inline, inherited]

Examples:

examples/Integer/ProbLucas.C.

Rep& addin	(	Rep &	r,
		const Rep &	a
	)		const [inline, inherited]

Examples:

examples/Integer/ProbLucas.C.

Rep& subin	(	Rep &	r,
		const Rep &	a
	)		const [inline, inherited]

Rep& axpy	(	Rep &	r,
		const Rep &	a,
		const Rep &	b,
		const Rep &	c
	)		const [inline, inherited]

Rep& maxpy	(	Rep &	r,
		const Rep &	a,
		const Rep &	b,
		const Rep &	c
	)		const [inline, inherited]

Rep& maxpyin	(	Rep &	r,
		const Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

Rep& axmy	(	Rep &	r,
		const Rep &	a,
		const Rep &	b,
		const Rep &	c
	)		const [inline, inherited]

Rep& axpyin	(	Rep &	r,
		const Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

Rep& axmyin	(	Rep &	r,
		const Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

Rep& neg	(	Rep &	r,
		const Rep &	a
	)		const [inline, inherited]

Rep& negin

(

Rep &

r

)

const [inline, inherited]

Rep& gcd	(	Rep &	g,
		Rep &	u,
		Rep &	v,
		const Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

Examples:

examples/Integer/igcd.C, examples/Integer/igcdext.C, examples/Integer/ilcm.C, and examples/Integer/ProbLucas.C.

Rep& gcd	(	Rep &	g,
		const Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

Rep& lcm	(	Rep &	l,
		const Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

Examples:

examples/Integer/ilcm.C.

Rep& lcmin	(	Rep &	l,
		const Rep &	a
	)		const [inline, inherited]

Examples:

examples/Integer/ilcm.C.

Rep& inv	(	Rep &	u,
		const Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

Rep& invin	(	Rep &	u,
		const Rep &	b
	)		const [inline, inherited]

Rep& pow	(	Rep &	r,
		const Rep &	n,
		const long	l
	)		const [inline, inherited]

Rep& pow	(	Rep &	r,
		const Rep &	n,
		const unsigned long	l
	)		const [inline, inherited]

Rep& pow	(	Rep &	r,
		const Rep &	n,
		const int	l
	)		const [inline, inherited]

Rep& pow	(	Rep &	r,
		const Rep &	n,
		const unsigned int	l
	)		const [inline, inherited]

Rep& sqrt	(	Rep &	s,
		const Rep &	n
	)		const [inline, inherited]

Rep& sqrt	(	Rep &	s,
		Rep &	r,
		const Rep &	n
	)		const [inline, inherited]

long logp	(	const Rep &	a,
		const Rep &	p
	)		const [inline, inherited]

Rep& powmod	(	Rep &	r,
		const Rep &	n,
		const long	e,
		const Rep &	m
	)		const [inline, inherited]

Examples:

examples/Integer/ProbLucas.C.

Rep& powmod	(	Rep &	r,
		const Rep &	n,
		const Rep &	e,
		const Rep &	m
	)		const [inline, inherited]

unsigned long length

(

const Rep &

a

)

const [inline, inherited]

int sign

(

const Rep &

a

)

const [inline, inherited]

bool isZero

(

const Rep &

a

)

const [inline, inherited]

bool isOne

(

const Rep &

a

)

const [inline, inherited]

bool areEqual	(	const Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

bool areNEqual	(	const Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

bool isgeq	(	const Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

bool isgeq	(	const long	b,
		const Rep &	a
	)		const [inline, inherited]

bool isgeq	(	const Rep &	a,
		const long	b
	)		const [inline, inherited]

bool isleq	(	const Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

bool isleq	(	const long	b,
		const Rep &	a
	)		const [inline, inherited]

bool isleq	(	const Rep &	a,
		const long	b
	)		const [inline, inherited]

bool isgt	(	const Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

bool isgt	(	const long	b,
		const Rep &	a
	)		const [inline, inherited]

bool isgt	(	const Rep &	a,
		const long	b
	)		const [inline, inherited]

bool islt	(	const Rep &	a,
		const Rep &	b
	)		const [inline, inherited]

bool islt	(	const long	b,
		const Rep &	a
	)		const [inline, inherited]

bool islt	(	const Rep &	a,
		const long	b
	)		const [inline, inherited]

Rep& random	(	RandIter &	,
		Rep &	r,
		long	s = 1
	)		const [inline, inherited]

Examples:

examples/Integer/ProbLucas.C.

Rep& random	(	RandIter &	,
		Rep &	r,
		const Rep &	b
	)		const [inline, inherited]

Rep& nonzerorandom	(	RandIter &	,
		Rep &	r,
		long	s = 1
	)		const [inline, inherited]

Rep& nonzerorandom	(	RandIter &	,
		Rep &	r,
		const Rep &	b
	)		const [inline, inherited]

---

Field Documentation

RandIter _g [protected, inherited]

const Integer one [inherited]

const Integer zero [inherited]

---

The documentation for this class was generated from the following files:

• givintnumtheo.h
• givintnumtheo.inl