My Project
Macros | Typedefs | Functions | Variables
numbers.h File Reference
#include "coeffs/coeffs.h"

Go to the source code of this file.

Macros

#define nCopy(n)   n_Copy(n, currRing->cf)
 
#define nDelete(n)   n_Delete(n, currRing->cf)
 
#define nMult(n1, n2)   n_Mult(n1, n2, currRing->cf)
 
#define nAdd(n1, n2)   n_Add(n1, n2, currRing->cf)
 
#define nIsZero(n)   n_IsZero(n, currRing->cf)
 
#define nEqual(n1, n2)   n_Equal(n1, n2, currRing->cf)
 
#define nInpNeg(n)   n_InpNeg(n, currRing->cf)
 
#define nSub(n1, n2)   n_Sub(n1, n2, currRing->cf)
 
#define nGetChar()   n_GetChar(currRing->cf)
 
#define nInit(i)   n_Init(i, currRing->cf)
 
#define nIsOne(n)   n_IsOne(n, currRing->cf)
 
#define nIsMOne(n)   n_IsMOne(n, currRing->cf)
 
#define nGreaterZero(n)   n_GreaterZero(n, currRing->cf)
 
#define nGreater(a, b)   n_Greater (a,b,currRing->cf)
 
#define nWrite(n)   n_Write(n, currRing->cf, rShortOut(currRing))
 
#define nNormalize(n)   n_Normalize(n,currRing->cf)
 
#define nGcd(a, b)   n_Gcd(a,b,currRing->cf)
 
#define nDiv(a, b)   n_Div(a,b,currRing->cf)
 
#define nInvers(a)   n_Invers(a,currRing->cf)
 
#define nExactDiv(a, b)   n_ExactDiv(a,b,currRing->cf)
 
#define nTest(a)   n_Test(a,currRing->cf)
 
#define nInpMult(a, b)   n_InpMult(a,b,currRing->cf)
 
#define nPower(a, b, res)   n_Power(a,b,res,currRing->cf)
 
#define nSize(n)   n_Size(n,currRing->cf)
 
#define nGetDenom(N)   n_GetDenom((N),currRing->cf)
 
#define nGetNumerator(N)   n_GetNumerator((N),currRing->cf)
 
#define nSetMap(R)   n_SetMap(R,currRing->cf)
 
#define nPrint(a)   n_Print(a,currRing->cf)
 only for debug, over any initalized currRing More...
 
#define SHORT_REAL_LENGTH   6
 

Typedefs

typedef BOOLEAN(* cfInitCharProc) (coeffs, void *)
 initialize an object of type coeff, return FALSE in case of success More...
 
typedef coeffs(* cfInitCfByNameProc) (char *s, n_coeffType n)
 initialize an object of type coeffs by its name, return NULL otherwise More...
 

Functions

number ndGcd (number a, number b, const coeffs)
 
CanonicalForm ndConvSingNFactoryN (number, BOOLEAN, const coeffs)
 
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)
 
n_coeffType nRegister (n_coeffType n, cfInitCharProc p)
 
void nRegisterCfByName (cfInitCfByNameProc p, n_coeffType n)
 
coeffs nFindCoeffByName (char *n)
 find an existing coeff by its "CoeffName" More...
 
char * nEati (char *s, int *i, int m)
 divide by the first (leading) number and return it, i.e. make monic More...
 
char * nEatLong (char *s, mpz_ptr i)
 extracts a long integer from s, returns the rest More...
 

Variables

const char *const nDivBy0 = "div by 0"
 

Macro Definition Documentation

◆ nAdd

#define nAdd (   n1,
  n2 
)    n_Add(n1, n2, currRing->cf)

Definition at line 18 of file numbers.h.

◆ nCopy

#define nCopy (   n)    n_Copy(n, currRing->cf)

Definition at line 15 of file numbers.h.

◆ nDelete

#define nDelete (   n)    n_Delete(n, currRing->cf)

Definition at line 16 of file numbers.h.

◆ nDiv

#define nDiv (   a,
  b 
)    n_Div(a,b,currRing->cf)

Definition at line 32 of file numbers.h.

◆ nEqual

#define nEqual (   n1,
  n2 
)    n_Equal(n1, n2, currRing->cf)

Definition at line 20 of file numbers.h.

◆ nExactDiv

#define nExactDiv (   a,
  b 
)    n_ExactDiv(a,b,currRing->cf)

Definition at line 34 of file numbers.h.

◆ nGcd

#define nGcd (   a,
  b 
)    n_Gcd(a,b,currRing->cf)

Definition at line 31 of file numbers.h.

◆ nGetChar

#define nGetChar ( )    n_GetChar(currRing->cf)

Definition at line 23 of file numbers.h.

◆ nGetDenom

#define nGetDenom (   N)    n_GetDenom((N),currRing->cf)

Definition at line 40 of file numbers.h.

◆ nGetNumerator

#define nGetNumerator (   N)    n_GetNumerator((N),currRing->cf)

Definition at line 41 of file numbers.h.

◆ nGreater

#define nGreater (   a,
  b 
)    n_Greater (a,b,currRing->cf)

Definition at line 28 of file numbers.h.

◆ nGreaterZero

#define nGreaterZero (   n)    n_GreaterZero(n, currRing->cf)

Definition at line 27 of file numbers.h.

◆ nInit

#define nInit (   i)    n_Init(i, currRing->cf)

Definition at line 24 of file numbers.h.

◆ nInpMult

#define nInpMult (   a,
  b 
)    n_InpMult(a,b,currRing->cf)

Definition at line 37 of file numbers.h.

◆ nInpNeg

#define nInpNeg (   n)    n_InpNeg(n, currRing->cf)

Definition at line 21 of file numbers.h.

◆ nInvers

#define nInvers (   a)    n_Invers(a,currRing->cf)

Definition at line 33 of file numbers.h.

◆ nIsMOne

#define nIsMOne (   n)    n_IsMOne(n, currRing->cf)

Definition at line 26 of file numbers.h.

◆ nIsOne

#define nIsOne (   n)    n_IsOne(n, currRing->cf)

Definition at line 25 of file numbers.h.

◆ nIsZero

#define nIsZero (   n)    n_IsZero(n, currRing->cf)

Definition at line 19 of file numbers.h.

◆ nMult

#define nMult (   n1,
  n2 
)    n_Mult(n1, n2, currRing->cf)

Definition at line 17 of file numbers.h.

◆ nNormalize

#define nNormalize (   n)    n_Normalize(n,currRing->cf)

Definition at line 30 of file numbers.h.

◆ nPower

#define nPower (   a,
  b,
  res 
)    n_Power(a,b,res,currRing->cf)

Definition at line 38 of file numbers.h.

◆ nPrint

#define nPrint (   a)    n_Print(a,currRing->cf)

only for debug, over any initalized currRing

Definition at line 46 of file numbers.h.

◆ nSetMap

#define nSetMap (   R)    n_SetMap(R,currRing->cf)

Definition at line 43 of file numbers.h.

◆ nSize

#define nSize (   n)    n_Size(n,currRing->cf)

Definition at line 39 of file numbers.h.

◆ nSub

#define nSub (   n1,
  n2 
)    n_Sub(n1, n2, currRing->cf)

Definition at line 22 of file numbers.h.

◆ nTest

#define nTest (   a)    n_Test(a,currRing->cf)

Definition at line 35 of file numbers.h.

◆ nWrite

#define nWrite (   n)    n_Write(n, currRing->cf, rShortOut(currRing))

Definition at line 29 of file numbers.h.

◆ SHORT_REAL_LENGTH

#define SHORT_REAL_LENGTH   6

Definition at line 57 of file numbers.h.

Typedef Documentation

◆ cfInitCfByNameProc

typedef coeffs(* cfInitCfByNameProc) (char *s, n_coeffType n)

initialize an object of type coeffs by its name, return NULL otherwise

Definition at line 97 of file numbers.h.

◆ cfInitCharProc

typedef BOOLEAN(* cfInitCharProc) (coeffs, void *)

initialize an object of type coeff, return FALSE in case of success

Definition at line 93 of file numbers.h.

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 149 of file numbers.cc.

150{
151 BOOLEAN ret = n_IsZero(a, r);
152 int c = n_GetChar(r);
153 if (ret || (c==0) || (r->is_field))
154 return ret; /*n_IsZero(a, r)*/
155 number ch = n_Init( c, r );
156 number g = n_Gcd( ch, a, r );
157 ret = !n_IsOne (g, r);
158 n_Delete(&ch, r);
159 n_Delete(&g, r);
160 return ret;
161}
BOOLEAN
int BOOLEAN
Definition: auxiliary.h:87
g
g
Definition: cfModGcd.cc:4090
n_Gcd
static FORCE_INLINE number n_Gcd(number a, number b, const coeffs r)
in Z: return the gcd of 'a' and 'b' in Z/nZ, Z/2^kZ: computed as in the case Z in Z/pZ,...
Definition: coeffs.h:664
n_IsZero
static FORCE_INLINE BOOLEAN n_IsZero(number n, const coeffs r)
TRUE iff 'n' represents the zero element.
Definition: coeffs.h:464
n_GetChar
static FORCE_INLINE int n_GetChar(const coeffs r)
Return the characteristic of the coeff. domain.
Definition: coeffs.h:444
n_Delete
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
Definition: coeffs.h:455
n_Init
static FORCE_INLINE number n_Init(long i, const coeffs r)
a number representing i in the given coeff field/ring r
Definition: coeffs.h:538
n_IsOne
static FORCE_INLINE BOOLEAN n_IsOne(number n, const coeffs r)
TRUE iff 'n' represents the one element.
Definition: coeffs.h:468

◆ ndConvSingNFactoryN()

CanonicalForm ndConvSingNFactoryN ( number  ,
BOOLEAN  ,
const  coeffs 
)

Definition at line 276 of file numbers.cc.

277{
278 CanonicalForm term(0);
279 WerrorS("no conversion to factory");
280 return term;
281}
CanonicalForm
factory's main class
Definition: canonicalform.h:86
term
Definition: int_poly.h:33
WerrorS
void WerrorS(const char *s)
Definition: feFopen.cc:24

◆ ndGcd()

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

Definition at line 165 of file numbers.cc.

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

◆ ndNormalize()

void ndNormalize ( number &  ,
const  coeffs 
)

Definition at line 163 of file numbers.cc.

163{ }

◆ nEati()

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 631 of file numbers.cc.

633{
634
635 if (((*s) >= '0') && ((*s) <= '9'))
636 {
637 unsigned long ii=0L;
638 do
639 {
640 ii *= 10;
641 ii += *s++ - '0';
642 if ((m!=0) && (ii > (MAX_INT_VAL / 10))) ii = ii % m;
643 }
644 while (((*s) >= '0') && ((*s) <= '9'));
645 if ((m!=0) && (ii>=(unsigned)m)) ii=ii%m;
646 *i=(int)ii;
647 }
648 else (*i) = 1;
649 return s;
m
int m
Definition: cfEzgcd.cc:128
i
int i
Definition: cfEzgcd.cc:132
s
const CanonicalForm int s
Definition: facAbsFact.cc:51
MAX_INT_VAL
const int MAX_INT_VAL
Definition: mylimits.h:12

◆ nEatLong()

char * nEatLong ( char *  s,
mpz_ptr  i 
)

extracts a long integer from s, returns the rest

Definition at line 652 of file numbers.cc.

654{
655 const char * start=s;
656
657 while (*s >= '0' && *s <= '9') s++;
658 if (*s=='\0')
659 {
660 mpz_set_str(i,start,10);
661 }
662 else
663 {
664 char c=*s;
665 *s='\0';
666 mpz_set_str(i,start,10);
667 *s=c;
668 }
669 return s;

◆ nFindCoeffByName()

coeffs nFindCoeffByName ( char *  n)

find an existing coeff by its "CoeffName"

Definition at line 599 of file numbers.cc.

601{
602 n_Procs_s* n=cf_root;
603 // try existings coeffs:
604 while(n!=NULL)
605 {
606 if ((n->cfCoeffName!=NULL)
607 && (strcmp(cf_name,n->cfCoeffName(n))==0)) return n;
608 n=n->next;
609 }
610 // TODO: parametrized cf, e.g. flint:Z/26[a]
611 // try existing types:
612 nFindCoeffByName_p p=nFindCoeffByName_Root;
613 while(p!=NULL)
614 {
615 coeffs cf=p->p(cf_name,p->n);
616 if (cf!=NULL) return cf;
617 p=p->next;
618 }
619 return NULL;
p
int p
Definition: cfModGcd.cc:4078
cf
CanonicalForm cf
Definition: cfModGcd.cc:4083
coeffs
The main handler for Singular numbers which are suitable for Singular polynomials.
nFindCoeffByName_Root
VAR nFindCoeffByName_p nFindCoeffByName_Root
Definition: numbers.cc:589
cf_root
VAR n_Procs_s * cf_root
Definition: numbers.cc:45
NULL
#define NULL
Definition: omList.c:12
n_Procs_s
Definition: coeffs.h:123
n_Procs_s::next
coeffs next
Definition: coeffs.h:125
n_Procs_s::cfCoeffName
char *(* cfCoeffName)(const coeffs r)
default name of cf, should substitue cfCoeffWrite, cfCoeffString
Definition: coeffs.h:154

◆ nRegister()

n_coeffType nRegister ( n_coeffType  n,
cfInitCharProc  p 
)

Definition at line 549 of file numbers.cc.

551{
552 if (n==n_unknown)
553 {
554 nLastCoeffs=(n_coeffType)(int(nLastCoeffs)+1);
555 if (nInitCharTable==nInitCharTableDefault)
556 {
557 nInitCharTable=(cfInitCharProc*)omAlloc0(
558 ((int)nLastCoeffs+1)*sizeof(cfInitCharProc));
559 memcpy(nInitCharTable,nInitCharTableDefault,
560 ((int)nLastCoeffs)*sizeof(cfInitCharProc));
561 }
562 else
563 {
564 nInitCharTable=(cfInitCharProc*)omReallocSize(nInitCharTable,
565 ((int)nLastCoeffs)*sizeof(cfInitCharProc),
566 (((int)nLastCoeffs)+1)*sizeof(cfInitCharProc));
567 }
568
569 nInitCharTable[nLastCoeffs]=p;
570 return nLastCoeffs;
571 }
572 else
573 {
574 if (nInitCharTable[n]!=NULL) Print("coeff %d already initialized\n",n);
575 nInitCharTable[n]=p;
576 return n;
577 }
n_coeffType
n_coeffType
Definition: coeffs.h:27
n_unknown
@ n_unknown
Definition: coeffs.h:28
Print
#define Print
Definition: emacs.cc:80
nLastCoeffs
STATIC_VAR n_coeffType nLastCoeffs
Definition: numbers.cc:316
nInitCharTable
STATIC_VAR cfInitCharProc * nInitCharTable
Definition: numbers.cc:350
nInitCharTableDefault
VAR cfInitCharProc nInitCharTableDefault[]
Definition: numbers.cc:317
cfInitCharProc
BOOLEAN(* cfInitCharProc)(coeffs, void *)
initialize an object of type coeff, return FALSE in case of success
Definition: numbers.h:93
omReallocSize
#define omReallocSize(addr, o_size, size)
Definition: omAllocDecl.h:220
omAlloc0
#define omAlloc0(size)
Definition: omAllocDecl.h:211

◆ nRegisterCfByName()

void nRegisterCfByName ( cfInitCfByNameProc  p,
n_coeffType  n 
)

Definition at line 590 of file numbers.cc.

592{
593 nFindCoeffByName_p h=(nFindCoeffByName_p)omAlloc0(sizeof(*h));
594 h->p=p;
595 h->n=n;
596 h->next=nFindCoeffByName_Root;
597 nFindCoeffByName_Root=h;
h
STATIC_VAR Poly * h
Definition: janet.cc:971

Variable Documentation

◆ nDivBy0

const char* const nDivBy0 = "div by 0"

Definition at line 87 of file numbers.h.

Generated on Sun Apr 17 2022 10:43:59 for My Project by   doxygen 1.9.3 for Singular