Changeset 9bb5457 in git for libpolys/coeffs


Ignore:
Timestamp:
May 27, 2011, 2:56:51 PM (13 years ago)
Author:
Hans Schoenemann <hannes@…>
Branches:
(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
Children:
2c7f28850c274452c6d4f324225864e2331412ed
Parents:
7af488ec51790060979537b35a03fb345e053f90
git-author:
Hans Schoenemann <hannes@mathematik.uni-kl.de>2011-05-27 14:56:51+02:00
git-committer:
Mohamed Barakat <mohamed.barakat@rwth-aachen.de>2011-11-09 12:39:06+01:00
Message:
fixed warning about unused paramaters in coeffs
Location:
libpolys/coeffs
Files:
6 edited

Legend:

Unmodified
Added
Removed

  • libpolys/coeffs/gnumpc.cc

    r7af488e r9bb5457  
    3030#ifdef LDEBUG
    3131// not yet implemented
    32 BOOLEAN ngcDBTest(number a, const char *f, const int l, const coeffs r)
     32BOOLEAN ngcDBTest(number, const char *, const int, const coeffs r)
    3333{
    3434  assume( getCoeffType(r) == ID );
    … …  
    5454{
    5555  assume( getCoeffType(r) == ID );
    56  
     56
    5757  gmp_complex* n= new gmp_complex( (long)i, (long)0 );
    58  
     58
    5959  return (number)n;
    6060}
    … …  
    6666{
    6767  assume( getCoeffType(r) == ID );
    68  
     68
    6969  return (int)((gmp_complex*)i)->real();
    7070}
    … …  
    105105{
    106106  assume( getCoeffType(r) == ID );
    107  
     107
    108108  gmp_complex* b= new gmp_complex( *(gmp_complex*)a );
    109109  return (number)b;
    … …  
    170170{
    171171  assume( getCoeffType(R) == ID );
    172  
     172
    173173  gmp_complex* r= new gmp_complex( (*(gmp_complex*)a) * (*(gmp_complex*)b) );
    174174  return (number)r;
    … …  
    414414
    415415
    416  
    417 /* 
     416
     417/*
    418418  //r->cfInitChar=nlInitChar;
    419419  r->cfKillChar=NULL;
    … …  
    484484  else
    485485    n->complex_parameter = omStrDup( (char*) p );
    486    
     486
    487487  return FALSE;
    488488}
    … …  
    553553
    554554  if ( from !=  NULL )
    555   { 
     555  {
    556556    b = new gmp_complex( *(gmp_complex*)from );
    557557  }
    558   return (number)b; 
     558  return (number)b;
    559559}
    560560

  • libpolys/coeffs/longrat.cc

    r7af488e r9bb5457  
    151151  assume( getCoeffType(dst) == ID );
    152152  assume( getCoeffType(src) == n_Zp );
    153  
     153
    154154  number to;
    155155  to = nlInit(npInt(from,src), dst);
    … …  
    164164* convert from a GMP integer
    165165*/
    166 number nlMapGMP(number from, const coeffs src, const coeffs dst)
     166number nlMapGMP(number from, const coeffs /*src*/, const coeffs /*dst*/)
    167167{
    168168  number z=ALLOC_RNUMBER();
    … …  
    180180* convert from an machine long
    181181*/
    182 number nlMapMachineInt(number from, const coeffs src, const coeffs dst)
     182number nlMapMachineInt(number from, const coeffs /*src*/, const coeffs /*dst*/)
    183183{
    184184  number z=ALLOC_RNUMBER();
    … …  
    195195
    196196#ifdef LDEBUG
    197 BOOLEAN nlDBTest(number a, const char *f,const int l, const coeffs r)
     197BOOLEAN nlDBTest(number a, const char *f,const int l, const coeffs /*r*/)
    198198{
    199199  if (a==NULL)
    … …  
    284284
    285285#ifdef HAVE_FACTORY
    286 CanonicalForm nlConvSingNFactoryN( number n, BOOLEAN setChar, const coeffs r )
     286CanonicalForm nlConvSingNFactoryN( number n, BOOLEAN setChar, const coeffs /*r*/ )
    287287{
    288288  if (setChar) setCharacteristic( 0 );
    … …  
    345345  assume( getCoeffType(dst) == ID );
    346346  assume( getCoeffType(src) == n_R );
    347  
     347
    348348  double f=nrFloat(from);
    349349  if (f==0.0) return INT_TO_SR(0);
    … …  
    372372}
    373373
    374 static number nlMapLongR(number from, const coeffs src, const coeffs dst) 
     374static number nlMapLongR(number from, const coeffs src, const coeffs dst)
    375375{
    376376  assume( getCoeffType(dst) == ID );
    377377  assume( getCoeffType(src) == n_long_R );
    378  
     378
    379379  gmp_float *ff=(gmp_float*)from;
    380380  mpf_t *f=ff->_mpfp();
    … …  
    522522     return 1; /* immidiate int */
    523523  int s=a->z[0]._mp_alloc;
    524 //  while ((s>0) &&(a->z._mp_d[s]==0L)) s--; 
     524//  while ((s>0) &&(a->z._mp_d[s]==0L)) s--;
    525525//#if SIZEOF_LONG == 8
    526526//  if (a->z._mp_d[s] < (unsigned long)0x100000000L) s=s*2-1;
    … …  
    531531  {
    532532    int d=a->n[0]._mp_alloc;
    533 //    while ((d>0) && (a->n._mp_d[d]==0L)) d--; 
     533//    while ((d>0) && (a->n._mp_d[d]==0L)) d--;
    534534//#if SIZEOF_LONG == 8
    535535//    if (a->n._mp_d[d] < (unsigned long)0x100000000L) d=d*2-1;
    … …  
    19711971  assume( getCoeffType(dst) == ID );
    19721972  assume( getCoeffType(src) == ID );
    1973  
     1973
    19741974  if ((SR_HDL(a) & SR_INT)||(a==NULL))
    19751975  {
    … …  
    19831983  assume( getCoeffType(dst) == ID );
    19841984//  assume( getCoeffType(src) == ID );
    1985  
     1985
    19861986  if (nCoeff_is_Q(src))
    19871987  {
    … …  
    23642364    nlTest(u, R);
    23652365    return u;
    2366    
     2366
    23672367  }
    23682368  number u = _nlMult_aNoImm_OR_bNoImm(a, b);
    23692369  nlTest(u, R);
    23702370  return u;
    2371  
     2371
    23722372}
    23732373
    … …  
    23912391  nlTest(u, r);
    23922392  return u;
    2393  
     2393
    23942394}
    23952395
    … …  
    25392539}
    25402540
    2541 void    nlCoeffWrite  (const coeffs r)
     2541void    nlCoeffWrite  (const coeffs)
    25422542{
    25432543  PrintS("//   characteristic : 0\n");
    25442544}
    25452545
    2546 BOOLEAN nlInitChar(coeffs r, void* p)
     2546BOOLEAN nlInitChar(coeffs r, void*)
    25472547{
    25482548  assume( getCoeffType(r) == ID );
    25492549  //const int ch = (int)(long)(p);
    2550  
     2550
    25512551  r->cfKillChar=NULL;
    25522552  r->cfSetChar=NULL;
    … …  
    26092609  r->has_simple_Alloc=FALSE;
    26102610  r->has_simple_Inverse=FALSE;
    2611  
     2611
    26122612  // variables for this type of coeffs:
    26132613  // (none)

  • libpolys/coeffs/numbers.cc

    r7af488e r9bb5457  
    5252
    5353void   nNew(number* d) { *d=NULL; }
    54 void   ndDelete(number* d, const coeffs r) { *d=NULL; }
     54void   ndDelete(number* d, const coeffs) { *d=NULL; }
    5555void   ndInpMult(number &a, number b, const coeffs r)
    5656{
    … …  
    6767
    6868#ifdef LDEBUG
    69 void   nDBDummy1(number* d,char *f, int l) { *d=NULL; }
    70 BOOLEAN ndDBTest(number a, const char *f, const int l, const coeffs r)
     69void   nDBDummy1(number* d,char *, int) { *d=NULL; }
     70BOOLEAN ndDBTest(number, const char *, const int, const coeffs)
    7171{
    7272  return TRUE;
    … …  
    9090}
    9191
    92 void   ndNormalize(number& d, const coeffs r) { }
    93 
    94 char * ndName(number n, const coeffs r) { return NULL; }
    95 
    96 number ndPar(int i, const coeffs r) { return n_Init(0,r); }
    97 
    98 number ndReturn0(number n, const coeffs r) { return n_Init(0,r); }
    99 
    100 int    ndParDeg(number n, const coeffs r) { return 0; }
     92void   ndNormalize(number&, const coeffs) { }
     93
     94char * ndName(number, const coeffs) { return NULL; }
     95
     96number ndPar(int, const coeffs r) { return n_Init(0,r); }
     97
     98number ndReturn0(number, const coeffs r) { return n_Init(0,r); }
     99
     100int    ndParDeg(number, const coeffs) { return 0; }
    101101
    102102number ndGcd(number, number, const coeffs r) { return n_Init(1,r); }
    … …  
    122122
    123123#ifdef HAVE_RINGS
    124 BOOLEAN ndDivBy(number a, number b, const coeffs r) { return TRUE; } // assume a,b !=0
    125 int ndDivComp(number a, number b, const coeffs r) { return 2; }
     124BOOLEAN ndDivBy(number, number, const coeffs) { return TRUE; } // assume a,b !=0
     125int ndDivComp(number, number, const coeffs) { return 2; }
    126126BOOLEAN ndIsUnit(number a, const coeffs r) { return !n_IsZero(a,r); }
    127 number  ndExtGcd (number a, number b, number *s, number *t, const coeffs r) { return n_Init(1,r); }
     127number  ndExtGcd (number, number, number *, number *, const coeffs r) { return n_Init(1,r); }
    128128#endif
    129129
    130130#ifdef HAVE_FACTORY
    131 CanonicalForm ndConvSingNFactoryN( number n, BOOLEAN setChar, const coeffs r )
     131CanonicalForm ndConvSingNFactoryN( number, BOOLEAN /*setChar*/, const coeffs)
    132132{
    133133  CanonicalForm term(0);
    … …  
    136136}
    137137
    138 number ndConvFactoryNSingN( const CanonicalForm n, const coeffs r)
     138number ndConvFactoryNSingN( const CanonicalForm, const coeffs)
    139139{
    140140  Werror("no conversion from factory");

  • libpolys/coeffs/rintegers.cc

    r7af488e r9bb5457  
    3030 * Multiply two numbers
    3131 */
    32 number nrzMult (number a, number b, const coeffs r)
     32number nrzMult (number a, number b, const coeffs)
    3333{
    3434  int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
    … …  
    4141 * Give the smallest non unit k, such that a * x = k = b * y has a solution
    4242 */
    43 number nrzLcm (number a,number b,const coeffs r)
     43number nrzLcm (number a,number b,const coeffs)
    4444{
    4545  int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
    … …  
    5353 * a solution.
    5454 */
    55 number nrzGcd (number a,number b,const coeffs r)
     55number nrzGcd (number a,number b,const coeffs)
    5656{
    5757  int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
    … …  
    6565 * a solution and r, s, s.t. k = s*a + t*b
    6666 */
    67 number  nrzExtGcd (number a, number b, number *s, number *t, const coeffs r)
     67number  nrzExtGcd (number a, number b, number *s, number *t, const coeffs)
    6868{
    6969  int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
    … …  
    7979}
    8080
    81 void nrzPower (number a, int i, number * result, const coeffs r)
     81void nrzPower (number a, int i, number * result, const coeffs)
    8282{
    8383  int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
    … …  
    9090 * create a number from int
    9191 */
    92 number nrzInit (int i, const coeffs r)
     92number nrzInit (int i, const coeffs)
    9393{
    9494  int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
    … …  
    9797}
    9898
    99 void nrzDelete(number *a, const coeffs r)
     99void nrzDelete(number *a, const coeffs)
    100100{
    101101  if (*a == NULL) return;
    … …  
    105105}
    106106
    107 number nrzCopy(number a, const coeffs r)
     107number nrzCopy(number a, const coeffs)
    108108{
    109109  int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
    … …  
    112112}
    113113
    114 number nrzCopyMap(number a, const coeffs src, const coeffs dst)
     114number nrzCopyMap(number a, const coeffs /*src*/, const coeffs dst)
    115115{
    116116  return nrzCopy(a,dst);
    117117}
    118118
    119 int nrzSize(number a, const coeffs r)
     119int nrzSize(number a, const coeffs)
    120120{
    121121  if (a == NULL) return 0;
    … …  
    126126 * convert a number to int
    127127 */
    128 int nrzInt(number &n, const coeffs r)
     128int nrzInt(number &n, const coeffs)
    129129{
    130130  return (int) mpz_get_si( (int_number)n);
    131131}
    132132
    133 number nrzAdd (number a, number b, const coeffs r)
     133number nrzAdd (number a, number b, const coeffs)
    134134{
    135135  int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
    … …  
    139139}
    140140
    141 number nrzSub (number a, number b, const coeffs r)
     141number nrzSub (number a, number b, const coeffs)
    142142{
    143143  int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
    … …  
    147147}
    148148
    149 number  nrzGetUnit (number a, const coeffs r)
     149number  nrzGetUnit (number, const coeffs r)
    150150{
    151151  return nrzInit(1, r);
    152152}
    153153
    154 BOOLEAN nrzIsUnit (number a, const coeffs r)
     154BOOLEAN nrzIsUnit (number a, const coeffs)
    155155{
    156156  return 0 == mpz_cmpabs_ui((int_number) a, 1);
    157157}
    158158
    159 BOOLEAN nrzIsZero (number  a, const coeffs r)
     159BOOLEAN nrzIsZero (number  a, const coeffs)
    160160{
    161161  return 0 == mpz_cmpabs_ui((int_number) a, 0);
    162162}
    163163
    164 BOOLEAN nrzIsOne (number a, const coeffs r)
     164BOOLEAN nrzIsOne (number a, const coeffs)
    165165{
    166166  return (a!=NULL) && (0 == mpz_cmp_si((int_number) a, 1));
    167167}
    168168
    169 BOOLEAN nrzIsMOne (number a, const coeffs r)
     169BOOLEAN nrzIsMOne (number a, const coeffs)
    170170{
    171171  return (a!=NULL) && (0 == mpz_cmp_si((int_number) a, -1));
    172172}
    173173
    174 BOOLEAN nrzEqual (number a,number b, const coeffs r)
     174BOOLEAN nrzEqual (number a,number b, const coeffs)
    175175{
    176176  return 0 == mpz_cmp((int_number) a, (int_number) b);
    177177}
    178178
    179 BOOLEAN nrzGreater (number a,number b, const coeffs r)
     179BOOLEAN nrzGreater (number a,number b, const coeffs)
    180180{
    181181  return 0 < mpz_cmp((int_number) a, (int_number) b);
    182182}
    183183
    184 BOOLEAN nrzGreaterZero (number k, const coeffs r)
     184BOOLEAN nrzGreaterZero (number k, const coeffs)
    185185{
    186186  return 0 < mpz_cmp_si((int_number) k, 0);
    … …  
    198198}
    199199
    200 BOOLEAN nrzDivBy (number a,number b, const coeffs r)
     200BOOLEAN nrzDivBy (number a,number b, const coeffs)
    201201{
    202202  return mpz_divisible_p((int_number) a, (int_number) b) != 0;
    … …  
    220220}
    221221
    222 number nrzIntDiv (number a,number b, const coeffs r)
     222number nrzIntDiv (number a,number b, const coeffs)
    223223{
    224224  int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
    … …  
    228228}
    229229
    230 number nrzIntMod (number a,number b, const coeffs R)
     230number nrzIntMod (number a,number b, const coeffs)
    231231{
    232232  int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
    … …  
    249249}
    250250
    251 number nrzNeg (number c, const coeffs r)
     251number nrzNeg (number c, const coeffs)
    252252{
    253253// nNeg inplace !!!
    … …  
    256256}
    257257
    258 number nrzMapMachineInt(number from, const coeffs src, const coeffs dst)
     258number nrzMapMachineInt(number from, const coeffs /*src*/, const coeffs /*dst*/)
    259259{
    260260  int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
    … …  
    263263}
    264264
    265 number nrzMapZp(number from, const coeffs src, const coeffs dst)
     265number nrzMapZp(number from, const coeffs /*src*/, const coeffs /*dst*/)
    266266{
    267267  int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
    … …  
    270270}
    271271
    272 number nrzMapQ(number from, const coeffs src, const coeffs dst)
     272number nrzMapQ(number from, const coeffs src, const coeffs /*dst*/)
    273273{
    274274  int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
    … …  
    305305 */
    306306
    307 void nrzSetExp(int m, coeffs r)
    308 {
    309 }
    310 
    311 void nrzInitExp(int m, coeffs r)
     307void nrzSetExp(int, coeffs)
     308{
     309}
     310
     311void nrzInitExp(int, coeffs)
    312312{
    313313}
    314314
    315315#ifdef LDEBUG
    316 BOOLEAN nrzDBTest (number a, const char *f, const int l, const coeffs r)
     316BOOLEAN nrzDBTest (number, const char *, const int, const coeffs)
    317317{
    318318  return TRUE;//TODO
    … …  
    320320#endif
    321321
    322 void nrzWrite (number &a, const coeffs r)
     322void nrzWrite (number &a, const coeffs)
    323323{
    324324  char *s,*z;
    … …  
    364364}
    365365
    366 const char * nrzRead (const char *s, number *a, const coeffs r)
     366const char * nrzRead (const char *s, number *a, const coeffs)
    367367{
    368368  int_number z = (int_number) omAllocBin(gmp_nrz_bin);
    … …  
    375375}
    376376
    377 void    nrzCoeffWrite  (const coeffs r)
     377void    nrzCoeffWrite  (const coeffs)
    378378{
    379379  PrintS("//   characteristic : 0 (Integers)\n");
    … …  
    381381
    382382
    383 BOOLEAN nrzInitChar(coeffs r,  void * parameter)
     383BOOLEAN nrzInitChar(coeffs r,  void *)
    384384{
    385385  assume( getCoeffType(r) == ID );
    … …  
    426426  r->cfDBTest=nrzDBTest;
    427427#endif
    428  
     428
    429429  r->nNULL = 0;
    430430  r->ch = 0;
    431431  r->ringtype = 4;
    432432  r->has_simple_Alloc=FALSE;
    433   r->has_simple_Inverse=FALSE; 
     433  r->has_simple_Inverse=FALSE;
    434434  return FALSE;
    435435}

  • libpolys/coeffs/rmodulo2m.cc

    r7af488e r9bb5457  
    5353
    5454  r->ringtype = 1;
    55  
     55
    5656  /* next cast may yield an overflow as mod2mMask is an unsigned long */
    5757  r->ch = (int)r->mod2mMask + 1;
    … …  
    110110 * Give the smallest k, such that a * x = k = b * y has a solution
    111111 */
    112 number nr2mLcm(number a, number b, const coeffs r)
     112number nr2mLcm(number a, number b, const coeffs)
    113113{
    114114  NATNUMBER res = 0;
    … …  
    133133 * a solution.
    134134 */
    135 number nr2mGcd(number a, number b, const coeffs r)
     135number nr2mGcd(number a, number b, const coeffs)
    136136{
    137137  NATNUMBER res = 0;
    … …  
    240240}
    241241
    242 BOOLEAN nr2mIsUnit(number a, const coeffs r)
     242BOOLEAN nr2mIsUnit(number a, const coeffs)
    243243{
    244244  return ((NATNUMBER)a % 2 == 1);
    245245}
    246246
    247 number nr2mGetUnit(number k, const coeffs r)
     247number nr2mGetUnit(number k, const coeffs)
    248248{
    249249  if (k == NULL) return (number)1;
    … …  
    253253}
    254254
    255 BOOLEAN nr2mIsZero(number a, const coeffs r)
     255BOOLEAN nr2mIsZero(number a, const coeffs)
    256256{
    257257  return 0 == (NATNUMBER)a;
    258258}
    259259
    260 BOOLEAN nr2mIsOne(number a, const coeffs r)
     260BOOLEAN nr2mIsOne(number a, const coeffs)
    261261{
    262262  return 1 == (NATNUMBER)a;
    … …  
    268268}
    269269
    270 BOOLEAN nr2mEqual(number a, number b, const coeffs r)
     270BOOLEAN nr2mEqual(number a, number b, const coeffs)
    271271{
    272272  return (a == b);
    … …  
    310310}
    311311
    312 int nr2mDivComp(number as, number bs, const coeffs r)
     312int nr2mDivComp(number as, number bs, const coeffs)
    313313{
    314314  NATNUMBER a = (NATNUMBER)as;
    … …  
    474474  NATNUMBER g = 1;
    475475  NATNUMBER b_div = (NATNUMBER)b;
    476   if (b_div < 0) b_div = -b_div; // b_div now represents |b|
     476  if (b_div < 0) b_div = -b_div; // b_div now represents |b|, BUT b_div is unsigned!
    477477  NATNUMBER rr = 0;
    478478  while ((g < r->mod2mMask ) && (b_div > 0) && (b_div % 2 == 0))
    … …  
    532532}
    533533
    534 number nr2mMapMachineInt(number from, const coeffs src, const coeffs dst)
     534number nr2mMapMachineInt(number from, const coeffs /*src*/, const coeffs dst)
    535535{
    536536  NATNUMBER i = ((NATNUMBER)from) % dst->mod2mMask ;
    … …  
    538538}
    539539
    540 number nr2mMapZp(number from, const coeffs src, const coeffs dst)
     540number nr2mMapZp(number from, const coeffs /*src*/, const coeffs dst)
    541541{
    542542  NATNUMBER j = (NATNUMBER)1;
    … …  
    549549}
    550550
    551 number nr2mMapQ(number from, const coeffs src, const coeffs dst)
     551number nr2mMapQ(number from, const coeffs /*src*/, const coeffs dst)
    552552{
    553553  int_number erg = (int_number)omAllocBin(gmp_nrz_bin);
    … …  
    566566}
    567567
    568 number nr2mMapGMP(number from, const coeffs src, const coeffs dst)
     568number nr2mMapGMP(number from, const coeffs /*src*/, const coeffs dst)
    569569{
    570570  int_number erg = (int_number)omAllocBin(gmp_nrz_bin);
    … …  
    659659
    660660#ifdef LDEBUG
    661 BOOLEAN nr2mDBTest (number a, const char *f, const int l, const coeffs r)
    662 {
    663   if ((NATNUMBER)a < 0) return FALSE;
     661BOOLEAN nr2mDBTest (number a, const char *, const int, const coeffs r)
     662{
     663  //if ((NATNUMBER)a < 0) return FALSE; // is unsigned!
    664664  if (((NATNUMBER)a & r->mod2mMask) != (NATNUMBER)a) return FALSE;
    665665  return TRUE;

  • libpolys/coeffs/rmodulon.cc

    r7af488e r9bb5457  
    5151  nrnInitExp((int)(long)(p), r);
    5252  r->ringtype = 2;
    53  
     53
    5454  /* next computation may yield wrong characteristic as r->modNumber
    5555     is a GMP number */
    … …  
    108108}
    109109
    110 void nrnDelete(number *a, const coeffs r)
     110void nrnDelete(number *a, const coeffs)
    111111{
    112112  if (*a == NULL) return;
    … …  
    116116}
    117117
    118 number nrnCopy(number a, const coeffs r)
     118number nrnCopy(number a, const coeffs)
    119119{
    120120  int_number erg = (int_number) omAllocBin(gmp_nrz_bin);
    … …  
    123123}
    124124
    125 int nrnSize(number a, const coeffs r)
     125int nrnSize(number a, const coeffs)
    126126{
    127127  if (a == NULL) return 0;
    … …  
    132132 * convert a number to int
    133133 */
    134 int nrnInt(number &n, const coeffs r)
     134int nrnInt(number &n, const coeffs)
    135135{
    136136  return (int)mpz_get_si((int_number) n);
    … …  
    179179  if( !nrnIsZero(c, r) )
    180180    // Attention: This method operates in-place.
    181     mpz_sub((int_number)c, r->modNumber, (int_number)c); 
     181    mpz_sub((int_number)c, r->modNumber, (int_number)c);
    182182  return c;
    183183}
    … …  
    253253}
    254254
    255 BOOLEAN nrnIsZero(number a, const coeffs r)
     255BOOLEAN nrnIsZero(number a, const coeffs)
    256256{
    257257#ifdef LDEBUG
    … …  
    261261}
    262262
    263 BOOLEAN nrnIsOne(number a, const coeffs r)
     263BOOLEAN nrnIsOne(number a, const coeffs)
    264264{
    265265#ifdef LDEBUG
    … …  
    281281}
    282282
    283 BOOLEAN nrnEqual(number a, number b, const coeffs r)
     283BOOLEAN nrnEqual(number a, number b, const coeffs)
    284284{
    285285  return 0 == mpz_cmp((int_number)a, (int_number)b);
    286286}
    287287
    288 BOOLEAN nrnGreater(number a, number b, const coeffs r)
     288BOOLEAN nrnGreater(number a, number b, const coeffs)
    289289{
    290290  return 0 < mpz_cmp((int_number)a, (int_number)b);
    291291}
    292292
    293 BOOLEAN nrnGreaterZero(number k, const coeffs r)
     293BOOLEAN nrnGreaterZero(number k, const coeffs)
    294294{
    295295  return 0 < mpz_cmp_si((int_number)k, 0);
    … …  
    443443int_number nrnMapCoef = NULL;
    444444
    445 number nrnMapModN(number from, const coeffs src, const coeffs dst)
     445number nrnMapModN(number from, const coeffs /*src*/, const coeffs dst)
    446446{
    447447  return nrnMult(from, (number) nrnMapCoef, dst);
    448448}
    449449
    450 number nrnMap2toM(number from, const coeffs src, const coeffs dst)
     450number nrnMap2toM(number from, const coeffs /*src*/, const coeffs dst)
    451451{
    452452  int_number erg = (int_number)omAllocBin(gmp_nrz_bin);
    … …  
    457457}
    458458
    459 number nrnMapZp(number from, const coeffs src, const coeffs dst)
     459number nrnMapZp(number from, const coeffs /*src*/, const coeffs dst)
    460460{
    461461  int_number erg = (int_number)omAllocBin(gmp_nrz_bin);
    … …  
    467467}
    468468
    469 number nrnMapGMP(number from, const coeffs src, const coeffs dst)
     469number nrnMapGMP(number from, const coeffs /*src*/, const coeffs dst)
    470470{
    471471  int_number erg = (int_number)omAllocBin(gmp_nrz_bin);
    … …  
    475475}
    476476
    477 number nrnMapQ(number from, const coeffs src, const coeffs dst)
     477number nrnMapQ(number from, const coeffs src, const coeffs /*dst*/)
    478478{
    479479  int_number erg = (int_number)omAllocBin(gmp_nrz_bin);
    … …  
    590590
    591591#ifdef LDEBUG
    592 BOOLEAN nrnDBTest (number a, const char *f, const int l, const coeffs r)
     592BOOLEAN nrnDBTest (number a, const char *, const int, const coeffs r)
    593593{
    594594  if (a==NULL) return TRUE;
Note: See TracChangeset for help on using the changeset viewer.