This file is indexed.

/usr/include/givaro/givzpzInt.inl is in libgivaro-dev 3.7.2-1.

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
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
// ==========================================================================
// $Source: /var/lib/cvs/Givaro/src/kernel/zpz/givzpzInt.inl,v $
// Copyright(c)'1994-2009 by The Givaro group
// This file is part of Givaro.
// Givaro is governed by the CeCILL-B license under French law
// and abiding by the rules of distribution of free software.
// see the COPYRIGHT file for more details.
// Authors: JG Dumas
// $Id: givzpzInt.inl,v 1.11 2011-02-02 17:16:43 bboyer Exp $
// ==========================================================================
#ifndef __GIVARO_zpz_int_INL
#define __GIVARO_zpz_int_INL
// Description:

// ---------
// -- normalized operations
// ---------

// r = a*b
// #define __GIVARO_ZPZInteger_N_MUL(r,p,a,b) { r = a*b % p; }
#define __GIVARO_ZPZInteger_N_MUL(r,p,a,b) { Integer::mul(r,a,b); Integer::modin(r,p); }
// r *= a
//#define __GIVARO_ZPZInteger_N_MULIN(r,p,a) {  r = (r*a % p);  }
#define __GIVARO_ZPZInteger_N_MULIN(r,p,a) {  Integer::mulin(r,a); Integer::modin(r,p);  }

// r = a - b
//#define __GIVARO_ZPZInteger_N_SUB(r,p,a,b) { r = (a-b); r= (r < 0 ? r+p : r); }
#define __GIVARO_ZPZInteger_N_SUB(r,p,a,b) { Integer::sub(r,a,b); if (sign(r) < 0) Integer::addin(r,p); }
// r -= a
// #define __GIVARO_ZPZInteger_N_SUBIN(r,p,a) { r -= a; r= (r < 0 ? r+p : r); }
#define __GIVARO_ZPZInteger_N_SUBIN(r,p,a) { Integer::subin(r,a) ; if ( sign(r) < 0) Integer::addin(r,p); }

// r = a+b
// #define __GIVARO_ZPZInteger_N_ADD(r,p,a,b) { r = (a+b); r= (r < p ? r : r-p); }
#define __GIVARO_ZPZInteger_N_ADD(r,p,a,b) { Integer::add(r,a,b); if (r >= p) Integer::subin(r,p); }
// r += a
// #define __GIVARO_ZPZInteger_N_ADDIN(r,p,a) { r += a;  r= (r < p ? r : r-p); }
#define __GIVARO_ZPZInteger_N_ADDIN(r,p,a) { Integer::addin(r,a);  if (r >= p) Integer::subin(r,p); }

// r <- a*b+c % p
// #define __GIVARO_ZPZInteger_N_MULADD(r,p,a,b,c) { r = (a*b+c) % p;  }
//#define __GIVARO_ZPZInteger_N_MULADD(r,p,a,b,c) { r = a; r*=b; r+=c; r %= p;  }
#define __GIVARO_ZPZInteger_N_MULADD(r,p,a,b,c) { Integer::axpy(r,a,b,c); Integer::modin(r,p);  }

// #define __GIVARO_ZPZInteger_N_MULADDIN(r,p,a,b) { r = (a*b+r) % p;  }
//#define __GIVARO_ZPZInteger_N_MULADDIN(r,p,a,b) { r += (a*b); r %= p;  }
#define __GIVARO_ZPZInteger_N_MULADDIN(r,p,a,b) { Integer::axpyin(r,a,b); Integer::modin(r,p); }

// a*b-c
//#define __GIVARO_ZPZInteger_N_MULSUB(r,p,a,b,c) { r = (a*b+p-c); r= (r<p ? r : r % p);  }
//#define __GIVARO_ZPZInteger_N_MULSUB(r,p,a,b,c) { r = a; r*=b; r+=p; r-=c; if (r>=p) r %= p;  }
#define __GIVARO_ZPZInteger_N_MULSUB(r,p,a,b,c) { Integer::axmy(r,a,b,c); Integer::modin(r,p);  }
// a*b-c
//#define __GIVARO_ZPZInteger_N_SUBMULIN(r,p,a,b) { r -= (a*b); if (r<0) { r+=p; r = (r<0 ? r % p : r); } }
// #define __GIVARO_ZPZInteger_N_SUBMULIN(r,p,a,b) { r -= (a*b); if (r<0) { r+=p; if (r<0 ) r %= p ; if (r<0 ) r += p ; } }
#define __GIVARO_ZPZInteger_N_SUBMULIN(r,p,a,b) { Integer::maxpyin(r,a,b); Integer::modin(r,p) ; }

// #define __GIVARO_ZPZInteger_N_NEG(r,p,a) { r = ( isZero(a) ? zero : p-a); }
#define __GIVARO_ZPZInteger_N_NEG(r,p,a) { if (isZero(a)) r=a; else Integer::sub(r,p,a);  }
// #define __GIVARO_ZPZInteger_N_NEGIN(r,p) { r = ( isZero(r) ? zero : p-r); }
#define __GIVARO_ZPZInteger_N_NEGIN(r,p) { if (! isZero(r)) Integer::sub(r,p,r); }

namespace Givaro {

inline ZpzDom<Integer>::Residu_t ZpzDom<Integer>::residu( ) const
{ return _p; }



 // ------------------------- Miscellaneous functions

inline int ZpzDom<Integer>::isZero(const Rep& a) const
{ return ::Givaro::isZero(a); }

inline int ZpzDom<Integer>::isOne(const Rep& a) const
{ return ::Givaro::isOne(a); }



inline size_t ZpzDom<Integer>::length(const Rep& a) const
{ return ::Givaro::length(a);}



 // ------------------------- Arithmetic functions




inline ZpzDom<Integer>::Rep& ZpzDom<Integer>::mul (Rep& r, const Rep& a, const Rep& b) const
{
    __GIVARO_ZPZInteger_N_MUL(r,_p,a,b); return r;
}

inline ZpzDom<Integer>::Rep& ZpzDom<Integer>::sub (Rep& r, const Rep& a, const Rep& b) const
{
  __GIVARO_ZPZInteger_N_SUB(r,_p,a,b); return r;
}

inline ZpzDom<Integer>::Rep& ZpzDom<Integer>::add (Rep& r, const Rep& a, const Rep& b) const
{
    __GIVARO_ZPZInteger_N_ADD(r,_p,a,b); return r;
}

inline ZpzDom<Integer>::Rep& ZpzDom<Integer>::neg (Rep& r, const Rep& a) const
{
    __GIVARO_ZPZInteger_N_NEG(r,_p,a); return r;

}

inline ZpzDom<Integer>::Rep& ZpzDom<Integer>::negin (Rep& r) const
{
  __GIVARO_ZPZInteger_N_NEGIN(r,_p);
  return r;
}

inline ZpzDom<Integer>::Rep& ZpzDom<Integer>::inv (Rep& r, const Rep& a) const
{
//  Rep d, v;
//  d = gcd(a, _p, r, v);
//  if (d == -1) negin(r);
//  return r = (r<0)?r + _p:r;
// JGD 03.06.2003
	return ::Givaro::inv(r,a,_p);
}

inline ZpzDom<Integer>::Rep& ZpzDom<Integer>::div (Rep& r, const Rep& a, const Rep& b) const
{
  Rep ib;
  inv(ib, b);
  __GIVARO_ZPZInteger_N_MUL(r,_p,a,ib);
  return r;
}

 // -- inline array operations between ZpzDom<Integer>::Rep
inline void ZpzDom<Integer>::mul (const size_t sz, Array r, constArray a, constArray b) const
{
  for ( size_t i=sz ; --i ; ) {
    __GIVARO_ZPZInteger_N_MUL(r[i], _p,a[i], b[i]);
  }
}

inline void ZpzDom<Integer>::mul (const size_t sz, Array r, constArray a, const Rep& b) const
{
  for ( size_t i=sz ; --i ; ) {
    __GIVARO_ZPZInteger_N_MUL(r[i], _p, a[i], b);
  }
}

inline void ZpzDom<Integer>::div (const size_t sz, Array r, constArray a, constArray b) const
{
  for ( size_t i=sz ; --i ; ) {
    div( r[i], a[i], b[i]);
  }
}

inline void ZpzDom<Integer>::div (const size_t sz, Array r, constArray a, const Rep& b) const
{
  ZpzDom<Integer>::Rep ib;
  inv(ib, b);
  mul(sz, r, a, ib);
}

inline void ZpzDom<Integer>::add (const size_t sz, Array r, constArray a, constArray b) const
{
  for ( size_t i=sz ; --i ; ) {
    __GIVARO_ZPZInteger_N_ADD(r[i], _p, a[i], b[i]);
  }
}

inline void ZpzDom<Integer>::add (const size_t sz, Array r, constArray a, const Rep& b) const
{
  for ( size_t i=sz ; --i ; ) {
    __GIVARO_ZPZInteger_N_ADD(r[i], _p, a[i], b);
  }
}

inline void ZpzDom<Integer>::sub (const size_t sz, Array r, constArray a, constArray b) const
{
  for ( size_t i=sz ; --i ; ) {
    __GIVARO_ZPZInteger_N_SUB(r[i], _p, a[i], b[i]);
  }
}

inline void ZpzDom<Integer>::sub (const size_t sz, Array r, constArray a, const Rep& b) const
{
  for ( size_t i=sz ; --i ; ) {
    __GIVARO_ZPZInteger_N_SUB(r[i], _p, a[i], b);
  }
}

inline void ZpzDom<Integer>::neg (const size_t sz, Array r, constArray a) const
{
  for ( size_t i=sz ; --i ; ) {
    __GIVARO_ZPZInteger_N_NEG(r[i], _p, a[i]);
  }
}


inline ZpzDom<Integer>::Rep& ZpzDom<Integer>::mulin (Rep& r, const Rep& a) const
{
  __GIVARO_ZPZInteger_N_MULIN(r,_p, a);
  return r;
}

inline ZpzDom<Integer>::Rep& ZpzDom<Integer>::divin (Rep& r, const Rep& a) const
{
  ZpzDom<Integer>::Rep ia;
  inv(ia, a);
  return mulin(r, ia);
}

inline ZpzDom<Integer>::Rep& ZpzDom<Integer>::addin (Rep& r, const Rep& a) const
{
  __GIVARO_ZPZInteger_N_ADDIN(r,_p, a);
  return r;
}

inline ZpzDom<Integer>::Rep& ZpzDom<Integer>::subin (Rep& r, const Rep& a) const
{
  __GIVARO_ZPZInteger_N_SUBIN(r,_p, a);
  return r;
}


inline ZpzDom<Integer>::Rep& ZpzDom<Integer>::invin (Rep& r) const
{
//  Rep d, u, v;
//  d = gcd(r, _p, u, v);
//  if (d == -1) negin(u);
//  return r = (u<0)?u + _p:u;
// JGD 03.06.2003
   Rep t = r;
   return ::Givaro::inv(r,t,_p);
}

inline ZpzDom<Integer>::Rep& ZpzDom<Integer>::axpy (Rep& r,
						    const Rep& a, const Rep& b, const Rep& c) const
{
  __GIVARO_ZPZInteger_N_MULADD(r, _p, a, b, c);
  return r;
}

inline ZpzDom<Integer>::Rep&  ZpzDom<Integer>::axpyin (Rep& r,
						       const Rep& a, const Rep& b) const
{
//   Rep tmp = r;
//   __GIVARO_ZPZInteger_N_MULADDIN(tmp, _p, a, b);
//   return r = (ZpzDom<Integer>::Rep)tmp;
    __GIVARO_ZPZInteger_N_MULADDIN(r, _p, a, b);
    return r;
}


inline void ZpzDom<Integer>::axpy (const size_t sz, Array r,
				   constArray a, constArray x, constArray y) const
{
  for ( size_t i=sz ; --i ; ) {
    __GIVARO_ZPZInteger_N_MULADD(r[i], _p, a[i], x[i], y[i]);
  }
}

inline void ZpzDom<Integer>::axpyin (const size_t sz, Array r,
				     constArray a, constArray x) const
{
  for ( size_t i=sz ; --i ; ) {
//     Rep tmp = r[i];
//     __GIVARO_ZPZInteger_N_MULADDIN(tmp, _p, a[i], x[i]);
//     r[i] = (ZpzDom<Integer>::Rep)tmp;
    __GIVARO_ZPZInteger_N_MULADDIN(r[i], _p, a[i], x[i]);
  }
}

inline ZpzDom<Integer>::Rep&  ZpzDom<Integer>::axmy (Rep& r,
						     const Rep& a, const Rep& b, const Rep& c) const
{
  __GIVARO_ZPZInteger_N_MULSUB(r, _p, a, b, c);
  return r;
}

// r = c - a*b
inline ZpzDom<Integer>::Rep&  ZpzDom<Integer>::maxpy (Rep& r,
						      const Rep& a, const Rep& b, const Rep& c) const
{
  Rep tmp = c;
  __GIVARO_ZPZInteger_N_SUBMULIN(tmp, _p, a, b );
  return r = (ZpzDom<Integer>::Rep)tmp;
}
// r -= a*b
inline ZpzDom<Integer>::Rep&  ZpzDom<Integer>::maxpyin (Rep& r,
						       	const Rep& a, const Rep& b) const
{
  __GIVARO_ZPZInteger_N_SUBMULIN(r, _p, a, b );
  return r;
//   Rep tmp = r;
//   __GIVARO_ZPZInteger_N_SUBMULIN(tmp, _p, a, b );
//   return r = (ZpzDom<Integer>::Rep)tmp;
}
// r = a*b - r
inline ZpzDom<Integer>::Rep&  ZpzDom<Integer>::axmyin (Rep& r,
						       const Rep& a, const Rep& b) const
{
    maxpyin(r,a,b);
    return negin(r);
}


inline void ZpzDom<Integer>::axmy (const size_t sz, Array r,
				   constArray a, constArray x, constArray y) const
{
  for ( size_t i=sz ; --i ; ) {
    __GIVARO_ZPZInteger_N_MULSUB(r[i], _p, a[i], x[i], y[i]);
  }
}

// r -= a*b
inline void ZpzDom<Integer>::maxpyin (const size_t sz, Array r,
				     constArray a, constArray x) const
{
  for ( size_t i=sz ; --i ; ) {
//     Rep tmp = r[i];
//     __GIVARO_ZPZInteger_N_SUBMULIN(tmp, _p, a[i], x[i]);
//     r[i] = (ZpzDom<Integer>::Rep)tmp;
    __GIVARO_ZPZInteger_N_SUBMULIN(r[i], _p, a[i], x[i]);
  }
}


// ---------
// -- misc operations
// ---------


inline  ZpzDom<Integer>::Rep&  ZpzDom<Integer>::init ( Rep& r, const double a ) const
{
  int sign; double ua;
  if (a < 0.0) { sign =-1; ua = -a;}
  else { ua = a; sign =1; }
  r = Integer(ua);
  if (r >=_p) Integer::modin(r,_p) ;
  if (!isZero(r) && (sign == -1)) Integer::sub(r,_p,r) ;
  return r;
}

inline  ZpzDom<Integer>::Rep&  ZpzDom<Integer>::init ( Rep& r, const float a ) const {
    return init(r, (double)a);
}



inline  ZpzDom<Integer>::Rep&  ZpzDom<Integer>::init ( Rep& r, const unsigned long a ) const
{
    r = Integer(a);
    if ( r >= _p ) Integer::modin(r,_p);
    return r ;
}

inline  ZpzDom<Integer>::Rep&  ZpzDom<Integer>::init ( Rep& r, const long a ) const
{
  int sign;
  if (a <0) { sign =-1; r = Integer(-a);}
  else { r = Integer(a); sign =1; }
  if (r >=_p) Integer::modin(r,_p);
  if (!isZero(r) && (sign ==-1)) Integer::sub(r,_p,r);
  return r;
}

inline  ZpzDom<Integer>::Rep&  ZpzDom<Integer>::init ( Rep& r, const Integer& a ) const
{
  int sign;
  if (a <0) { sign =-1; r = Integer(-a);}
  else { r = Integer(a); sign =1; }
  if (r >=_p) Integer::modin(r,_p);
  if (!isZero(r) && (sign ==-1)) Integer::sub(r, _p, r);
  return r;
}

inline ZpzDom<Integer>::Rep& ZpzDom<Integer>::init( Rep& a, const int i) const { return init(a,(long)i); }

inline ZpzDom<Integer>::Rep& ZpzDom<Integer>::init( Rep& a, const unsigned int i) const { return init(a,(unsigned long)i); }


inline void ZpzDom<Integer>::assign
  ( const size_t sz, Array r, constArray a ) const
{
  for ( size_t i=sz ; --i ; ) {
    if (a[i] <ZpzDom<Integer>::zero) {
	    Integer::add(r[i], a[i], _p);
       if (r[i] <ZpzDom<Integer>::zero) Integer::modin(r[i], _p);
    }
    else if (a[i] >_p) {
	    Integer::sub(r[i],a[i],_p);
       if (r[i] >=_p) Integer::modin(r[i],_p);
    }
    else r[i] = a[i];
  }
}

inline  ZpzDom<Integer>::Rep&  ZpzDom<Integer>::assign ( Rep& r, const long a ) const
{
  return r = Rep(a);
}

inline  ZpzDom<Integer>::Rep&  ZpzDom<Integer>::assign ( Rep& r, const short a ) const
{ return ZpzDom<Integer>::assign( r, (long)a); }

inline  ZpzDom<Integer>::Rep&  ZpzDom<Integer>::assign ( Rep& r, const unsigned long a ) const
{ return r = Rep(a); }

inline  ZpzDom<Integer>::Rep&  ZpzDom<Integer>::assign
  ( Rep& r, const unsigned short a ) const
{ return r = Rep(a); }

inline  ZpzDom<Integer>::Rep&  ZpzDom<Integer>::assign
  ( Rep& r, const Rep& a ) const
{ return r=a; }


inline void ZpzDom<Integer>::init
  ( const size_t sz, Array r, constArray a ) const
{
  for ( size_t i=sz ; --i ; )
       r[i] = a[i];
}

inline ZpzDom<Integer>::Rep& ZpzDom<Integer>::init ( Rep& r ) const
{ return r = zero; }


template< class RandIter >
inline  ZpzDom<Integer>::Rep& ZpzDom<Integer>::random(RandIter& g, Rep& a) const {
	        return init(a, g());
}

template< class RandIter >
inline  ZpzDom<Integer>::Rep& ZpzDom<Integer>::random(RandIter& g, Rep& a, const Rep& b) const {
	        Integer::random(a,b);
                return Integer::modin(a,_p);
}
template< class RandIter >
inline  ZpzDom<Integer>::Rep& ZpzDom<Integer>::random(RandIter& g, Rep& a, long b) const {
	        Integer::random(a,b);
	        return Integer::modin(a,_p);

}

template< class RandIter >
inline  ZpzDom<Integer>::Rep& ZpzDom<Integer>::nonzerorandom(RandIter& g, Rep& a) const {
	        while (isZero( random(g,a) )) {};
		return a;
}

template< class RandIter >
inline  ZpzDom<Integer>::Rep& ZpzDom<Integer>::nonzerorandom(RandIter& g, Rep& a, const Rep& b) const {
	        while (isZero( random(g,a,b))) {};
		return a;
}

template< class RandIter >
inline  ZpzDom<Integer>::Rep& ZpzDom<Integer>::nonzerorandom(RandIter& g, Rep& a, long b) const {
	        while (isZero( random(g,a,b))) {};
		return a;
}


  //  a -> r: int32_t to double
inline void
  ZpzDom<Integer>::i2d ( const size_t sz, double* r, constArray a ) const
{
  for (size_t i=0; i<sz; ++i) r[i] = a[i];
}

  //  a -> r: double to int32_t
inline void
  ZpzDom<Integer>::d2i ( const size_t sz, Array r, const double* a ) const
{
  union d_2_l {
    double d;
    int32_t r[2];
  };
//  static const double offset = 4503599627370496.0; // 2^52
  double offset = 4503599627370496.0; // 2^52
  for (size_t i=0; i<sz; ++i)
  {
       d_2_l tmp;
      // - normalization: put fractional part at the end of the representation
      tmp.d = a[i] + offset;
      r[i] = tmp.r[1];
      if (r[i] <_p) Integer::modin(r[i],_p);
  }
  //    r[i] = (tmp.r[1] <_p ? tmp.r[1] : tmp.r[1]-_p);
  //    r[i] = (r[i] <_p ? r[i] : r[i]%_p);
  //    r[i] = (tmp.r[1] <_p ? tmp.r[1] : tmp.r[1]%_p);
}



 // -- Input: (z, <_p>)
inline std::istream& ZpzDom<Integer>::read (std::istream& s)
{
  char ch;
  s >> std::ws >> ch;
  if (ch != '(')
//    GivError::throw_error( GivBadFormat("ZpzDom<Integer>::read: syntax error: no '('"));
    std::cerr << "GivBadFormat(ZpzDom<Integer>::read: syntax error: no '('))" << std::endl;

  s >> std::ws >> ch;
  if (ch != 'z')
//    GivError::throw_error( GivBadFormat("ZpzDom<Integer>::read: bad domain object"));
    std::cerr << "GivBadFormat(ZpzDom<Integer>::read: bad domain object))" << std::endl;

  s >> std::ws >> ch;
  if (ch != ',')
//    GivError::throw_error( GivBadFormat("ZpzDom<Integer>::read: syntax error: no ','"));
    std::cerr << "GivBadFormat(ZpzDom<Integer>::read: syntax error: no ',')) " << std::endl;

  s >> std::ws >> _p;

  s >> std::ws >> ch;
  if (ch != ')')
//    GivError::throw_error( GivBadFormat("ZpzDom<Integer>::read: syntax error: no ')'"));
    std::cerr << "GivBadFormat(ZpzDom<Integer>::read: syntax error: no ')')) " << std::endl;

  return s;
}

inline std::ostream& ZpzDom<Integer>::write (std::ostream& s ) const
{
  return s << "Arbitrary length (z," << residu() << ')';
}

inline std::istream& ZpzDom<Integer>::read (std::istream& s, Rep& a) const
{
  s >> a;
  init(a, a);
  return s;
}

inline std::ostream& ZpzDom<Integer>::write (std::ostream& s, const Rep& a) const
{
  return s << a;
}

} // namespace Givaro

#endif // __GIVARO_zpz_int_INL
// vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,\:0,t0,+0,=s