/usr/include/linbox/field/Givaro/givaro-field-gf2.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 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 | /* linbox/field/givaro-field.h
* Copyright (C) 2009 JGD
*
* ------------------------------------
*
*
* ========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_givaro_field_gf2_H
#define __LINBOX_givaro_field_gf2_H
#include "linbox/field/gf2.h"
#include "linbox/field/Givaro/givaro-field.h"
// Specialization of GivaroField for GF2
namespace LinBox
{
/**
\brief give LinBox fields an allure of Givaro Fields
\ingroup field
* This class adds the necessary requirements allowing
* the construction of an extension of a LinBox field.
*/
template<>
struct GivaroField<LinBox::GF2> : public LinBox::GF2 {
typedef LinBox::GF2 BaseField;
typedef BaseField::Element TT;
typedef Signed_Trait<TT>::unsigned_type UTT;
typedef TT Rep;
typedef GivaroField<BaseField> Self_t;
typedef Rep Element;
typedef UTT Residu_t;
Element zero, one;
GivaroField(const BaseField& bf) :
BaseField(bf)
{
this->init(zero,0UL);
this->init(one, 1UL);
}
// -- amxy: r <- c - a * b mod p
Rep& amxy (Rep& r, const Rep a, const Rep b, const Rep c) const
{
Rep tmp;
this->mul(tmp, a, b);
this->assign(r,c);
return this->subin(r,tmp);
}
stdBitReference amxy (stdBitReference r, const Rep a, const Rep b, const Rep c) const
{
Rep tmp;
this->mul(tmp, a, b);
this->assign(r,c);
return this->subin(r,tmp);
}
// -- maxpy: r <- y - a * x
Rep& maxpy (Rep& r, const Rep a, const Rep x, const Rep y) const
{
Rep tmp; this->mul(tmp, a, x);
return this->sub(r,y,tmp);
}
stdBitReference maxpy (stdBitReference r, const Rep a, const Rep x, const Rep y) const
{
Rep tmp; this->mul(tmp, a, x);
return this->sub(r,y,tmp);
}
// -- axmyin: r <- a * x - r
Rep& axmyin (Rep& r, const Rep a, const Rep x) const
{
maxpyin(r,a,x);
return negin(r);
}
stdBitReference axmyin (stdBitReference r, const Rep a, const Rep x) const
{
maxpyin(r,a,x);
return negin(r);
}
// -- maxpyin: r <- r - a * x
Rep& maxpyin (Rep& r, const Rep a, const Rep x) const
{
Rep tmp; this->mul(tmp, a, x);
return this->subin(r,tmp);
}
stdBitReference maxpyin (stdBitReference r, const Rep a, const Rep x) const
{
Rep tmp; this->mul(tmp, a, x);
return this->subin(r,tmp);
}
bool areNEqual ( const Rep a, const Rep b) const
{
return ! this->areEqual(a,b);
}
// Access to the modulus, characteristic, size, exponent
UTT residu() const
{
integer c;
BaseField::characteristic(c);
return UTT(c);
}
UTT characteristic() const
{
integer c; BaseField::characteristic(c); return UTT(c);
}
UTT cardinality() const
{
integer c; BaseField::cardinality(c); return UTT(c);
}
UTT exponent() const
{
return 1;
}
UTT size() const
{
integer c;
BaseField::cardinality(c);
return UTT(c);
}
// ----- random generators
template<class RandIter> Rep& random(RandIter& g, Rep& r) const
{
return r = g() ;
}
template<class RandIter> Rep& random(RandIter& g, Rep& r, long s) const
{
return r = g() ;
}
template<class RandIter> Rep& random(RandIter& g, Rep& r, const Rep& b) const
{
return r = g() ;
}
template<class RandIter> Rep& nonzerorandom(RandIter& g, Rep& r) const
{
return r = g() ;
}
template<class RandIter> Rep& nonzerorandom(RandIter& g, Rep& r, long s) const
{
return r = g() ;
}
template<class RandIter> Rep& nonzerorandom(RandIter& g, Rep& r, const Rep& b) const
{
return r = g() ;
}
template<class RandIter> stdBitReference random(RandIter& g, stdBitReference r) const
{
return r = g() ;
}
template<class RandIter> stdBitReference random(RandIter& g, stdBitReference r, long s) const
{
return r = g() ;
}
template<class RandIter> stdBitReference random(RandIter& g, stdBitReference r, const stdBitReference b) const
{
return r = g() ;
}
template<class RandIter> stdBitReference nonzerorandom(RandIter& g, stdBitReference r) const
{
return r = g() ;
}
template<class RandIter> stdBitReference nonzerorandom(RandIter& g, stdBitReference r, long s) const
{
return r = g() ;
}
template<class RandIter> stdBitReference nonzerorandom(RandIter& g, stdBitReference r, const Rep& b) const
{
return r = g() ;
}
template<class RandIter> stdBitReference nonzerorandom(RandIter& g, stdBitReference r, const stdBitReference b) const
{
return r = g() ;
}
};
}
#endif // __LINBOX_givaro_field_gf2_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:
|