linbox
|
No doc. More...
#include <cra-domain-seq.h>
Public Member Functions | |
template<class Function , class PrimeIterator > | |
Integer & | operator() (Integer &res, Function &Iteration, PrimeIterator &primeiter) |
The Chinese Remaindering Algorithm loop. |
No doc.
Integer& operator() | ( | Integer & | 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.
Iteration | Function object of two arguments, Iteration(r, F) , given prime field F it outputs residue(s) r . 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. | |
[out] | res | an integer |