numbers.cc File Reference

#include <string.h>
#include <stdlib.h>
#include "misc/auxiliary.h"
#include "misc/mylimits.h"
#include "factory/factory.h"
#include "reporter/reporter.h"
#include "coeffs/coeffs.h"
#include "coeffs/numbers.h"
#include "coeffs/longrat.h"
#include "coeffs/modulop.h"
#include "coeffs/gnumpfl.h"
#include "coeffs/gnumpc.h"
#include "coeffs/ffields.h"
#include "coeffs/shortfl.h"
#include "coeffs/ntupel.h"
#include "coeffs/flintcf_Qrat.h"
#include "coeffs/rmodulo2m.h"
#include "coeffs/rmodulon.h"
#include "coeffs/rintegers.h"
#include "polys/ext_fields/algext.h"
#include "polys/ext_fields/transext.h"

Go to the source code of this file.

Data Structures
struct	nFindCoeffByName_p

Functions
static void	ndDelete (number *d, const coeffs)
static number	ndAnn (number, const coeffs cf)
static char *	ndCoeffString (const coeffs r)
static void	ndCoeffWrite (const coeffs r, BOOLEAN)
static char *	ndCoeffName (const coeffs r)
static void	ndInpMult (number &a, number b, const coeffs r)
static void	ndInpAdd (number &a, number b, const coeffs r)
static void	ndPower (number a, int i, number *res, const coeffs r)
static number	ndInvers (number a, const coeffs r)
static number	ndInvers_Ring (number a, const coeffs r)
static BOOLEAN	ndIsUnit_Ring (number a, const coeffs r)
static BOOLEAN	ndIsUnit_Field (number a, const coeffs r)
static number	ndGetUnit_Ring (number, const coeffs r)
static number	ndRandom (siRandProc p, number, number, const coeffs cf)
static number	ndEucNorm (number a, const coeffs cf)
static BOOLEAN	ndDBTest (number, const char *, const int, const coeffs)
static number	ndFarey (number, number, const coeffs r)
static number	ndXExtGcd (number, number, number *, number *, number *, number *, const coeffs r)
static number	ndChineseRemainder (number *, number *, int, BOOLEAN, CFArray &, const coeffs r)
number	ndReadFd (const ssiInfo *, const coeffs r)
static void	ndWriteFd (number, const ssiInfo *, const coeffs r)
static int	ndParDeg (number n, const coeffs r)
static number	ndParameter (const int, const coeffs r)
BOOLEAN	n_IsZeroDivisor (number a, const coeffs r)
	Test whether a is a zero divisor in r i.e. not coprime with char. of r very inefficient implementation: should ONLY be used for debug stuff /tests. More...
void	ndNormalize (number &, const coeffs)
static number	ndReturn0 (number, const coeffs r)
number	ndGcd (number, number, const coeffs r)
static number	ndIntMod (number a, number b, const coeffs R)
static number	ndGetDenom (number &, const coeffs r)
static number	ndGetNumerator (number &a, const coeffs r)
static int	ndSize (number a, const coeffs r)
static void	ndClearContent (ICoeffsEnumerator &numberCollectionEnumerator, number &c, const coeffs r)
static void	ndClearDenominators (ICoeffsEnumerator &, number &d, const coeffs r)
number	ndCopyMap (number a, const coeffs aRing, const coeffs r)
static void	ndKillChar (coeffs)
static void	ndSetChar (const coeffs)
static number	ndCopy (number a, const coeffs)
number	nd_Copy (number a, const coeffs r)
static BOOLEAN	ndDivBy (number, number, const coeffs)
static int	ndDivComp (number, number, const coeffs)
static number	ndExtGcd (number, number, number *, number *, const coeffs r)
CanonicalForm	ndConvSingNFactoryN (number, BOOLEAN, const coeffs)
static number	ndConvFactoryNSingN (const CanonicalForm, const coeffs)
	[in, out] a bigint number >= 0 More...
static void	ndMPZ (mpz_t result, number &n, const coeffs r)
	Converts a non-negative bigint number into a GMP number. More...
static number	ndInitMPZ (mpz_t m, const coeffs r)
static const char *	ndRead (const char *s, number *, const coeffs r)
static nMapFunc	ndSetMap (const coeffs src, const coeffs dst)
static BOOLEAN	ndCoeffIsEqual (const coeffs r, n_coeffType n, void *)
number	ndQuotRem (number a, number b, number *r, const coeffs R)
coeffs	nInitChar (n_coeffType t, void *parameter)
	one-time initialisations for new coeffs in case of an error return NULL More...
void	nKillChar (coeffs r)
	undo all initialisations More...
n_coeffType	nRegister (n_coeffType n, cfInitCharProc p)
void	nRegisterCfByName (cfInitCfByNameProc p, n_coeffType n)
coeffs	nFindCoeffByName (char *cf_name)
	find an existing coeff by its "CoeffName" More...
void	n_Print (number &a, const coeffs r)
	print a number (BEWARE of string buffers!) mostly for debugging More...
char *	nEati (char *s, int *i, int m)
	divide by the first (leading) number and return it, i.e. make monic More...
char *	nEati (char *s, long *i, int m)
char *	nEatLong (char *s, mpz_ptr i)
	extracts a long integer from s, returns the rest More...

Variables
VAR n_Procs_s *	cf_root =NULL
STATIC_VAR n_coeffType	nLastCoeffs =n_CF
VAR cfInitCharProc	nInitCharTableDefault []
STATIC_VAR cfInitCharProc *	nInitCharTable =nInitCharTableDefault
VAR nFindCoeffByName_p	nFindCoeffByName_Root =NULL

---

Data Structure Documentation

nFindCoeffByName_s

struct nFindCoeffByName_s

Definition at line 628 of file numbers.cc.

Data Fields
n_coeffType	n
nFindCoeffByName_p	next
cfInitCfByNameProc	p

Function Documentation

n_IsZeroDivisor()

BOOLEAN n_IsZeroDivisor	(	number	a,
		const coeffs	r
	)

Test whether a is a zero divisor in r i.e. not coprime with char. of r very inefficient implementation: should ONLY be used for debug stuff /tests.

Definition at line 173 of file numbers.cc.

{
  BOOLEAN ret = n_IsZero(a, r);
  int c = n_GetChar(r);
  if (ret || (c==0) || (r->is_field))
    return ret; /*n_IsZero(a, r)*/
  number ch = n_Init( c, r );
  number g = n_Gcd( ch, a, r );
  ret = !n_IsOne (g, r);
  n_Delete(&ch, r);
  n_Delete(&g, r);
  return ret;
}

n_Print()

void n_Print	(	number &	a,
		const coeffs	r
	)

print a number (BEWARE of string buffers!) mostly for debugging

Definition at line 667 of file numbers.cc.

{
   assume(r != NULL);
   n_Test(a,r);
 
   StringSetS("");
   n_Write(a, r);
   { char* s = StringEndS(); Print("%s", s); omFree(s); }

nd_Copy()

number nd_Copy	(	number	a,
		const coeffs	r
	)

Definition at line 305 of file numbers.cc.

{ return r->cfCopy(a, r); }

ndAnn()

static number ndAnn ( number  , const coeffs  cf  )

static

Definition at line 48 of file numbers.cc.

{ WarnS("cfAnn undefined"); return n_Init(0,cf); }

ndChineseRemainder()

static number ndChineseRemainder ( number *  , number *  , int  , BOOLEAN  , CFArray &  , const coeffs  r  )

static

Definition at line 147 of file numbers.cc.

{
  Werror("ChineseRemainder not implemented for %s (c=%d)",r->cfCoeffName(r),getCoeffType(r));
  return r->cfInit(0,r);
}

ndClearContent()

static void ndClearContent ( ICoeffsEnumerator &  numberCollectionEnumerator, number &  c, const coeffs  r  )

static

TODO: move to a separate implementation

Definition at line 208 of file numbers.cc.

{
  assume(r != NULL);
 
  // no fractions
  assume(!(  nCoeff_is_Q(r) ));
  // all coeffs are given by integers!!!
 
  numberCollectionEnumerator.Reset();
 
  if( !numberCollectionEnumerator.MoveNext() ) // empty zero polynomial?
  {
    c = n_Init(1, r);
    return;
  }
 
  number &curr = numberCollectionEnumerator.Current();
 
#ifdef HAVE_RINGS
  /// TODO: move to a separate implementation
  if (nCoeff_is_Ring(r))
  {
    if (nCoeff_has_Units(r))
    {
      c = n_GetUnit(curr, r);
 
      if (!n_IsOne(c, r))
      {
        number inv = n_Invers(c, r);
 
        n_InpMult(curr, inv, r);
 
        while( numberCollectionEnumerator.MoveNext() )
        {
          number &n = numberCollectionEnumerator.Current();
          n_Normalize(n, r); // ?
          n_InpMult(n, inv, r); // TODO: either this or directly divide!!!?
        }
 
        n_Delete(&inv, r);
      }
    } else c = n_Init(1, r);
 
    return;
  }
#endif
 
  assume(!nCoeff_is_Ring(r));
  assume(nCoeff_is_Zp(r) || nCoeff_is_numeric(r) || nCoeff_is_GF(r) || nCoeff_is_Zp_a(r) || nCoeff_is_Q_algext(r));
 
  n_Normalize(curr, r); // Q: good/bad/ugly??
 
  if (!n_IsOne(curr, r))
  {
    number t = curr; // takes over the curr! note: not a reference!!!
 
    curr = n_Init(1, r); // ???
 
    number inv = n_Invers(t, r);
 
    while( numberCollectionEnumerator.MoveNext() )
    {
      number &n = numberCollectionEnumerator.Current();
      n_InpMult(n, inv, r); // TODO: either this or directly divide!!!?
//      n_Normalize(n, r); // ?
    }
 
    n_Delete(&inv, r);
 
    c = t;
  } else
    c = n_Copy(curr, r); // c == 1 and nothing else to do...
}

ndClearDenominators()

static void ndClearDenominators ( ICoeffsEnumerator &  , number &  d, const coeffs  r  )

static

Definition at line 282 of file numbers.cc.

{
  assume( r != NULL );
  assume( !(nCoeff_is_Q(r) || nCoeff_is_transExt(r) || nCoeff_is_algExt(r)) );
  assume( nCoeff_is_Ring(r) || nCoeff_is_Zp(r) || nCoeff_is_numeric(r) || nCoeff_is_GF(r) );
 
  d = n_Init(1, r);
}

ndCoeffIsEqual()

static BOOLEAN ndCoeffIsEqual ( const coeffs  r, n_coeffType  n, void *    )

static

Definition at line 350 of file numbers.cc.

{
  /* test, if r is an instance of nInitCoeffs(n,parameter) */
  /* if parameter is not needed */
  return (n==r->type);

ndCoeffName()

static char * ndCoeffName ( const coeffs  r )

static

Definition at line 57 of file numbers.cc.

{
  STATIC_VAR char s[20];
  snprintf(s,11,"Coeffs(%d)",r->type);
  return s;
}

ndCoeffString()

static char * ndCoeffString ( const coeffs  r )

static

Definition at line 49 of file numbers.cc.

{
  return omStrDup(r->cfCoeffName(r));
}

ndCoeffWrite()

static void ndCoeffWrite ( const coeffs  r, BOOLEAN    )

static

Definition at line 53 of file numbers.cc.

{
  PrintS(r->cfCoeffName(r));
}

ndConvFactoryNSingN()

static number ndConvFactoryNSingN ( const  CanonicalForm, const  coeffs  )

static

[in, out] a bigint number >= 0

[out] the GMP equivalent

Definition at line 320 of file numbers.cc.

ndConvSingNFactoryN()

CanonicalForm ndConvSingNFactoryN	(	number	,
		BOOLEAN	,
		const	coeffs
	)

Definition at line 313 of file numbers.cc.

{
  CanonicalForm term(0);
  WerrorS("no conversion to factory");
  return term;
}

ndCopy()

static number ndCopy ( number  a, const  coeffs  )

static

Definition at line 304 of file numbers.cc.

{ return a; }

ndCopyMap()

number ndCopyMap	(	number	a,
		const coeffs	aRing,
		const coeffs	r
	)

Definition at line 291 of file numbers.cc.

{
  // aRing and r need not be the same, but must be the same representation
  assume(aRing->rep==r->rep);
  if ( nCoeff_has_simple_Alloc(r) && nCoeff_has_simple_Alloc(aRing) )
    return a;
  else
    return r->cfCopy(a, r);
}

ndDBTest()

static BOOLEAN ndDBTest ( number  , const char *  , const int  , const  coeffs  )

static

Definition at line 134 of file numbers.cc.

{ return TRUE; }

ndDelete()

static void ndDelete ( number *  d, const  coeffs  )

static

Definition at line 47 of file numbers.cc.

{ *d=NULL; }

ndDivBy()

static BOOLEAN ndDivBy ( number  , number  , const  coeffs  )

static

Definition at line 308 of file numbers.cc.

{ return TRUE; } // assume a,b !=0

ndDivComp()

static int ndDivComp ( number  , number  , const  coeffs  )

static

Definition at line 309 of file numbers.cc.

{ return 2; }

ndEucNorm()

static number ndEucNorm ( number  a, const coeffs  cf  )

static

Definition at line 130 of file numbers.cc.

{ return cf->cfInit(cf->cfSize(a,cf),cf); }

ndExtGcd()

static number ndExtGcd ( number  , number  , number *  , number *  , const coeffs  r  )

static

Definition at line 310 of file numbers.cc.

{ return r->cfInit(1,r); }

ndFarey()

static number ndFarey ( number  , number  , const coeffs  r  )

static

Definition at line 137 of file numbers.cc.

{
  Werror("farey not implemented for %s (c=%d)",r->cfCoeffName(r),getCoeffType(r));
  return NULL;
}

ndGcd()

number ndGcd	(	number	a,
		number	b,
		const coeffs	r
	)

Definition at line 189 of file numbers.cc.

{ return r->cfInit(1,r); }

ndGetDenom()

static number ndGetDenom ( number &  , const coeffs  r  )

static

Definition at line 204 of file numbers.cc.

{ return r->cfInit(1,r); }

ndGetNumerator()

static number ndGetNumerator ( number &  a, const coeffs  r  )

static

Definition at line 205 of file numbers.cc.

{ return r->cfCopy(a,r); }

ndGetUnit_Ring()

static number ndGetUnit_Ring ( number  , const coeffs  r  )

static

Definition at line 126 of file numbers.cc.

{ return r->cfInit(1,r); }

ndInitMPZ()

static number ndInitMPZ ( mpz_t  m, const coeffs  r  )

static

Definition at line 333 of file numbers.cc.

{
  return r->cfInit( mpz_get_si(m), r);

ndInpAdd()

static void ndInpAdd ( number &  a, number  b, const coeffs  r  )

static

Definition at line 69 of file numbers.cc.

{
  number n=r->cfAdd(a,b,r);
  r->cfDelete(&a,r);
  a=n;
}

ndInpMult()

static void ndInpMult ( number &  a, number  b, const coeffs  r  )

static

Definition at line 63 of file numbers.cc.

{
  number n=r->cfMult(a,b,r);
  r->cfDelete(&a,r);
  a=n;
}

ndIntMod()

static number ndIntMod ( number  a, number  b, const coeffs  R  )

static

Definition at line 190 of file numbers.cc.

{
  if (R->is_field)
    return R->cfInit(0,R);
  else // implementation for a non-field:
  {
    number d=n_Div(a,b,R);
    number p=n_Mult(b,d,R);
    number r=n_Sub(a,p,R);
    n_Delete(&p,R);
    n_Delete(&d,R);
    return r;
  }
}

ndInvers()

static number ndInvers ( number  a, const coeffs  r  )

static

Definition at line 106 of file numbers.cc.

{
  number one=r->cfInit(1,r);
  number res=r->cfDiv(one,a,r);
  r->cfDelete(&one,r);
  return res;
}

ndInvers_Ring()

static number ndInvers_Ring ( number  a, const coeffs  r  )

static

Definition at line 113 of file numbers.cc.

{
  if (!r->cfIsUnit(a,r)) Print("ndInvers_Ring used with non-unit\n");
  number one=r->cfInit(1,r);
  number res=r->cfDiv(one,a,r);
  r->cfDelete(&one,r);
  return res;
}

ndIsUnit_Field()

static BOOLEAN ndIsUnit_Field ( number  a, const coeffs  r  )

static

Definition at line 124 of file numbers.cc.

{ return !r->cfIsZero(a,r); }

ndIsUnit_Ring()

static BOOLEAN ndIsUnit_Ring ( number  a, const coeffs  r  )

static

Definition at line 122 of file numbers.cc.

{ return r->cfIsOne(a,r)|| r->cfIsMOne(a,r); }

ndKillChar()

static void ndKillChar ( coeffs  )

static

Definition at line 301 of file numbers.cc.

{}

ndMPZ()

static void ndMPZ ( mpz_t  result, number &  n, const coeffs  r  )

static

Converts a non-negative bigint number into a GMP number.

Definition at line 328 of file numbers.cc.

{
  mpz_init_set_si( result, r->cfInt(n, r) );

ndNormalize()

void ndNormalize	(	number &	,
		const	coeffs
	)

Definition at line 187 of file numbers.cc.

{ }

ndParameter()

static number ndParameter ( const int  , const coeffs  r  )

static

Definition at line 168 of file numbers.cc.

{
  return r->cfInit(1,r);
}

ndParDeg()

static int ndParDeg ( number  n, const coeffs  r  )

static

Definition at line 163 of file numbers.cc.

{
  return (-r->cfIsZero(n,r));
}

ndPower()

static void ndPower ( number  a, int  i, number *  res, const coeffs  r  )

static

Definition at line 76 of file numbers.cc.

{
  if (i==0)
  {
    *res = r->cfInit(1, r);
  }
  else if (i==1)
  {
    *res = r->cfCopy(a, r);
  }
  else if (i==2)
  {
    *res = r->cfMult(a, a, r);
  }
  else if (i<0)
  {
    number b = r->cfInvers(a, r);
    ndPower(b, -i, res, r);
    r->cfDelete(&b, r);
  }
  else
  {
    ndPower(a, i/2, res, r);
    r->cfInpMult(*res, *res, r);
    if (i&1)
    {
      r->cfInpMult(*res, a, r);
    }
  }
}

ndQuotRem()

number ndQuotRem	(	number	a,
		number	b,
		number *	r,
		const coeffs	R
	)

Definition at line 357 of file numbers.cc.

{
  // implementation for a field: r: 0, result: n_Div
  if(R->is_field)
  {
    *r=n_Init(0,R);
    return n_Div(a,b,R);
  }
  else
  // implementation for a non-field:
  {
    number d=n_Div(a,b,R);
    number p=n_Mult(b,d,R);
    *r=n_Sub(a,p,R);
    n_Delete(&p,R);
    return d;
  }

ndRandom()

static number ndRandom ( siRandProc  p, number  , number  , const coeffs  cf  )

static

Definition at line 128 of file numbers.cc.

{ return cf->cfInit(p(),cf); }

ndRead()

static const char * ndRead ( const char *  s, number *  , const coeffs  r  )

static

Definition at line 338 of file numbers.cc.

{
  Werror("cfRead is undefined for %s",nCoeffString(r));
  return s;

ndReadFd()

number ndReadFd	(	const ssiInfo *	f,
		const coeffs	r
	)

Definition at line 152 of file numbers.cc.

{
  Warn("ReadFd not implemented for %s (c=%d)",r->cfCoeffName(r),getCoeffType(r));
  return NULL;
}

ndReturn0()

static number ndReturn0 ( number  , const coeffs  r  )

static

Definition at line 188 of file numbers.cc.

{ return r->cfInit(0,r); }

ndSetChar()

static void ndSetChar ( const  coeffs )

static

Definition at line 302 of file numbers.cc.

{}

ndSetMap()

static nMapFunc ndSetMap ( const coeffs  src, const coeffs  dst  )

static

Definition at line 343 of file numbers.cc.

{
  if (src==dst) return ndCopyMap;
  Werror("cfSetMap is undefined for %s",nCoeffString(dst));
  return NULL;

ndSize()

static int ndSize ( number  a, const coeffs  r  )

static

Definition at line 206 of file numbers.cc.

{ return (int)r->cfIsZero(a,r)==FALSE; }

ndWriteFd()

static void ndWriteFd ( number  , const ssiInfo *  , const coeffs  r  )

static

Definition at line 158 of file numbers.cc.

{
  Warn("WriteFd not implemented for %s (c=%d)",r->cfCoeffName(r),getCoeffType(r));
}

ndXExtGcd()

static number ndXExtGcd ( number  , number  , number *  , number *  , number *  , number *  , const coeffs  r  )

static

Definition at line 142 of file numbers.cc.

{
  Werror("XExtGcd not implemented for %s (c=%d)",r->cfCoeffName(r),getCoeffType(r));
  return NULL;
}

nEati() [1/2]

char * nEati	(	char *	s,
		int *	i,
		int	m
	)

divide by the first (leading) number and return it, i.e. make monic

does nothing (just returns a dummy one number) helper routine: read an int from a string (mod m), return a pointer to the rest

Definition at line 677 of file numbers.cc.

{
 
  if (((*s) >= '0') && ((*s) <= '9'))
  {
    unsigned long ii=0L;
    do
    {
      ii *= 10;
      ii += *s++ - '0';
      if ((m!=0) && (ii > (MAX_INT_VAL / 10))) ii = ii % m;
    }
    while (((*s) >= '0') && ((*s) <= '9'));
    if ((m!=0) && (ii>=(unsigned)m)) ii=ii%m;
    *i=(int)ii;
  }
  else (*i) = 1;
  return s;

nEati() [2/2]

char * nEati	(	char *	s,
		long *	i,
		int	m
	)

Definition at line 697 of file numbers.cc.

{
 
  if (((*s) >= '0') && ((*s) <= '9'))
  {
    unsigned long ii=0L;
    do
    {
      ii *= 10;
      ii += *s++ - '0';
      if ((m!=0) && (ii > (LONG_MAX / 10))) ii = ii % m;
    }
    while (((*s) >= '0') && ((*s) <= '9'));
    if ((m!=0) && (ii>=(long)m)) ii=ii%m;
    *i=ii;
  }
  else (*i) = 1;
  return s;

nEatLong()

char * nEatLong	(	char *	s,
		mpz_ptr	i
	)

extracts a long integer from s, returns the rest

Definition at line 718 of file numbers.cc.

{
  const char * start=s;
 
  while (*s >= '0' && *s <= '9') s++;
  if (*s=='\0')
  {
    mpz_set_str(i,start,10);
  }
  else
  {
    char c=*s;
    *s='\0';
    mpz_set_str(i,start,10);
    *s=c;
  }
  return s;

nFindCoeffByName()

coeffs nFindCoeffByName

(

char *

cf_name

)

find an existing coeff by its "CoeffName"

Definition at line 645 of file numbers.cc.

{
  n_Procs_s* n=cf_root;
  // try existings coeffs:
  while(n!=NULL)
  {
    if ((n->cfCoeffName!=NULL)
    && (strcmp(cf_name,n->cfCoeffName(n))==0)) return n;
    n=n->next;
  }
  // TODO: parametrized cf, e.g. flint:Z/26[a]
  // try existing types:
  nFindCoeffByName_p p=nFindCoeffByName_Root;
  while(p!=NULL)
  {
    coeffs cf=p->p(cf_name,p->n);
    if (cf!=NULL) return cf;
    p=p->next;
  }
  return NULL;

nInitChar()

coeffs nInitChar	(	n_coeffType	t,
		void *	parameter
	)

one-time initialisations for new coeffs in case of an error return NULL

Definition at line 413 of file numbers.cc.

{
  n_Procs_s *n=cf_root;
 
  while((n!=NULL) && (n->nCoeffIsEqual!=NULL) && (!n->nCoeffIsEqual(n,t,parameter)))
      n=n->next;
 
  if (n==NULL)
  {
    n=(n_Procs_s*)omAlloc0(sizeof(n_Procs_s));
    n->next=cf_root;
    n->ref=1;
    n->type=t;
 
    // default entries (different from NULL) for some routines:
    n->nCoeffIsEqual = ndCoeffIsEqual;
    n->cfSize = ndSize;
    n->cfGetDenom= ndGetDenom;
    n->cfGetNumerator= ndGetNumerator;
    n->cfImPart=ndReturn0;
    n->cfDelete= ndDelete;
    n->cfAnn = ndAnn;
    n->cfCoeffString = ndCoeffString;
    n->cfCoeffWrite = ndCoeffWrite;
    n->cfCoeffName = ndCoeffName; // should alway be changed!
    n->cfInpAdd=ndInpAdd;
    n->cfInpMult=ndInpMult;
    n->cfCopy = ndCopy;
    n->cfIntMod=ndIntMod; /* dummy !! */
    n->cfNormalize=ndNormalize;
    n->cfGcd  = ndGcd;
    n->cfNormalizeHelper  = ndGcd; /* tricky, isn't it ?*/
    n->cfLcm  = ndGcd; /* tricky, isn't it ?*/
    n->cfInitMPZ = ndInitMPZ;
    n->cfMPZ = ndMPZ;
    n->cfPower = ndPower;
    n->cfQuotRem = ndQuotRem;
    n->cfInvers = ndInvers;
    n->cfRandom = ndRandom;
 
    n->cfKillChar = ndKillChar; /* dummy */
    n->cfSetChar = ndSetChar; /* dummy */
    // temp. removed to catch all the coeffs which miss to implement this!
 
    n->cfChineseRemainder = ndChineseRemainder; /* not implemented */
    n->cfFarey = ndFarey; /* not implemented */
    n->cfParDeg = ndParDeg; /* not implemented */
    n->cfReadFd = ndReadFd; /* not implemented */
    n->cfWriteFd = ndWriteFd; /* not implemented */
 
    n->cfParameter = ndParameter;
 
    n->cfClearContent = ndClearContent;
    n->cfClearDenominators = ndClearDenominators;
 
    n->cfEucNorm = ndEucNorm;
#ifdef HAVE_RINGS
    n->cfDivComp = ndDivComp;
    n->cfDivBy = ndDivBy;
    n->cfExtGcd = ndExtGcd;
    n->cfXExtGcd = ndXExtGcd;
    //n->cfGetUnit = ndGetUnit_Ring;// set afterwards
#endif
 
    // report error, if not redefined
    n->cfRead=ndRead;
    n->cfSetMap=ndSetMap;
 
#ifdef LDEBUG
    n->cfDBTest=ndDBTest;
#endif
 
    n->convSingNFactoryN=ndConvSingNFactoryN;
    n->convFactoryNSingN=ndConvFactoryNSingN;
 
    BOOLEAN nOK=TRUE;
    // init
    if ((t<=nLastCoeffs) && (nInitCharTable[t]!=NULL))
      nOK = (nInitCharTable[t])(n,parameter);
    else
       Werror("Sorry: the coeff type [%d] was not registered: it is missing in nInitCharTable", (int)t);
    if (nOK)
    {
      omFreeSize(n,sizeof(*n));
      return NULL;
    }
    cf_root=n;
    // post init settings:
    if (n->cfRePart==NULL) n->cfRePart=n->cfCopy;
    if (n->cfExactDiv==NULL) n->cfExactDiv=n->cfDiv;
    if (n->cfSubringGcd==NULL) n->cfSubringGcd=n->cfGcd;
    if (n->cfWriteShort==NULL) n->cfWriteShort = n->cfWriteLong;
    if (n->cfIsUnit==NULL)
    {
      if (n->is_field) n->cfIsUnit=ndIsUnit_Field;
      else             n->cfIsUnit=ndIsUnit_Ring;
    }
    #ifdef HAVE_RINGS
    if (n->cfGetUnit==NULL)
    {
      if (n->is_field) n->cfGetUnit=n->cfCopy;
      else             n->cfGetUnit=ndGetUnit_Ring;
    }
    if ((n->cfInvers==ndInvers)&&(n->is_field))
    {
      n->cfInvers=ndInvers_Ring;
    }
    #endif
 
 
    if(n->cfMult==NULL)  PrintS("cfMult missing\n");
    if(n->cfSub==NULL)  PrintS("cfSub missing\n");
    if(n->cfAdd==NULL) PrintS("cfAdd missing\n");
    if(n->cfDiv==NULL) PrintS("cfDiv missing\n");
    if(n->cfExactDiv==NULL) PrintS("cfExactDiv missing\n");
    if(n->cfInit==NULL) PrintS("cfInit missing\n");
    if(n->cfInt==NULL) PrintS("cfInt missing\n");
    if(n->cfIsUnit==NULL) PrintS("cfIsUnit missing\n");
    if(n->cfGetUnit==NULL) PrintS("cfGetUnit missing\n");
    if(n->cfInpNeg==NULL)  PrintS("cfInpNeg missing\n");
    if(n->cfXExtGcd==NULL)  PrintS("cfXExtGcd missing\n");
    if(n->cfAnn==NULL)  PrintS("cfAnn missing\n");
    if(n->cfWriteLong==NULL) PrintS("cfWriteLong missing\n");
 
    assume(n->iNumberOfParameters>= 0);
 
    assume( (n->iNumberOfParameters == 0 && n->pParameterNames == NULL) ||
            (n->iNumberOfParameters >  0 && n->pParameterNames != NULL) );
 
 
    if(n->cfGreater==NULL) PrintS("cfGreater missing\n");
    if(n->cfEqual==NULL) PrintS("cfEqual missing\n");
    if(n->cfIsZero==NULL) PrintS("cfIsZero missing\n");
    if(n->cfIsOne==NULL) PrintS("cfIsOne missing\n");
    if(n->cfIsMOne==NULL) PrintS("cfIsMOne missing\n");
    if(n->cfGreaterZero==NULL) PrintS("cfGreaterZero missing\n");
    /* error reporter:
    if(n->cfRead==ndRead) PrintS("cfRead missing\n");
    if(n->cfSetMap==ndSetMap) PrintS("cfSetMap missing\n");
    */
 
    assume(n->type==t);
 
#ifndef SING_NDEBUG
    if(n->cfWriteLong==NULL) Warn("cfWrite is NULL for coeff %d",t);
    if(n->cfWriteShort==NULL) Warn("cfWriteShort is NULL for coeff %d",t);
#endif
  }
  else
  {
    n->ref++;
  }
  return n;

nKillChar()

void nKillChar

(

coeffs

r

)

undo all initialisations

Definition at line 568 of file numbers.cc.

{
  if (r!=NULL)
  {
    r->ref--;
    if (r->ref<=0)
    {
      n_Procs_s tmp;
      n_Procs_s* n=&tmp;
      tmp.next=cf_root;
      while((n->next!=NULL) && (n->next!=r)) n=n->next;
      if (n->next==r)
      {
        n->next=n->next->next;
        if (cf_root==r) cf_root=n->next;
        assume (r->cfKillChar!=NULL); r->cfKillChar(r);
        omFreeSize((void *)r, sizeof(n_Procs_s));
        r=NULL;
      }
      else
      {
        WarnS("cf_root list destroyed");
      }
    }
  }

nRegister()

n_coeffType nRegister	(	n_coeffType	n,
		cfInitCharProc	p
	)

Definition at line 595 of file numbers.cc.

{
  if (n==n_unknown)
  {
    nLastCoeffs=(n_coeffType)(int(nLastCoeffs)+1);
    if (nInitCharTable==nInitCharTableDefault)
    {
      nInitCharTable=(cfInitCharProc*)omAlloc0(
                                          ((int)nLastCoeffs+1)*sizeof(cfInitCharProc));
      memcpy(nInitCharTable,nInitCharTableDefault,
              ((int)nLastCoeffs)*sizeof(cfInitCharProc));
    }
    else
    {
      nInitCharTable=(cfInitCharProc*)omReallocSize(nInitCharTable,
                                          ((int)nLastCoeffs)*sizeof(cfInitCharProc),
                                          (((int)nLastCoeffs)+1)*sizeof(cfInitCharProc));
    }
 
    nInitCharTable[nLastCoeffs]=p;
    return nLastCoeffs;
  }
  else
  {
    if (nInitCharTable[n]!=NULL) Print("coeff %d already initialized\n",n);
    nInitCharTable[n]=p;
    return n;
  }

nRegisterCfByName()

void nRegisterCfByName	(	cfInitCfByNameProc	p,
		n_coeffType	n
	)

Definition at line 636 of file numbers.cc.

{
  nFindCoeffByName_p h=(nFindCoeffByName_p)omAlloc0(sizeof(*h));
  h->p=p;
  h->n=n;
  h->next=nFindCoeffByName_Root;
  nFindCoeffByName_Root=h;

Variable Documentation

cf_root

VAR n_Procs_s* cf_root =NULL

Definition at line 45 of file numbers.cc.

nFindCoeffByName_Root

VAR nFindCoeffByName_p nFindCoeffByName_Root =NULL

Definition at line 635 of file numbers.cc.

nInitCharTable

STATIC_VAR cfInitCharProc* nInitCharTable =nInitCharTableDefault

Definition at line 409 of file numbers.cc.

nInitCharTableDefault

VAR cfInitCharProc nInitCharTableDefault[]

Definition at line 376 of file numbers.cc.

nLastCoeffs

STATIC_VAR n_coeffType nLastCoeffs =n_CF

Definition at line 375 of file numbers.cc.