/usr/include/linbox/algorithms/lazy-product.h is in liblinbox-dev 1.3.2-1.1build2.
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 | /* 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_lazy_product_H
#define __LINBOX_lazy_product_H
namespace LinBox
{
// Lazy computation of the product of the moduli
struct LazyProduct : public std::vector< Integer > {
typedef std::vector< Integer > Father_t;
protected:
bool _tobecomputed;
public:
LazyProduct() :
Father_t(), _tobecomputed(true)
{}
void initialize(const Integer& i)
{
_tobecomputed = false;
this->resize(0);
this->push_back(i);
}
bool mulin(const Integer& i)
{
if (this->size()) {
if (i != this->back()) {
this->push_back( i );
return _tobecomputed = true;
}
else {
return _tobecomputed;
}
}
else {
this->push_back( i );
return _tobecomputed = false;
}
}
bool mulin(const LazyProduct& i)
{
this->insert(this->end(), i.begin(), i.end());
return _tobecomputed = (this->size()>1);
}
Integer & operator() ()
{
if (_tobecomputed) {
Father_t::const_iterator iter = this->begin();
Father_t::iterator prod = this->begin();
for(++iter; iter != this->end(); ++iter)
*prod *= *iter;
this->resize(1);
_tobecomputed = false;
}
return this->back();
}
bool noncoprime(const Integer& i) const
{
Integer g;
for(Father_t::const_iterator iter = this->begin(); iter != this->end(); ++iter)
if ( gcd(g,i,*iter) > 1) return true;
return false;
}
friend std::ostream& operator<< (std::ostream& o, const LazyProduct& C)
{
o << "{";
for(Father_t::const_iterator refs = C.begin();
refs != C.end() ;
++refs )
o << (*refs) << " " ;
return o << "}";
}
};
}
#endif //__LINBOX_lazy_product_H
// vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,:0,t0,+0,=s
// Local Variables:
// mode: C++
// tab-width: 8
// indent-tabs-mode: nil
// c-basic-offset: 8
// End:
|