/usr/include/linbox/algorithms/rational-cra.h is in liblinbox-dev 1.4.2-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 | /* Copyright (C) 2007 LinBox
* Written by JG Dumas
*
*
*
* ========LICENCE========
* This file is part of the library LinBox.
*
* LinBox is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
* ========LICENCE========
*/
#ifndef __LINBOX_rational_cra_H
#define __LINBOX_rational_cra_H
#include "givaro/zring.h"
namespace LinBox
{
#if 0
template<class T, template <class T> class Container>
std::ostream& operator<< (std::ostream& o, const Container<T>& C) {
for(typename Container<T>::const_iterator refs = C.begin();
refs != C.end() ;
++refs )
o << (*refs) << " " ;
return o << std::endl;
}
#endif
/** \brief Chinese remainder of rationals
*
* Compute the reconstruction of rational numbers
* Either by Early Termination see [Dumas, Saunder, Villard, JSC 32 (1/2), pp 71-99, 2001],
* Or via a bound on the size of the integers.
*/
template<class RatCRABase>
struct RationalRemainder {
typedef typename RatCRABase::Domain Domain;
typedef typename RatCRABase::DomainElement DomainElement;
protected:
RatCRABase Builder_;
public:
template<class Param>
RationalRemainder(const Param& b) :
Builder_(b)
{ }
/** \brief The Rational CRA 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.
\param Iteration Function object of two arguments, \c Iteration(r, p), given
prime \p p it outputs residue(s) \p r. This loop may be
parallelized. \p Iteration must be reentrant, thread safe. For
example, \p Iteration may be returning the coefficients of the minimal
polynomial of a matrix \c mod \p p. @warning we won't detect bad
primes.
\param genprime RandIter object for generating primes.
\param[out] num the rational numerator
\param[out] den the rational denominator
*/
template<class Function, class RandPrimeIterator>
Integer & operator() (Integer& num, Integer& den, Function& Iteration, RandPrimeIterator& genprime)
{
++genprime;
{
Domain D(*genprime);
DomainElement r; D.init(r);
Builder_.initialize( D, Iteration(r, D) );
}
while( ! Builder_.terminated() ) {
++genprime; while(Builder_.noncoprime(*genprime) ) ++genprime;
Domain D(*genprime);
DomainElement r; D.init(r);
Builder_.progress( D, Iteration(r, D) );
}
return Builder_.result(num, den);
}
#if 0 /* marche pas si on remplace le premier Interger par Givaro::ZRing<Integer> :-( spécialise pour BlasVector*/
template<template <class, class> class Vect, template <class> class Alloc, class Function, class RandPrimeIterator>
Vect<Integer, Alloc<Integer> > & operator() (Vect<Integer, Alloc<Integer> >& num, Integer& den, Function& Iteration, RandPrimeIterator& genprime)
{
++genprime;
{
Domain D(*genprime);
Vect<DomainElement, Alloc<DomainElement> > r;
Builder_.initialize( D, Iteration(r, D) );
}
while( ! Builder_.terminated() ) {
++genprime; while(Builder_.noncoprime(*genprime) ) ++genprime;
Domain D(*genprime);
Vect<DomainElement, Alloc<DomainElement> > r;
Builder_.progress( D, Iteration(r, D) );
}
return Builder_.result(num, den);
}
#endif
template<class Function, class RandPrimeIterator>
BlasVector<Givaro::ZRing<Integer> > & operator() ( BlasVector<Givaro::ZRing<Integer> >& num, Integer& den, Function& Iteration, RandPrimeIterator& genprime)
{
++genprime;
{
Domain D(*genprime);
BlasVector<Domain > r(D);
Builder_.initialize( D, Iteration(r, D) );
}
while( ! Builder_.terminated() ) {
++genprime; while(Builder_.noncoprime(*genprime) ) ++genprime;
Domain D(*genprime);
BlasVector<Domain > r(D);
Builder_.progress( D, Iteration(r, D) );
}
return Builder_.result(num, den);
}
};
}
#endif //__LINBOX_rational_cra_H
// Local Variables:
// mode: C++
// tab-width: 8
// indent-tabs-mode: nil
// c-basic-offset: 8
// End:
// vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,\:0,t0,+0,=s
|