/usr/include/linbox/field/NTL/ntl-lzz_p.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 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 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 | /* linbox/field/ntl-lzz_p.h
* Copyright (C) 1999-2005 W. J. Turner,
* 2001 Bradford Hovinen
* Copyright (C) 2011 LinBox
*
* Written by W. J. Turner <wjturner@acm.org>,
* Bradford Hovinen <hovinen@cis.udel.edu>
*
*
* ========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 field/NTL/ntl-lzz_p.h
* @ingroup field
* @ingroup NTL
* @brief NO DOC
*/
#ifndef __LINBOX_field_ntl_lzz_p_H
#define __LINBOX_field_ntl_lzz_p_H
#ifndef __LINBOX_HAVE_NTL
#error "you need NTL here"
#endif
#include <time.h>
#include "linbox/linbox-config.h"
#include "linbox/util/debug.h"
#include <NTL/lzz_p.h>
#include <NTL/ZZ.h>
#include "linbox/field/unparametric.h"
#include "linbox/randiter/unparametric.h"
#include "linbox/field/field-traits.h"
#include "linbox/integer.h"
#include "linbox/integer.h"
namespace Givaro
{
/** Initialization of field element from an integer.
* This Uses NTL's <code>to_zz_p</code> function.
*
* @return reference to field element.
* @param x field element to contain output (reference returned).
* @param y Integer.
*/
template <>
NTL::zz_p& Caster(NTL::zz_p& x, const Integer& y)
{
return x = NTL::to_zz_p( y%NTL::zz_p::modulus() );
}
template <>
NTL::zz_p& Caster(NTL::zz_p& x, const double& y)
{
return x = NTL::to_zz_p((long)(y)%NTL::zz_p::modulus());
}
/** Conversion of field element to an Integer.
* This function assumes the output field element x has already been
* constructed, but that it is not already initialized.
* For now, this is done by converting the element type to a C++
* long and then to the Integer type through the use of static cast and
* NTL's to_long function.
* This, of course, assumes such static casts are possible.
* This function should be changed in the future to avoid using long.
* @return reference to Integer.
* @param x reference to Integer to contain output (reference returned).
* @param y constant reference to field element.
*/
template <>
Integer& Caster(Integer& x, const NTL::zz_p& y)
{
return x = static_cast<Integer>(rep(y));
}
} // namespace Givaro
// Namespace in which all LinBox library code resides
namespace LinBox
{
class NTL_zz_p_Initialiser {
public :
NTL_zz_p_Initialiser( const Integer & q, size_t e = 1) {
linbox_check(e == 1);
if ( q > 0 )
// NTL::zz_p::init(NTL::to_ZZ((std::string(q)).data())); // it's an error if q not prime, e not 1
NTL::zz_p::init(q); // it's an error if q not prime, e not 1
}
template <class ElementInt>
NTL_zz_p_Initialiser(const ElementInt& d) {
NTL::zz_p::init (NTL::to_ZZ(d));
}
NTL_zz_p_Initialiser () { }
};
/**
* \brief long ints modulo a positive integer.
*
* While NTL allows any int to serve as the modulus, only prime
* moduli yield fields. The primality of the modulus will not be checked, so
* it is the programmer's responsibility to supply a prime modulus if a field is
* wanted.
* These specializations allow the \ref UnparametricField template class to be
* used to wrap NTL's <code>zz_p</code> class as a LinBox field.
* Uses nice trick for mod p via floating point.
\ingroup field
*/
struct NTL_zz_p: public NTL_zz_p_Initialiser, public FFPACK::UnparametricOperations<NTL::zz_p> {
typedef NTL::zz_p Element ;
typedef FFPACK::UnparametricOperations<Element> Father_t ;
typedef UnparametricRandIter<NTL::zz_p> RandIter;
const Element zero,one,mOne ;
//public UnparametricField<Element> {
NTL_zz_p(integer p, size_t e = 1) :
NTL_zz_p_Initialiser(p,e),Father_t ()
,zero( NTL::to_zz_p(0)),one( NTL::to_zz_p(1)),mOne(-one)
{}
NTL_zz_p() :
NTL_zz_p_Initialiser(2,1), Father_t()
,zero( NTL::to_zz_p(0)),one( NTL::to_zz_p(1)),mOne(-one)
{}
Element& init(Element& x, const double& y) const
{
double z = fmod(y,(double)Element::modulus());
if (z > 0) z += 0.5;
else z -= 0.5;
return x = NTL::to_zz_p(static_cast<long>(z)); //rounds towards 0
}
Element &init (Element &x, const integer &y=0) const
{
NTL::ZZ tmp= NTL::to_ZZ(std::string(y).data());
return x = NTL::to_zz_p(tmp);
}
template <class ANY>
Element& init(Element& x, const ANY& y) const
{
return x = NTL::to_zz_p((long)(y));
}
template <class ANY>
ANY& convert(ANY& x, const Element& y) const
{
return x = (ANY)(rep(y));
}
static inline integer getMaxModulus()
{
return integer( NTL_SP_BOUND );
}
Element& pow( Element& res, const Element& x, long exp ) const
{
NTL::power( res, x, exp );
return res;
}
Element& powin( Element& x, long exp ) const
{
return x = NTL::power(x,exp);
}
/** Cardinality.
* Return integer representing cardinality of the field.
* Returns the modulus of the field, which should be prime.
* @return integer representing cardinality of the field
*/
integer& cardinality(integer& c) const
{
return c = static_cast<integer>(Element::modulus());
}
integer cardinality() const
{
return static_cast<integer>(Element::modulus());
}
/** Characteristic.
* Return integer representing characteristic of the field.
* Returns the modulus of the field, which should be prime.
* @return integer representing characteristic of the field.
*/
integer& characteristic(integer& c) const
{
return c = static_cast<integer>(Element::modulus());
}
integer characteristic() const
{
return static_cast<integer>(Element::modulus());
}
/** Multiplicative Inverse.
* x = 1 / y
* This function assumes both field elements have already been
* constructed and initialized.
* @return reference to x.
* @param x field element (reference returned).
* @param y field element.
*/
Element&
inv(Element& x, const Element& y) const
{
return x = NTL::inv(y);
}
/** Zero equality.
* Test if field element is equal to zero.
* This function assumes the field element has already been
* constructed and initialized.
* In this specialization, NTL's IsZero function is called.
* @return boolean true if equals zero, false if not.
* @param x field element.
*/
bool isZero(const Element& x) const
{
return static_cast<bool>(NTL::IsZero(x));
}
/** One equality.
* Test if field element is equal to one.
* This function assumes the field element has already been
* constructed and initialized.
* In this specialization, NTL's IsOne function is called.
* @return boolean true if equals one, false if not.
* @param x field element.
*/
bool isOne(const Element& x) const
{
return static_cast<bool>(NTL::IsOne(x));
}
/** Inplace Multiplicative Inverse.
* x = 1 / x
* This function assumes both field elements have already been
* constructed and initialized.
* @return reference to x.
* @param x field element (reference returned).
*/
Element& invin(Element& x) const
{
return x = NTL::inv(x);
}
/** Print field.
* @return output stream to which field is written.
* @param os output stream to which field is written.
*/
std::ostream& write(std::ostream& os) const
{
return os << "unparameterized field Element with p = "
<< Element::modulus();
}
std::ostream &write (std::ostream &os, const Element &x) const { return FFPACK::UnparametricOperations<Element>::write(os,x); }
};
template <class Ring>
struct ClassifyRing;
template <>
struct ClassifyRing<NTL_zz_p> {
typedef RingCategories::ModularTag categoryTag;
};
template<>
class UnparametricRandIter<NTL::zz_p> {
public:
/// Constructor for random field element generator
UnparametricRandIter<NTL::zz_p> (const NTL_zz_p & F=NTL_zz_p(),
const integer& size=0,
const integer& seed=0) :
_size(size), _seed(seed)
{
if (_seed == integer(0)) _seed = integer(time(NULL));
integer cardinality;
F.cardinality(cardinality);
if (_size > cardinality)
_size = 0;
#ifdef TRACE
std::cout << "created random generator with size " << _size
<< " and seed " << _seed << std::endl;
#endif // TRACE
// Seed random number generator
NTL::SetSeed(NTL::to_ZZ(static_cast<long>(_seed)));
}
/// Random field element creator.
NTL::zz_p& random(NTL::zz_p& x) const
{
if (_size == 0) {
return x = NTL::random_zz_p();
}
else {
return x = NTL::to_zz_p(NTL::RandomBnd(static_cast<long>(_size)));
}
}
protected :
integer _size,_seed ;
};
} // namespace LinBox
#endif // __LINBOX_field_ntl_lzz_p_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:
|