linbox
|
Random Prime Iterator. More...
#include <random-prime.h>
Public Types | |
typedef integer | Prime_Type |
prime type | |
Public Member Functions | |
RandomPrimeIter (unsigned int bits=30, unsigned long seed=0) | |
Constructor. | |
~RandomPrimeIter () | |
destructor. | |
RandomPrimeIter (const RandomPrimeIter &R) | |
copy constructor. | |
RandomPrimeIter & | operator= (const RandomPrimeIter &R) |
copy. | |
integer & | random (integer &a) const |
get a random prime of maximum size _bits . | |
integer & | random_exact (integer &a) const |
integer & | random_between (integer &a, unsigned long _low_bits) const |
Random Prime Iterator.
Generates prime of size smaller than a prescribed one. This class is closer to the LinBox::RandIterArchetype.
RandomPrimeIter | ( | unsigned int | bits = 30 , |
unsigned long | seed = 0 |
||
) | [inline] |
Constructor.
bits | max size of primes (in bits). Default is 30 so it can fit in a Linbox::Modular<double> . |
seed | if 0 a seed will be generated, otherwise, the provided seed will be use. |
RandomPrimeIter | ( | const RandomPrimeIter & | R | ) | [inline] |
copy constructor.
R | random iterator to be copied. |
RandomPrimeIter& operator= | ( | const RandomPrimeIter & | R | ) | [inline] |
copy.
R | random iterator to be copied. |
get a random prime of maximum size _bits
.
[out] | a | a prime number |