Masked Prime Iterator.
More...
#include <random-prime.h>
|
| const Prime_Type & | operator* () const |
| | get the random prime.
|
| |
| const Prime_Type & | operator* () const |
| | get the random prime.
|
| |
| void | setBits (uint64_t bits) |
| | Sets the bit size.
|
| |
| void | setBits (uint64_t bits) |
| | Sets the bit size.
|
| |
|
| static void | setSeed (uint64_t ul) |
| | Sets the seed.
|
| |
| static void | setSeed (uint64_t ul) |
| | Sets the seed.
|
| |
|
|
uint64_t | _bits |
| | common lenght of all primes
|
| |
|
uint64_t | _bits |
| | common lenght of all primes
|
| |
|
integer | _prime |
| | the generated prime.
|
| |
|
integer | _prime |
| | the generated prime.
|
| |
|
Givaro::IntPrimeDom | _IPD |
| | empty struct dealing with primality.
|
| |
|
Givaro::IntPrimeDom | _IPD |
| | empty struct dealing with primality.
|
| |
template<class Trait = IteratorCategories::HeuristicTag>
class LinBox::MaskedPrimeIterator< Trait >
Masked Prime Iterator.
Generates prime of specified length with fixed lower bits
◆ operator*() [1/2]
| const Prime_Type & operator* |
( |
| ) |
const |
|
inlineinherited |
get the random prime.
returns the actual prime.
- Warning
- a new prime is not generated.
◆ operator*() [2/2]
| const Prime_Type & operator* |
( |
| ) |
const |
|
inlineinherited |
get the random prime.
returns the actual prime.
- Warning
- a new prime is not generated.
◆ setSeed() [1/2]
| static void setSeed |
( |
uint64_t | ul | ) |
|
|
inlinestaticinherited |
Sets the seed.
Set the random seed to be ul.
- Parameters
-
◆ setSeed() [2/2]
| static void setSeed |
( |
uint64_t | ul | ) |
|
|
inlinestaticinherited |
Sets the seed.
Set the random seed to be ul.
- Parameters
-
◆ setBits() [1/2]
| void setBits |
( |
uint64_t | bits | ) |
|
|
inlineinherited |
Sets the bit size.
- Parameters
-
◆ setBits() [2/2]
| void setBits |
( |
uint64_t | bits | ) |
|
|
inlineinherited |
Sets the bit size.
- Parameters
-
The documentation for this class was generated from the following file: