Public Member Functions
ChineseRemainder< CRABase > Struct Template Reference

Wrapper around OMP/SEQ version of ChineseRemainderXXX<CRABase>. More...

#include <cra-kaapi.h>

+ Inheritance diagram for ChineseRemainder< CRABase >:

Public Member Functions

template<class Int , class Function , class PrimeIterator >
Int & operator() (Int &res, Function &Iteration, PrimeIterator &primeiter)
 CRA loop subroutine. More...
template<class Function , class PrimeIterator >
Integer & operator() (Integer &res, Function &Iteration, PrimeIterator &primeiter)
 The Chinese Remaindering Algorithm loop. More...

Detailed Description

template<class CRABase>
struct LinBox::ChineseRemainder< CRABase >

Wrapper around OMP/SEQ version of ChineseRemainderXXX<CRABase>.

No doc.

If LINBOX_USES_OPENMP is defined, the we use ChineseRemainderOMP, else we fall back to ChineseRemainderSeq

This is the SEQ version


Member Function Documentation

Integer& operator() ( Integer &  res,
Function &  Iteration,
PrimeIterator &  primeiter 

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.

IterationFunction 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.
We won't detect bad primes.
primeiteriterator for generating primes.
[out]resan integer

The documentation for this struct was generated from the following files: