linbox
|
Chinese Remaindering Algorithm for multiple residues. More...
#include <cra-full-multip-fixed.h>
Public Member Functions | |
FullMultipFixedCRA (const std::pair< size_t, double > &p) | |
Constructor. | |
template<class Iterator > | |
void | initialize (const Domain &D, Iterator &e) |
Intialize to the first residue/prime. | |
template<class Iterator > | |
void | progress (const Domain &D, Iterator &e) |
Add a new residue (ie take into account a new prime). | |
template<class Iterator > | |
Iterator & | result (Iterator &d) |
Compute the result. |
Chinese Remaindering Algorithm for multiple residues.
An upper bound is given on the size of the data to reconstruct.
FullMultipFixedCRA | ( | const std::pair< size_t, double > & | p | ) | [inline] |
Constructor.
p | is a pair such that
|
void initialize | ( | const Domain & | D, |
Iterator & | e | ||
) | [inline] |
Intialize to the first residue/prime.
D | domain |
e | iterator on the first residue |
initialize
before progress
void progress | ( | const Domain & | D, |
Iterator & | e | ||
) | [inline] |
Add a new residue (ie take into account a new prime).
D | domain |
e | iterator for the new residue, for instance, a std::vector<T>::iterator . |
Iterator& result | ( | Iterator & | d | ) | [inline] |
Compute the result.
moves low occupied shelves up.
[out] | d | an iterator for the result. |