Rationals. No doc.
More...
#include <givrational.h>
|
static void | SetReduce () |
|
static void | SetNoReduce () |
|
static bool | ratrecon (Integer &num, Integer &den, const Integer &f, const Integer &m, const Integer &k, bool forcereduce=true, bool recurs=true) |
|
static bool | RationalReconstruction (Integer &num, Integer &den, const Integer &f, const Integer &m) |
|
static bool | RationalReconstruction (Integer &num, Integer &den, const Integer &f, const Integer &m, const Integer &numbound, bool forcereduce=true, bool recursive=true) |
|
static bool | RationalReconstruction (Integer &num, Integer &den, const Integer &f, const Integer &m, const Integer &numbound, const Integer &denbound) |
|
|
Rational & | reduce () |
|
bool | ratrecon (const Integer &f, const Integer &m, const Integer &k, bool forcereduce=true, bool recurs=false) |
| num/den \equiv f modulo m, with a bound k on num forcereduce : must return a reduced fraction num/den recurs : tries to augment the given bound k if failure More...
|
|
|
static void | Init (int *argc, char ***argv) |
|
static void | End () |
|
◆ ReduceFlag
Enumerator |
---|
Reduce | |
NoReduce | |
◆ Rational() [1/16]
◆ Rational() [2/16]
◆ Rational() [3/16]
◆ Rational() [4/16]
◆ Rational() [5/16]
◆ Rational() [6/16]
◆ Rational() [7/16]
◆ Rational() [8/16]
◆ Rational() [9/16]
◆ Rational() [10/16]
◆ Rational() [11/16]
◆ Rational() [12/16]
◆ Rational() [13/16]
◆ Rational() [14/16]
Rational number reconstruction.
, with and
- Bibliography:
- von zur Gathen & Gerhard Modern Computer Algebra, 5.10, Cambridge Univ. Press 1999]
◆ Rational() [15/16]
◆ Rational() [16/16]
◆ operator=()
◆ logcpy()
◆ copy()
◆ operator+() [1/2]
◆ operator-() [1/2]
◆ operator-() [2/2]
◆ operator+() [2/2]
◆ operator*()
◆ operator/()
◆ operator+=()
◆ operator-=()
◆ operator*=()
◆ operator/=()
◆ operator%()
◆ nume()
◆ deno()
◆ print()
std::ostream & print |
( |
std::ostream & |
o | ) |
const |
◆ reduce() [1/2]
◆ SetReduce()
◆ SetNoReduce()
◆ operator short()
◆ operator uint16_t()
operator uint16_t |
( |
| ) |
const |
|
inline |
◆ operator uint8_t()
operator uint8_t |
( |
| ) |
const |
|
inline |
◆ operator uint32_t()
operator uint32_t |
( |
| ) |
const |
|
inline |
◆ operator int()
◆ operator signed char()
operator signed char |
( |
| ) |
const |
|
inline |
◆ operator uint64_t()
operator uint64_t |
( |
| ) |
const |
|
inline |
◆ operator int64_t()
operator int64_t |
( |
| ) |
const |
|
inline |
◆ operator std::string()
operator std::string |
( |
| ) |
const |
|
inline |
◆ operator float()
◆ operator double()
operator double |
( |
| ) |
const |
|
inline |
◆ reduce() [2/2]
◆ Init()
void Init |
( |
int * |
argc, |
|
|
char *** |
argv |
|
) |
| |
|
staticprotected |
◆ End()
◆ ratrecon() [1/2]
bool ratrecon |
( |
const Integer & |
f, |
|
|
const Integer & |
m, |
|
|
const Integer & |
k, |
|
|
bool |
forcereduce = true , |
|
|
bool |
recurs = false |
|
) |
| |
|
protected |
num/den \equiv f modulo m, with a bound k on num forcereduce : must return a reduced fraction num/den recurs : tries to augment the given bound k if failure
◆ ratrecon() [2/2]
◆ RationalReconstruction() [1/3]
◆ RationalReconstruction() [2/3]
◆ RationalReconstruction() [3/3]
◆ GivModule
◆ QField< Rational >
◆ compare
◆ absCompare
◆ pow [1/3]
◆ floor
◆ ceil
◆ round
◆ trunc
◆ abs
◆ pow [2/3]
◆ pow [3/3]
◆ length
◆ sign
◆ isZero
◆ isOne
◆ isMOne
◆ isInteger
◆ zero
◆ one
◆ mOne
◆ num
◆ den
◆ flags
◆ Module
The documentation for this class was generated from the following files: