Random Prime Iterator.
More...
#include <random-prime.h>
Detailed Description
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 ?
Constructor & Destructor Documentation
RandomPrimeIter |
( |
unsigned int |
bits = 30 , |
|
|
unsigned long |
seed = 0 |
|
) |
| [inline] |
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. |
copy constructor.
- Parameters:
-
R | random iterator to be copied. |
Member Function Documentation
copy.
- Parameters:
-
R | random iterator to be copied. |
get a random prime of maximum size _bits
.
- Parameters:
-
- Todo:
- uses random_exact when givaro is released.
- Todo:
- uses random_between when givaro is released.
The documentation for this class was generated from the following file: