/usr/include/linbox/algorithms/rational-cra-early-multip.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 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 | /* Copyright (C) 2010 LinBox
* Written by <Jean-Guillaume.Dumas@imag.fr>
*
*
*
* ========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_early_multip_cra_H
#define __LINBOX_rational_early_multip_cra_H
#include "givaro/zring.h"
#include "linbox/algorithms/rational-cra-early-single.h"
#include "linbox/algorithms/rational-cra-full-multip.h"
namespace LinBox
{
template<class Domain_Type>
struct EarlyMultipRatCRA : public EarlySingleRatCRA<Domain_Type>, public FullMultipRatCRA<Domain_Type> {
typedef Domain_Type Domain;
typedef typename Domain_Type::Element DomainElement;
typedef EarlyMultipRatCRA<Domain> Self_t;
protected:
// Random coefficients for a linear combination
// of the elements to be reconstructed
std::vector< unsigned long > randv;
void initialize (const Integer& D, const Integer& e) {return;}; // DON'T TOUCH
void progress (const Integer & D, const Integer & e) {return;};
void initialize (const Domain& D, const DomainElement& e){return;};
Integer& result(Integer& d){return d;};
void progress (const Domain& D, const DomainElement& e){return;};
public:
EarlyMultipRatCRA(const unsigned long EARLY=DEFAULT_EARLY_TERM_THRESHOLD) :
EarlySingleRatCRA<Domain>(EARLY), FullMultipRatCRA<Domain>()
{ }
//!init
template<template<class, class> class Vect, template <class> class Alloc>
void initialize (const Domain& D, const Vect <DomainElement, Alloc<DomainElement> >& e)
{
// Random coefficients for a linear combination
// of the elements to be reconstructed
srand48(BaseTimer::seed());
randv. resize ( e.size() );
for ( std::vector<unsigned long>::iterator int_p = randv. begin();
int_p != randv. end(); ++ int_p)
*int_p = ((unsigned long)lrand48()) % 20000;
DomainElement z;
// Could be much faster
// - do not compute twice the product of moduli
// - reconstruct one element of e until Early Termination,
// then only, try a random linear combination.
EarlySingleRatCRA<Domain>::initialize(D,dot(z, D, e, randv) );
FullMultipRatCRA<Domain>::initialize(D, e);
}
void initialize (const Domain& D, const BlasVector<Domain>& e)
{
// Random coefficients for a linear combination
// of the elements to be reconstructed
srand48(BaseTimer::seed());
randv. resize ( e.size() );
for ( std::vector<unsigned long>::iterator int_p = randv. begin();
int_p != randv. end(); ++ int_p)
*int_p = ((unsigned long)lrand48()) % 20000;
DomainElement z;
// Could be much faster
// - do not compute twice the product of moduli
// - reconstruct one element of e until Early Termination,
// then only, try a random linear combination.
EarlySingleRatCRA<Domain>::initialize(D,dot(z, D, e, randv) );
FullMultipRatCRA<Domain>::initialize(D, e);
}
//!progress
template<template<class,class> class Vect, template <class> class Alloc>
void progress (const Domain& D, const Vect<DomainElement, Alloc<DomainElement> >& e)
{
DomainElement z;
// Could be much faster
// - do not compute twice the product of moduli
// - reconstruct one element of e until Early Termination,
// then only, try a random linear combination.
EarlySingleRatCRA<Domain>::progress(D, dot(z, D, e, randv));
FullMultipRatCRA<Domain>::progress(D, e);
}
void progress (const Domain& D, const BlasVector<Domain>& e)
{
DomainElement z;
// Could be much faster
// - do not compute twice the product of moduli
// - reconstruct one element of e until Early Termination,
// then only, try a random linear combination.
EarlySingleRatCRA<Domain>::progress(D, dot(z, D, e, randv));
FullMultipRatCRA<Domain>::progress(D, e);
}
//!result
template<template<class, class> class Vect, template <class> class Alloc>
Vect<Integer, Alloc<Integer> >& result(Vect<Integer, Alloc<Integer> >& num, Integer& den)
{
return FullMultipRatCRA<Domain>::result(num, den);
}
BlasVector<Givaro::ZRing<Integer> >& result(BlasVector<Givaro::ZRing<Integer>>& num, Givaro::ZRing<Integer>::Element& den)
{
return FullMultipRatCRA<Domain>::result(num, den);
}
//!tools
bool terminated()
{
return EarlySingleRatCRA<Domain>::terminated();
}
bool noncoprime(const Integer& i) const
{
return EarlySingleRatCRA<Domain>::noncoprime(i);
}
protected:
template <template<class, class> class Vect1, template <class> class Alloc, class Vect2>
DomainElement& dot (DomainElement& z, const Domain& D,
const Vect1<DomainElement, Alloc<DomainElement> >& v1, const Vect2& v2)
{
D.assign(z,D.zero); DomainElement tmp;
typename Vect1<DomainElement, Alloc<DomainElement> >::const_iterator v1_p;
typename Vect2::const_iterator v2_p;
for (v1_p = v1. begin(), v2_p = v2. begin();
v1_p != v1. end();
++ v1_p, ++ v2_p)
D.axpyin(z, (*v1_p), D.init(tmp, (*v2_p)));
#if 0
commentator().report(Commentator::LEVEL_ALWAYS, INTERNAL_DESCRIPTION) << "v: " << v2 << std::endl;
commentator().report(Commentator::LEVEL_ALWAYS, INTERNAL_DESCRIPTION) << "z: " << z << std::endl;
#endif
return z;
}
template <class Vect2>
DomainElement& dot (DomainElement& z, const Domain& D,
const BlasVector<Domain >& v1, const Vect2& v2)
{
D.assign(z,D.zero); DomainElement tmp;
typename BlasVector<Domain >::const_iterator v1_p;
typename Vect2::const_iterator v2_p;
for (v1_p = v1. begin(), v2_p = v2. begin();
v1_p != v1. end();
++ v1_p, ++ v2_p)
D.axpyin(z, (*v1_p), D.init(tmp, (*v2_p)));
#if 0
commentator().report(Commentator::LEVEL_ALWAYS, INTERNAL_DESCRIPTION) << "v: " << v2 << std::endl;
commentator().report(Commentator::LEVEL_ALWAYS, INTERNAL_DESCRIPTION) << "z: " << z << std::endl;
#endif
return z;
}
};
}
#endif //__LINBOX_rational_early_multip_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
|