Random Prime Iterator.
More...
#include <random-prime.h>
Random Prime Iterator.
Generates prime of size smaller than a prescribed one. This class is closer to the LinBox::RandIterArchetype.
- Todo:
- one could create the same one on a LinBox::PID_double ?
◆ RandomPrimeIter() [1/2]
Constructor.
- Parameters
-
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() [2/2]
copy constructor.
- Parameters
-
R | random iterator to be copied. |
◆ operator=()
copy.
- Parameters
-
R | random iterator to be copied. |
◆ random()
get a random prime of maximum size _bits
.
- Parameters
-
◆ random_exact()
- Todo:
- uses random_exact when givaro is released.
◆ random_between()
- Todo:
- uses random_between when givaro is released.
The documentation for this class was generated from the following file: