Version 5.0 The LEDA User Manual

int residual :: required primetable size(int b)
returns the number of primes required to represent
signed numbers up to bit length b
The following functions have the common precondition that the residual objects a, x
are integral and do not overflow.
integer x.to integer( ) returns the integer equal to x.
long x.length( ) returns the length of the binary representation of
the integer represented by x.
bool x.is long( ) returns true if and only if x fits in the data format
long.
long x.to long( ) returns a long number which is initialized with the
value of x. Precondition: x.is long( ) is true.
double x.to double( ) returns a double floating point approximation of x.
double x.to float( ) as above.
bool x.is zero( ) returns true if and only if x is equal to zero.
bool x.is invertible( ) returns true if and only if x is nonzero and the current
modular representation of x allows to invert x
without loss of information.
int x.sign( ) returns the sign of x.
int x.lagrange sign( ) returns the sign of x using Lagrange’s formula.
int x.garner sign( ) returns the sign of x using Garner’s formula.
string x.to string( ) returns the decimal representation of x.
residual abs(const residual& a) returns the absolute value of a
void x.absolute(const residual& a)
sets x to the absolute value of a.
The remaining functions do not have implicit preconditions. Although not explicitly
mentioned, the arithmetic operations +, −, ∗, /, +=, −=, ∗=, /=, ++, −−, the shift
operations, the comparison operations , ≥, ==, != and the stream operations are
available.
residual sqr(const residual& a) returns a ∗ a
residual det2x2(const residual& a, const residual& b, const residual& c,
const residual& d)
returns a ∗ d − b ∗ c