No doc.
More...
#include <cra-domain-sequential.h>
Inherited by ChineseRemainderOMP< CRABase >.
|
|
void | doskip () |
| | Call this when a bad prime is skipped.
|
| |
|
template<class PrimeIterator > |
| auto | get_coprime (PrimeIterator &primeiter) const -> decltype(*primeiter) |
| | Gets a prime from the iterator that is coprime to the curent modulus.
|
| |
template<class CRABase>
struct LinBox::ChineseRemainderSequential< CRABase >
No doc.
◆ iterCount()
How many iterations have been performed so far.
(This used to be stored in the public field IterCounter.)
◆ operator()() [1/2]
| ResultType& operator() |
( |
ResultType & |
res, |
|
|
Function & |
Iteration, |
|
|
PrimeIterator & |
primeiter |
|
) |
| |
|
inline |
The Chinese Remaindering Algorithm loop.
Given a function to generate residues mod a single prime, this loop produces the residues resulting from the Chinese remainder process on sufficiently many primes to meet the termination condition.
- Parameters
-
| [out] | res | an integer |
| Iteration | Function object of two arguments, Iteration(r, F), given prime field F it sets r to the residue(s) and returns an IterationResult to indicate how to incorporate the new residue. This loop may be parallelized. Iteration must be reentrant, thread safe. For example, Iteration may be returning the coefficients of the minimal polynomial of a matrix mod F. |
| primeiter | iterator for generating primes. |
◆ operator()() [2/2]
| bool operator() |
( |
int |
k, |
|
|
ResultType & |
res, |
|
|
Function & |
Iteration, |
|
|
PrimeIterator & |
primeiter |
|
) |
| |
|
inline |
Run the CRA loop a certain number of times.
This runs the CRA loop up to k times, or until termination if k is negative.
- Parameters
-
| k | maximum number of iterations, or run until termination if k is negative. |
| [out] | res | an integer |
| Iteration | Function object of two arguments, Iteration(r, F), given prime field F it sets r to the residue(s) and returns an IterationResult to indicate how to incorporate the new residue. This loop may be parallelized. Iteration must be reentrant, thread safe. For example, Iteration may be returning the coefficients of the minimal polynomial of a matrix mod F. |
| primeiter | iterator for generating primes. |
The documentation for this struct was generated from the following file:
