/usr/include/linbox/algorithms/cra-early-multip.h is in liblinbox-dev 1.4.2-5build1.
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 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 | /* 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========
*/
/*! @file algorithms/cra-early-multip.h
* @ingroup algorithms
* @brief NO DOC
*/
#ifndef __LINBOX_cra_early_multip_H
#define __LINBOX_cra_early_multip_H
#include "linbox/util/timer.h"
#include <stdlib.h>
#include "linbox/integer.h"
#include "linbox/solutions/methods.h"
#include <vector>
#include <utility>
#include "linbox/algorithms/cra-early-single.h"
#include "linbox/algorithms/cra-full-multip.h"
namespace LinBox
{
/*! @brief NO DOC
* @ingroup CRA
*
*/
template<class Domain_Type>
struct EarlyMultipCRA : public EarlySingleCRA<Domain_Type>, public FullMultipCRA<Domain_Type> {
typedef Domain_Type Domain;
typedef typename Domain::Element DomainElement;
typedef EarlyMultipCRA<Domain> Self_t;
protected:
// Random coefficients for a linear combination
// of the elements to be reconstructed
std::vector< unsigned long > randv;
Integer& result(Integer &d) { std::cout << "should not be called" << std::endl; return d ;} ; // DON'T TOUCH
public:
EarlyMultipCRA(const unsigned long EARLY=DEFAULT_EARLY_TERM_THRESHOLD) :
EarlySingleCRA<Domain>(EARLY), FullMultipCRA<Domain>()
{}
Integer& getModulus(Integer& m)
{
EarlySingleCRA<Domain>::getModulus(m);
return m;
}
Integer& getResidue(Integer& m)
{
EarlySingleCRA<Domain>::getResidue(m);
return m;
}
template<template<class T> class Vect>
Vect<Integer>& getResidue(Vect<Integer>& m)
{
FullMultipCRA<Domain>::getResidue(m);
return m;
}
//! Init
template<template<class T> class Vect>
void initialize (const Integer& D, const Vect<Integer>& e)
{
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;
Integer z;
dot(z, D, e, randv);
EarlySingleCRA<Domain>::initialize(D, z);
FullMultipCRA<Domain>::initialize(D, e);
}
template<template <class> class Alloc, template<class, class> class Vect>
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.
EarlySingleCRA<Domain>::initialize(D,dot(z, D, e, randv) );
FullMultipCRA<Domain>::initialize(D, e);
}
template<class OKDomain>
void initialize (const Domain& D, const BlasVector<OKDomain>& 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.
EarlySingleCRA<Domain>::initialize(D,dot(z, D, e, randv) );
FullMultipCRA<Domain>::initialize(D, e);
}
//! Progress
template<template<class T> class Vect>
void progress (const Integer& D, const Vect<Integer>& e)
{
Integer z;
EarlySingleCRA<Domain>::progress(D, dot(z, D, e, randv));
FullMultipCRA<Domain>::progress(D, e);
}
#if 1
template<template <class> class Alloc, template<class, class> class Vect>
void progress (const Domain& D, const Vect<DomainElement, Alloc<DomainElement> >& e)
{
// DomainElement z;
/*!@todo 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.
*/
// EarlySingleCRA<Domain>::progress(D, dot(z, D, e, randv));
// FullMultipCRA<Domain>::progress(D, e);
BlasVector<Domain> d(D,e);
this->progress(D,d);
}
#endif
template<class OKDomain>
void progress (const Domain& D, const BlasVector<OKDomain>& e)
{
DomainElement z;
/*!@todo 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.
*/
EarlySingleCRA<Domain>::progress(D, dot(z, D, e, randv));
FullMultipCRA<Domain>::progress(D, e);
}
//! Result
template<template <class> class Alloc, template<class, class> class Vect>
Vect<Integer, Alloc<Integer> >& result(Vect<Integer, Alloc<Integer> >& d)
{
return FullMultipCRA<Domain>::result(d);
}
BlasVector<Givaro::ZRing<Integer> >& result(BlasVector<Givaro::ZRing<Integer> >& d)
{
return FullMultipCRA<Domain>::result(d);
}
//! terminate
bool terminated()
{
return EarlySingleCRA<Domain>::terminated();
}
bool noncoprime(const Integer& i) const
{
return EarlySingleCRA<Domain>::noncoprime(i);
}
bool changeVector()
{
for ( std::vector<unsigned long>::iterator int_p = randv. begin();int_p != randv. end(); ++ int_p)
*int_p = ((unsigned long)lrand48()) % 20000;
std::vector<Integer> e(randv.size());
/* clear CRAEarlySingle; */
EarlySingleCRA<Domain>::occurency_ = 0;
EarlySingleCRA<Domain>::nextM_ = 1UL;
EarlySingleCRA<Domain>::primeProd_ = 1UL;
EarlySingleCRA<Domain>::residue_ = 0;
/* Computation of residue_ */
std::vector< LazyProduct >::iterator _mod_it = FullMultipCRA<Domain>::RadixPrimeProd_.begin();// list of prime products
std::vector< std::vector<Integer> >::iterator _tab_it = FullMultipCRA<Domain>::RadixResidues_.begin();// list of residues as vectors of size 1
std::vector< bool >::iterator _occ_it = FullMultipCRA<Domain>::RadixOccupancy_.begin();//flags of occupied fields
int prev_shelf=0, shelf = 0;
for (;_occ_it != FullMultipCRA<Domain>::RadixOccupancy_.end(); ++_mod_it, ++_tab_it, ++_occ_it ) {
++shelf;
if (*_occ_it) {
Integer D = _mod_it->operator()();
std::vector<Integer> e_v(randv.size());
e_v = *_tab_it;
Integer z;
dot(z,D, e_v, randv);
Integer prev_residue_ = EarlySingleCRA<Domain>::residue_;
EarlySingleCRA<Domain>::progress(D,z);
if (prev_residue_ == EarlySingleCRA<Domain>::residue_ )
EarlySingleCRA<Domain>::occurency_ = EarlySingleCRA<Domain>::occurency_ + (shelf - prev_shelf);
if ( EarlySingleCRA<Domain>::terminated() ) {
return true;
}
prev_shelf = shelf;
}
}
return false;
}
protected:
/*! @bug why a dot product here ?
*/
template <template<class T> class Vect1, class Vect2>
Integer& dot (Integer& z, const Integer& D, const Vect1<Integer>& v1, const Vect2& v2)
{
z = 0;
typename Vect1<Integer>::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) {
z = (z + (*v1_p)*(*v2_p))%D;
}
return z;
}
/*! @bug why a dot product here ?
*/
template <template <class> class Alloc, template<class, class> class Vect1, 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)));
// commentator().report(Commentator::LEVEL_ALWAYS, INTERNAL_DESCRIPTION) << "v: " << v2 << std::endl;
// commentator().report(Commentator::LEVEL_ALWAYS, INTERNAL_DESCRIPTION) << "z: " << z << std::endl;
return z;
}
template <class Vect2, class OKDomain>
DomainElement& dot (DomainElement& z, const Domain& D,
const BlasVector<OKDomain>& 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)));
// commentator().report(Commentator::LEVEL_ALWAYS, INTERNAL_DESCRIPTION) << "v: " << v2 << std::endl;
// commentator().report(Commentator::LEVEL_ALWAYS, INTERNAL_DESCRIPTION) << "z: " << z << std::endl;
return z;
}
};
}
#endif //__LINBOX_cra_early_multip_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
|