My Project
Loading...
Searching...
No Matches
Data Structures | Macros | Typedefs | Enumerations | Functions | Variables
coeffs.h File Reference

Coefficient rings, fields and other domains suitable for Singular polynomials. More...

#include "misc/auxiliary.h"
#include "omalloc/omalloc.h"
#include "misc/sirandom.h"
#include "reporter/reporter.h"
#include "reporter/s_buff.h"
#include "factory/factory.h"
#include "coeffs/si_gmp.h"
#include "coeffs/Enumerator.h"

Go to the source code of this file.

Data Structures

struct  GFInfo
 Creation data needed for finite fields. More...
 
struct  LongComplexInfo
 
struct  coeffs
 

Macros

#define FREE_RNUMBER(x)   omFreeBin((void *)x, rnumber_bin)
 
#define ALLOC_RNUMBER()   (number)omAllocBin(rnumber_bin)
 
#define ALLOC0_RNUMBER()   (number)omAlloc0Bin(rnumber_bin)
 
#define n_New(n, r)   nNew(n)
 
#define n_Test(a, r)   n_DBTest(a, __FILE__, __LINE__, r)
 BOOLEAN n_Test(number a, const coeffs r)
 

Typedefs

typedef number(* numberfunc) (number a, number b, const coeffs r)
 
typedef number(* nMapFunc) (number a, const coeffs src, const coeffs dst)
 maps "a", which lives in src, into dst
 
typedef IEnumerator< number > ICoeffsEnumerator
 Abstract interface for an enumerator of number coefficients for an object, e.g. a polynomial.
 
typedef void(* nCoeffsEnumeratorFunc) (ICoeffsEnumerator &numberCollectionEnumerator, number &output, const coeffs r)
 goes over coeffs given by the ICoeffsEnumerator and changes them. Additionally returns a number;
 

Enumerations

enum  n_coeffType {
  n_unknown =0 , n_Zp , n_Q , n_R ,
  n_GF , n_long_R , n_polyExt , n_algExt ,
  n_transExt , n_long_C , n_nTupel , n_Z ,
  n_Zn , n_Znm , n_Z2m , n_FlintQrat ,
  n_CF
}
 
enum  n_coeffRep {
  n_rep_unknown =0 , n_rep_int , n_rep_gap_rat , n_rep_gap_gmp ,
  n_rep_poly , n_rep_rat_fct , n_rep_gmp , n_rep_float ,
  n_rep_gmp_float , n_rep_gmp_complex , n_rep_gf
}
 

Functions

static FORCE_INLINE n_coeffType getCoeffType (const coeffs r)
 Returns the type of coeffs domain.
 
coeffs nInitChar (n_coeffType t, void *parameter)
 one-time initialisations for new coeffs in case of an error return NULL
 
static FORCE_INLINE coeffs nCopyCoeff (const coeffs r)
 "copy" coeffs, i.e. increment ref
 
void nKillChar (coeffs r)
 undo all initialisations
 
static FORCE_INLINE void nSetChar (const coeffs r)
 initialisations after each ring change
 
void nNew (number *a)
 
static FORCE_INLINE int n_GetChar (const coeffs r)
 Return the characteristic of the coeff. domain.
 
static FORCE_INLINE number n_Copy (number n, const coeffs r)
 return a copy of 'n'
 
static FORCE_INLINE void n_Delete (number *p, const coeffs r)
 delete 'p'
 
static FORCE_INLINE BOOLEAN n_Equal (number a, number b, const coeffs r)
 TRUE iff 'a' and 'b' represent the same number; they may have different representations.
 
static FORCE_INLINE BOOLEAN n_IsZero (number n, const coeffs r)
 TRUE iff 'n' represents the zero element.
 
static FORCE_INLINE BOOLEAN n_IsOne (number n, const coeffs r)
 TRUE iff 'n' represents the one element.
 
static FORCE_INLINE BOOLEAN n_IsMOne (number n, const coeffs r)
 TRUE iff 'n' represents the additive inverse of the one element, i.e. -1.
 
static FORCE_INLINE BOOLEAN n_GreaterZero (number n, const coeffs r)
 ordered fields: TRUE iff 'n' is positive; in Z/pZ: TRUE iff 0 < m <= roundedBelow(p/2), where m is the long representing n in C: TRUE iff (Im(n) != 0 and Im(n) >= 0) or (Im(n) == 0 and Re(n) >= 0) in K(a)/<p(a)>: TRUE iff (n != 0 and (LC(n) > 0 or deg(n) > 0)) in K(t_1, ..., t_n): TRUE iff (LC(numerator(n) is a constant and > 0) or (LC(numerator(n) is not a constant) in Z/2^kZ: TRUE iff 0 < n <= 2^(k-1) in Z/mZ: TRUE iff the internal mpz is greater than zero in Z: TRUE iff n > 0
 
static FORCE_INLINE BOOLEAN n_Greater (number a, number b, const coeffs r)
 ordered fields: TRUE iff 'a' is larger than 'b'; in Z/pZ: TRUE iff la > lb, where la and lb are the long's representing
 
static FORCE_INLINE BOOLEAN n_IsUnit (number n, const coeffs r)
 TRUE iff n has a multiplicative inverse in the given coeff field/ring r.
 
static FORCE_INLINE coeffs n_CoeffRingQuot1 (number c, const coeffs r)
 
static FORCE_INLINE int n_DivComp (number a, number b, const coeffs r)
 
static FORCE_INLINE number n_GetUnit (number n, const coeffs r)
 in Z: 1 in Z/kZ (where k is not a prime): largest divisor of n (taken in Z) that is co-prime with k in Z/2^kZ: largest odd divisor of n (taken in Z) other cases: not implemented
 
static FORCE_INLINE number n_Init (long i, const coeffs r)
 a number representing i in the given coeff field/ring r
 
static FORCE_INLINE number n_InitMPZ (mpz_t n, const coeffs r)
 conversion of a GMP integer to number
 
static FORCE_INLINE long n_Int (number &n, const coeffs r)
 conversion of n to an int; 0 if not possible in Z/pZ: the representing int lying in (-p/2 .. p/2]
 
static FORCE_INLINE void n_MPZ (mpz_t result, number &n, const coeffs r)
 conversion of n to a GMP integer; 0 if not possible
 
static FORCE_INLINE number n_InpNeg (number n, const coeffs r)
 in-place negation of n MUST BE USED: n = n_InpNeg(n) (no copy is returned)
 
static FORCE_INLINE number n_Invers (number a, const coeffs r)
 return the multiplicative inverse of 'a'; raise an error if 'a' is not invertible
 
static FORCE_INLINE int n_Size (number n, const coeffs r)
 return a non-negative measure for the complexity of n; return 0 only when n represents zero; (used for pivot strategies in matrix computations with entries from r)
 
static FORCE_INLINE void n_Normalize (number &n, const coeffs r)
 inplace-normalization of n; produces some canonical representation of n;
 
static FORCE_INLINE void n_WriteLong (number n, const coeffs r)
 write to the output buffer of the currently used reporter
 
static FORCE_INLINE void n_WriteShort (number n, const coeffs r)
 write to the output buffer of the currently used reporter in a shortest possible way, e.g. in K(a): a2 instead of a^2
 
static FORCE_INLINE void n_Write (number n, const coeffs r, const BOOLEAN bShortOut=TRUE)
 
static FORCE_INLINE const char * n_Read (const char *s, number *a, const coeffs r)
 !!! Recommendation: This method is too cryptic to be part of the user- !!! interface. As defined here, it is merely a helper !!! method for parsing number input strings.
 
static FORCE_INLINE number n_GetDenom (number &n, const coeffs r)
 return the denominator of n (if elements of r are by nature not fractional, result is 1)
 
static FORCE_INLINE number n_GetNumerator (number &n, const coeffs r)
 return the numerator of n (if elements of r are by nature not fractional, result is n)
 
static FORCE_INLINE number n_Div (number a, number b, const coeffs r)
 return the quotient of 'a' and 'b', i.e., a/b; raises an error if 'b' is not invertible in r exception in Z: raises an error if 'a' is not divisible by 'b' always: n_Div(a,b,r)*b+n_IntMod(a,b,r)==a
 
static FORCE_INLINE number n_ExactDiv (number a, number b, const coeffs r)
 assume that there is a canonical subring in cf and we know that division is possible for these a and b in the subring, n_ExactDiv performs it, may skip additional tests. Can always be substituted by n_Div at the cost of larger computing time.
 
static FORCE_INLINE number n_IntMod (number a, number b, const coeffs r)
 for r a field, return n_Init(0,r) always: n_Div(a,b,r)*b+n_IntMod(a,b,r)==a n_IntMod(a,b,r) >=0
 
static FORCE_INLINE void n_Power (number a, int b, number *res, const coeffs r)
 fill res with the power a^b
 
static FORCE_INLINE number n_Mult (number a, number b, const coeffs r)
 return the product of 'a' and 'b', i.e., a*b
 
static FORCE_INLINE void n_InpMult (number &a, number b, const coeffs r)
 multiplication of 'a' and 'b'; replacement of 'a' by the product a*b
 
static FORCE_INLINE void n_InpAdd (number &a, number b, const coeffs r)
 addition of 'a' and 'b'; replacement of 'a' by the sum a+b
 
static FORCE_INLINE number n_Add (number a, number b, const coeffs r)
 return the sum of 'a' and 'b', i.e., a+b
 
static FORCE_INLINE number n_Sub (number a, number b, const coeffs r)
 return the difference of 'a' and 'b', i.e., a-b
 
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, C, R: not implemented in Q: return the gcd of the numerators of 'a' and 'b' in K(a)/<p(a)>: not implemented in K(t_1, ..., t_n): not implemented
 
static FORCE_INLINE number n_SubringGcd (number a, number b, const coeffs r)
 
static FORCE_INLINE number n_ExtGcd (number a, number b, number *s, number *t, const coeffs r)
 beware that ExtGCD is only relevant for a few chosen coeff. domains and may perform something unexpected in some cases...
 
static FORCE_INLINE number n_XExtGcd (number a, number b, number *s, number *t, number *u, number *v, const coeffs r)
 
static FORCE_INLINE number n_EucNorm (number a, const coeffs r)
 
static FORCE_INLINE number n_Ann (number a, const coeffs r)
 if r is a ring with zero divisors, return an annihilator!=0 of b otherwise return NULL
 
static FORCE_INLINE number n_QuotRem (number a, number b, number *q, const coeffs r)
 
static FORCE_INLINE number n_Lcm (number a, number b, const coeffs r)
 in Z: return the lcm of 'a' and 'b' in Z/nZ, Z/2^kZ: computed as in the case Z in Z/pZ, C, R: not implemented in K(a)/<p(a)>: not implemented in K(t_1, ..., t_n): not implemented
 
static FORCE_INLINE number n_NormalizeHelper (number a, number b, const coeffs r)
 assume that r is a quotient field (otherwise, return 1) for arguments (a1/a2,b1/b2) return (lcm(a1,b2)/1)
 
number ndCopyMap (number a, const coeffs src, const coeffs dst)
 
static FORCE_INLINE nMapFunc n_SetMap (const coeffs src, const coeffs dst)
 set the mapping function pointers for translating numbers from src to dst
 
static FORCE_INLINE BOOLEAN n_DBTest (number n, const char *filename, const int linenumber, const coeffs r)
 test whether n is a correct number; only used if LDEBUG is defined
 
static FORCE_INLINE void n_CoeffWrite (const coeffs r, BOOLEAN details=TRUE)
 output the coeff description
 
static FORCE_INLINE BOOLEAN nCoeff_is_Ring_2toM (const coeffs r)
 
static FORCE_INLINE BOOLEAN nCoeff_is_Ring_PtoM (const coeffs r)
 
static FORCE_INLINE BOOLEAN nCoeff_is_Ring (const coeffs r)
 
static FORCE_INLINE BOOLEAN nCoeff_is_Domain (const coeffs r)
 returns TRUE, if r is a field or r has no zero divisors (i.e is a domain)
 
static FORCE_INLINE BOOLEAN n_DivBy (number a, number b, const coeffs r)
 test whether 'a' is divisible 'b'; for r encoding a field: TRUE iff 'b' does not represent zero in Z: TRUE iff 'b' divides 'a' (with remainder = zero) in Z/nZ: TRUE iff (a = 0 and b divides n in Z) or (a != 0 and b/gcd(a, b) is co-prime with n, i.e. a unit in Z/nZ) in Z/2^kZ: TRUE iff ((a = 0 mod 2^k) and (b = 0 or b is a power of 2)) or ((a, b <> 0) and (b/gcd(a, b) is odd))
 
static FORCE_INLINE number n_ChineseRemainderSym (number *a, number *b, int rl, BOOLEAN sym, CFArray &inv_cache, const coeffs r)
 
static FORCE_INLINE number n_Farey (number a, number b, const coeffs r)
 
static FORCE_INLINE int n_ParDeg (number n, const coeffs r)
 
static FORCE_INLINE int n_NumberOfParameters (const coeffs r)
 Returns the number of parameters.
 
static FORCE_INLINE char const ** n_ParameterNames (const coeffs r)
 Returns a (const!) pointer to (const char*) names of parameters.
 
static FORCE_INLINE number n_Param (const int iParameter, const coeffs r)
 return the (iParameter^th) parameter as a NEW number NOTE: parameter numbering: 1..n_NumberOfParameters(...)
 
static FORCE_INLINE number n_RePart (number i, const coeffs cf)
 
static FORCE_INLINE number n_ImPart (number i, const coeffs cf)
 
static FORCE_INLINE BOOLEAN nCoeff_has_Units (const coeffs r)
 returns TRUE, if r is not a field and r has non-trivial units
 
static FORCE_INLINE BOOLEAN nCoeff_is_Zp (const coeffs r)
 
static FORCE_INLINE BOOLEAN nCoeff_is_Zp (const coeffs r, int p)
 
static FORCE_INLINE BOOLEAN nCoeff_is_Q (const coeffs r)
 
static FORCE_INLINE BOOLEAN nCoeff_is_Z (const coeffs r)
 
static FORCE_INLINE BOOLEAN nCoeff_is_Zn (const coeffs r)
 
static FORCE_INLINE BOOLEAN nCoeff_is_Q_or_BI (const coeffs r)
 
static FORCE_INLINE BOOLEAN nCoeff_is_numeric (const coeffs r)
 
static FORCE_INLINE BOOLEAN nCoeff_is_R (const coeffs r)
 
static FORCE_INLINE BOOLEAN nCoeff_is_GF (const coeffs r)
 
static FORCE_INLINE BOOLEAN nCoeff_is_GF (const coeffs r, int q)
 
static FORCE_INLINE BOOLEAN nCoeff_is_Extension (const coeffs r)
 
static FORCE_INLINE BOOLEAN nCoeff_is_Zp_a (const coeffs r)
 
static FORCE_INLINE BOOLEAN nCoeff_is_Zp_a (const coeffs r, int p)
 
static FORCE_INLINE BOOLEAN nCoeff_is_Q_a (const coeffs r)
 
static FORCE_INLINE BOOLEAN nCoeff_is_long_R (const coeffs r)
 
static FORCE_INLINE BOOLEAN nCoeff_is_long_C (const coeffs r)
 
static FORCE_INLINE BOOLEAN nCoeff_is_CF (const coeffs r)
 
static FORCE_INLINE BOOLEAN nCoeff_has_simple_inverse (const coeffs r)
 TRUE, if the computation of the inverse is fast, i.e. prefer leading coeff. 1 over content.
 
static FORCE_INLINE BOOLEAN nCoeff_has_simple_Alloc (const coeffs r)
 TRUE if n_Delete/n_New are empty operations.
 
static FORCE_INLINE BOOLEAN nCoeff_is_algExt (const coeffs r)
 TRUE iff r represents an algebraic extension field.
 
static FORCE_INLINE BOOLEAN nCoeff_is_Q_algext (const coeffs r)
 is it an alg. ext. of Q?
 
static FORCE_INLINE BOOLEAN nCoeff_is_transExt (const coeffs r)
 TRUE iff r represents a transcendental extension field.
 
static FORCE_INLINE void n_ClearContent (ICoeffsEnumerator &numberCollectionEnumerator, number &c, const coeffs r)
 Computes the content and (inplace) divides it out on a collection of numbers number c is the content (i.e. the GCD of all the coeffs, which we divide out inplace) NOTE: it assumes all coefficient numbers to be integer!!! NOTE/TODO: see also the description by Hans TODO: rename into n_ClearIntegerContent.
 
static FORCE_INLINE void n_ClearDenominators (ICoeffsEnumerator &numberCollectionEnumerator, number &d, const coeffs r)
 (inplace) Clears denominators on a collection of numbers number d is the LCM of all the coefficient denominators (i.e. the number with which all the number coeffs. were multiplied) NOTE/TODO: see also the description by Hans
 
static FORCE_INLINE void n_ClearContent (ICoeffsEnumerator &numberCollectionEnumerator, const coeffs r)
 
static FORCE_INLINE void n_ClearDenominators (ICoeffsEnumerator &numberCollectionEnumerator, const coeffs r)
 
void n_Print (number &a, const coeffs r)
 print a number (BEWARE of string buffers!) mostly for debugging
 
static FORCE_INLINE char * nCoeffString (const coeffs cf)
 TODO: make it a virtual method of coeffs, together with: Decompose & Compose, rParameter & rPar.
 
static FORCE_INLINE char * nCoeffName (const coeffs cf)
 
static FORCE_INLINE number n_Random (siRandProc p, number p1, number p2, const coeffs cf)
 
static FORCE_INLINE void n_WriteFd (number a, const ssiInfo *f, const coeffs r)
 io via ssi:
 
static FORCE_INLINE number n_ReadFd (const ssiInfo *f, const coeffs r)
 io via ssi:
 
static FORCE_INLINE number n_convFactoryNSingN (const CanonicalForm n, const coeffs r)
 
static FORCE_INLINE CanonicalForm n_convSingNFactoryN (number n, BOOLEAN setChar, const coeffs r)
 
static FORCE_INLINE void number2mpz (number n, coeffs c, mpz_t m)
 
static FORCE_INLINE number mpz2number (mpz_t m, coeffs c)
 

Variables

const unsigned short fftable []
 
EXTERN_VAR omBin rnumber_bin
 

Detailed Description

Coefficient rings, fields and other domains suitable for Singular polynomials.

The main interface for Singular coefficients: coeffs is the main handler for Singular numbers

Definition in file coeffs.h.


Data Structure Documentation

◆ GFInfo

struct GFInfo

Creation data needed for finite fields.

Definition at line 92 of file coeffs.h.

Data Fields
int GFChar
int GFDegree
const char * GFPar_name

◆ LongComplexInfo

struct LongComplexInfo

Definition at line 99 of file coeffs.h.

Data Fields
short float_len additional char-flags, rInit
short float_len2 additional char-flags, rInit
const char * par_name parameter name

Macro Definition Documentation

◆ ALLOC0_RNUMBER

#define ALLOC0_RNUMBER ( )    (number)omAlloc0Bin(rnumber_bin)

Definition at line 88 of file coeffs.h.

◆ ALLOC_RNUMBER

#define ALLOC_RNUMBER ( )    (number)omAllocBin(rnumber_bin)

Definition at line 87 of file coeffs.h.

◆ FREE_RNUMBER

#define FREE_RNUMBER (   x)    omFreeBin((void *)x, rnumber_bin)

Definition at line 86 of file coeffs.h.

◆ n_New

#define n_New (   n,
 
)    nNew(n)

Definition at line 440 of file coeffs.h.

◆ n_Test

#define n_Test (   a,
 
)    n_DBTest(a, __FILE__, __LINE__, r)

BOOLEAN n_Test(number a, const coeffs r)

Definition at line 712 of file coeffs.h.

Typedef Documentation

◆ ICoeffsEnumerator

typedef IEnumerator<number> ICoeffsEnumerator

Abstract interface for an enumerator of number coefficients for an object, e.g. a polynomial.

Definition at line 78 of file coeffs.h.

◆ nCoeffsEnumeratorFunc

typedef void(* nCoeffsEnumeratorFunc) (ICoeffsEnumerator &numberCollectionEnumerator, number &output, const coeffs r)

goes over coeffs given by the ICoeffsEnumerator and changes them. Additionally returns a number;

Definition at line 82 of file coeffs.h.

◆ nMapFunc

typedef number(* nMapFunc) (number a, const coeffs src, const coeffs dst)

maps "a", which lives in src, into dst

Definition at line 73 of file coeffs.h.

◆ numberfunc

typedef number(* numberfunc) (number a, number b, const coeffs r)

Definition at line 70 of file coeffs.h.

Enumeration Type Documentation

◆ n_coeffRep

enum n_coeffRep
Enumerator
n_rep_unknown 
n_rep_int 

(int), see modulop.h

n_rep_gap_rat 

(number), see longrat.h

n_rep_gap_gmp 

(), see rinteger.h, new impl.

n_rep_poly 

(poly), see algext.h

n_rep_rat_fct 

(fraction), see transext.h

n_rep_gmp 

(mpz_ptr), see rmodulon,h

n_rep_float 

(float), see shortfl.h

n_rep_gmp_float 

(gmp_float), see

n_rep_gmp_complex 

(gmp_complex), see gnumpc.h

n_rep_gf 

(int), see ffields.h

Definition at line 107 of file coeffs.h.

108{
110 n_rep_int, /**< (int), see modulop.h */
111 n_rep_gap_rat, /**< (number), see longrat.h */
112 n_rep_gap_gmp, /**< (), see rinteger.h, new impl. */
113 n_rep_poly, /**< (poly), see algext.h */
114 n_rep_rat_fct, /**< (fraction), see transext.h */
115 n_rep_gmp, /**< (mpz_ptr), see rmodulon,h */
116 n_rep_float, /**< (float), see shortfl.h */
117 n_rep_gmp_float, /**< (gmp_float), see */
118 n_rep_gmp_complex,/**< (gmp_complex), see gnumpc.h */
119 n_rep_gf /**< (int), see ffields.h */
120};
@ n_rep_gap_rat
(number), see longrat.h
Definition: coeffs.h:111
@ n_rep_gap_gmp
(), see rinteger.h, new impl.
Definition: coeffs.h:112
@ n_rep_float
(float), see shortfl.h
Definition: coeffs.h:116
@ n_rep_int
(int), see modulop.h
Definition: coeffs.h:110
@ n_rep_gmp_float
(gmp_float), see
Definition: coeffs.h:117
@ n_rep_gmp
(mpz_ptr), see rmodulon,h
Definition: coeffs.h:115
@ n_rep_poly
(poly), see algext.h
Definition: coeffs.h:113
@ n_rep_gmp_complex
(gmp_complex), see gnumpc.h
Definition: coeffs.h:118
@ n_rep_gf
(int), see ffields.h
Definition: coeffs.h:119
@ n_rep_rat_fct
(fraction), see transext.h
Definition: coeffs.h:114
@ n_rep_unknown
Definition: coeffs.h:109

◆ n_coeffType

Enumerator
n_unknown 
n_Zp 

\F{p < 2^31}

n_Q 

rational (GMP) numbers

n_R 

single prescision (6,6) real numbers

n_GF 

\GF{p^n < 2^16}

n_long_R 

real floating point (GMP) numbers

n_polyExt 

used to represent polys as coeffcients

n_algExt 

used for all algebraic extensions, i.e., the top-most extension in an extension tower is algebraic

n_transExt 

used for all transcendental extensions, i.e., the top-most extension in an extension tower is transcendental

n_long_C 

complex floating point (GMP) numbers

n_nTupel 

n-tupel of cf: ZZ/p1,... ZZ/pn, R, long_R

n_Z 

only used if HAVE_RINGS is defined

n_Zn 

only used if HAVE_RINGS is defined

n_Znm 

only used if HAVE_RINGS is defined

n_Z2m 

only used if HAVE_RINGS is defined

n_FlintQrat 

rational funtion field over Q

n_CF 

?

Definition at line 26 of file coeffs.h.

27{
28 n_unknown=0,
29 n_Zp, /**< \F{p < 2^31} */
30 n_Q, /**< rational (GMP) numbers */
31 n_R, /**< single prescision (6,6) real numbers */
32 n_GF, /**< \GF{p^n < 2^16} */
33 n_long_R, /**< real floating point (GMP) numbers */
34 n_polyExt, /**< used to represent polys as coeffcients */
35 n_algExt, /**< used for all algebraic extensions, i.e.,
36 the top-most extension in an extension tower
37 is algebraic */
38 n_transExt, /**< used for all transcendental extensions, i.e.,
39 the top-most extension in an extension tower
40 is transcendental */
41 n_long_C, /**< complex floating point (GMP) numbers */
42 n_nTupel, /**< n-tupel of cf: ZZ/p1,... ZZ/pn, R, long_R */
43 n_Z, /**< only used if HAVE_RINGS is defined */
44 n_Zn, /**< only used if HAVE_RINGS is defined */
45 n_Znm, /**< only used if HAVE_RINGS is defined */
46 n_Z2m, /**< only used if HAVE_RINGS is defined */
47 n_FlintQrat, /**< rational funtion field over Q */
48 n_CF /**< ? */
49};
@ n_R
single prescision (6,6) real numbers
Definition: coeffs.h:31
@ n_GF
\GF{p^n < 2^16}
Definition: coeffs.h:32
@ n_FlintQrat
rational funtion field over Q
Definition: coeffs.h:47
@ n_polyExt
used to represent polys as coeffcients
Definition: coeffs.h:34
@ n_Q
rational (GMP) numbers
Definition: coeffs.h:30
@ n_Znm
only used if HAVE_RINGS is defined
Definition: coeffs.h:45
@ n_algExt
used for all algebraic extensions, i.e., the top-most extension in an extension tower is algebraic
Definition: coeffs.h:35
@ n_Zn
only used if HAVE_RINGS is defined
Definition: coeffs.h:44
@ n_long_R
real floating point (GMP) numbers
Definition: coeffs.h:33
@ n_Z2m
only used if HAVE_RINGS is defined
Definition: coeffs.h:46
@ n_Zp
\F{p < 2^31}
Definition: coeffs.h:29
@ n_CF
?
Definition: coeffs.h:48
@ n_transExt
used for all transcendental extensions, i.e., the top-most extension in an extension tower is transce...
Definition: coeffs.h:38
@ n_unknown
Definition: coeffs.h:28
@ n_Z
only used if HAVE_RINGS is defined
Definition: coeffs.h:43
@ n_nTupel
n-tupel of cf: ZZ/p1,... ZZ/pn, R, long_R
Definition: coeffs.h:42
@ n_long_C
complex floating point (GMP) numbers
Definition: coeffs.h:41

Function Documentation

◆ getCoeffType()

static FORCE_INLINE n_coeffType getCoeffType ( const coeffs  r)
static

Returns the type of coeffs domain.

Definition at line 421 of file coeffs.h.

422{ assume(r != NULL); return r->type; }
#define assume(x)
Definition: mod2.h:389
#define NULL
Definition: omList.c:12

◆ mpz2number()

static FORCE_INLINE number mpz2number ( mpz_t  m,
coeffs  c 
)
static

Definition at line 988 of file coeffs.h.

988{ return n_InitMPZ(m, c); }
int m
Definition: cfEzgcd.cc:128
static FORCE_INLINE number n_InitMPZ(mpz_t n, const coeffs r)
conversion of a GMP integer to number
Definition: coeffs.h:542

◆ n_Add()

static FORCE_INLINE number n_Add ( number  a,
number  b,
const coeffs  r 
)
static

return the sum of 'a' and 'b', i.e., a+b

Definition at line 650 of file coeffs.h.

651{ assume(r != NULL); assume(r->cfAdd!=NULL); return r->cfAdd(a, b, r); }
CanonicalForm b
Definition: cfModGcd.cc:4102

◆ n_Ann()

static FORCE_INLINE number n_Ann ( number  a,
const coeffs  r 
)
static

if r is a ring with zero divisors, return an annihilator!=0 of b otherwise return NULL

Definition at line 679 of file coeffs.h.

680{ assume(r != NULL); return r->cfAnn (a,r); }

◆ n_ChineseRemainderSym()

static FORCE_INLINE number n_ChineseRemainderSym ( number *  a,
number *  b,
int  rl,
BOOLEAN  sym,
CFArray inv_cache,
const coeffs  r 
)
static

Definition at line 764 of file coeffs.h.

765{ assume(r != NULL); assume(r->cfChineseRemainder != NULL); return r->cfChineseRemainder(a,b,rl,sym,inv_cache,r); }

◆ n_ClearContent() [1/2]

static FORCE_INLINE void n_ClearContent ( ICoeffsEnumerator numberCollectionEnumerator,
const coeffs  r 
)
static

Definition at line 944 of file coeffs.h.

945{ number c; n_ClearContent(numberCollectionEnumerator, c, r); n_Delete(&c, r); }
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
Definition: coeffs.h:455
static FORCE_INLINE void n_ClearContent(ICoeffsEnumerator &numberCollectionEnumerator, number &c, const coeffs r)
Computes the content and (inplace) divides it out on a collection of numbers number c is the content ...
Definition: coeffs.h:928

◆ n_ClearContent() [2/2]

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

Computes the content and (inplace) divides it out on a collection of numbers number c is the content (i.e. the GCD of all the coeffs, which we divide out inplace) NOTE: it assumes all coefficient numbers to be integer!!! NOTE/TODO: see also the description by Hans TODO: rename into n_ClearIntegerContent.

Definition at line 928 of file coeffs.h.

929{ assume(r != NULL); r->cfClearContent(numberCollectionEnumerator, c, r); }

◆ n_ClearDenominators() [1/2]

static FORCE_INLINE void n_ClearDenominators ( ICoeffsEnumerator numberCollectionEnumerator,
const coeffs  r 
)
static

Definition at line 947 of file coeffs.h.

948{ assume(r != NULL); number d; n_ClearDenominators(numberCollectionEnumerator, d, r); n_Delete(&d, r); }
static FORCE_INLINE void n_ClearDenominators(ICoeffsEnumerator &numberCollectionEnumerator, number &d, const coeffs r)
(inplace) Clears denominators on a collection of numbers number d is the LCM of all the coefficient d...
Definition: coeffs.h:935

◆ n_ClearDenominators() [2/2]

static FORCE_INLINE void n_ClearDenominators ( ICoeffsEnumerator numberCollectionEnumerator,
number &  d,
const coeffs  r 
)
static

(inplace) Clears denominators on a collection of numbers number d is the LCM of all the coefficient denominators (i.e. the number with which all the number coeffs. were multiplied) NOTE/TODO: see also the description by Hans

Definition at line 935 of file coeffs.h.

936{ assume(r != NULL); r->cfClearDenominators(numberCollectionEnumerator, d, r); }

◆ n_CoeffRingQuot1()

static FORCE_INLINE coeffs n_CoeffRingQuot1 ( number  c,
const coeffs  r 
)
static

Definition at line 518 of file coeffs.h.

519{ assume(r != NULL); assume(r->cfQuot1 != NULL); return r->cfQuot1(c, r); }

◆ n_CoeffWrite()

static FORCE_INLINE void n_CoeffWrite ( const coeffs  r,
BOOLEAN  details = TRUE 
)
static

output the coeff description

Definition at line 719 of file coeffs.h.

720{ assume(r != NULL); assume(r->cfCoeffWrite != NULL); r->cfCoeffWrite(r, details); }

◆ n_convFactoryNSingN()

static FORCE_INLINE number n_convFactoryNSingN ( const CanonicalForm  n,
const coeffs  r 
)
static

Definition at line 978 of file coeffs.h.

979{ assume(r != NULL); assume(r->convFactoryNSingN != NULL); return r->convFactoryNSingN(n, r); }

◆ n_convSingNFactoryN()

static FORCE_INLINE CanonicalForm n_convSingNFactoryN ( number  n,
BOOLEAN  setChar,
const coeffs  r 
)
static

Definition at line 981 of file coeffs.h.

982{ assume(r != NULL); assume(r->convSingNFactoryN != NULL); return r->convSingNFactoryN(n, setChar, r); }

◆ n_Copy()

static FORCE_INLINE number n_Copy ( number  n,
const coeffs  r 
)
static

return a copy of 'n'

Definition at line 451 of file coeffs.h.

452{ assume(r != NULL); assume(r->cfCopy!=NULL); return r->cfCopy(n, r); }

◆ n_DBTest()

static FORCE_INLINE BOOLEAN n_DBTest ( number  n,
const char *  filename,
const int  linenumber,
const coeffs  r 
)
static

test whether n is a correct number; only used if LDEBUG is defined

Definition at line 709 of file coeffs.h.

710{ assume(r != NULL); assume(r->cfDBTest != NULL); return r->cfDBTest(n, filename, linenumber, r); }

◆ n_Delete()

static FORCE_INLINE void n_Delete ( number *  p,
const coeffs  r 
)
static

delete 'p'

Definition at line 455 of file coeffs.h.

456{ assume(r != NULL); assume(r->cfDelete!= NULL); r->cfDelete(p, r); }
int p
Definition: cfModGcd.cc:4077

◆ n_Div()

static FORCE_INLINE number n_Div ( number  a,
number  b,
const coeffs  r 
)
static

return the quotient of 'a' and 'b', i.e., a/b; raises an error if 'b' is not invertible in r exception in Z: raises an error if 'a' is not divisible by 'b' always: n_Div(a,b,r)*b+n_IntMod(a,b,r)==a

Definition at line 615 of file coeffs.h.

616{ assume(r != NULL); assume(r->cfDiv!=NULL); return r->cfDiv(a,b,r); }

◆ n_DivBy()

static FORCE_INLINE BOOLEAN n_DivBy ( number  a,
number  b,
const coeffs  r 
)
static

test whether 'a' is divisible 'b'; for r encoding a field: TRUE iff 'b' does not represent zero in Z: TRUE iff 'b' divides 'a' (with remainder = zero) in Z/nZ: TRUE iff (a = 0 and b divides n in Z) or (a != 0 and b/gcd(a, b) is co-prime with n, i.e. a unit in Z/nZ) in Z/2^kZ: TRUE iff ((a = 0 mod 2^k) and (b = 0 or b is a power of 2)) or ((a, b <> 0) and (b/gcd(a, b) is odd))

Definition at line 753 of file coeffs.h.

754{ assume(r != NULL);
755#ifdef HAVE_RINGS
756 if( nCoeff_is_Ring(r) )
757 {
758 assume(r->cfDivBy!=NULL); return r->cfDivBy(a,b,r);
759 }
760#endif
761 return !n_IsZero(b, r);
762}
static FORCE_INLINE BOOLEAN n_IsZero(number n, const coeffs r)
TRUE iff 'n' represents the zero element.
Definition: coeffs.h:464
static FORCE_INLINE BOOLEAN nCoeff_is_Ring(const coeffs r)
Definition: coeffs.h:730

◆ n_DivComp()

static FORCE_INLINE int n_DivComp ( number  a,
number  b,
const coeffs  r 
)
static

Definition at line 522 of file coeffs.h.

523{ assume(r != NULL); assume(r->cfDivComp!=NULL); return r->cfDivComp (a,b,r); }

◆ n_Equal()

static FORCE_INLINE BOOLEAN n_Equal ( number  a,
number  b,
const coeffs  r 
)
static

TRUE iff 'a' and 'b' represent the same number; they may have different representations.

Definition at line 460 of file coeffs.h.

461{ assume(r != NULL); assume(r->cfEqual!=NULL); return r->cfEqual(a, b, r); }

◆ n_EucNorm()

static FORCE_INLINE number n_EucNorm ( number  a,
const coeffs  r 
)
static

Definition at line 675 of file coeffs.h.

676{ assume(r != NULL); assume(r->cfEucNorm!=NULL); return r->cfEucNorm (a,r); }

◆ n_ExactDiv()

static FORCE_INLINE number n_ExactDiv ( number  a,
number  b,
const coeffs  r 
)
static

assume that there is a canonical subring in cf and we know that division is possible for these a and b in the subring, n_ExactDiv performs it, may skip additional tests. Can always be substituted by n_Div at the cost of larger computing time.

Definition at line 622 of file coeffs.h.

623{ assume(r != NULL); assume(r->cfExactDiv!=NULL); return r->cfExactDiv(a,b,r); }

◆ n_ExtGcd()

static FORCE_INLINE number n_ExtGcd ( number  a,
number  b,
number *  s,
number *  t,
const coeffs  r 
)
static

beware that ExtGCD is only relevant for a few chosen coeff. domains and may perform something unexpected in some cases...

Definition at line 671 of file coeffs.h.

672{ assume(r != NULL); assume(r->cfExtGcd!=NULL); return r->cfExtGcd (a,b,s,t,r); }
const CanonicalForm int s
Definition: facAbsFact.cc:51

◆ n_Farey()

static FORCE_INLINE number n_Farey ( number  a,
number  b,
const coeffs  r 
)
static

Definition at line 767 of file coeffs.h.

768{ assume(r != NULL); assume(r->cfFarey != NULL); return r->cfFarey(a,b,r); }

◆ n_Gcd()

static FORCE_INLINE number n_Gcd ( number  a,
number  b,
const coeffs  r 
)
static

in Z: return the gcd of 'a' and 'b' in Z/nZ, Z/2^kZ: computed as in the case Z in Z/pZ, C, R: not implemented in Q: return the gcd of the numerators of 'a' and 'b' in K(a)/<p(a)>: not implemented in K(t_1, ..., t_n): not implemented

Definition at line 664 of file coeffs.h.

665{ assume(r != NULL); assume(r->cfGcd!=NULL); return r->cfGcd(a,b,r); }

◆ n_GetChar()

static FORCE_INLINE int n_GetChar ( const coeffs  r)
static

Return the characteristic of the coeff. domain.

Definition at line 444 of file coeffs.h.

445{ assume(r != NULL); return r->ch; }

◆ n_GetDenom()

static FORCE_INLINE number n_GetDenom ( number &  n,
const coeffs  r 
)
static

return the denominator of n (if elements of r are by nature not fractional, result is 1)

Definition at line 603 of file coeffs.h.

604{ assume(r != NULL); assume(r->cfGetDenom!=NULL); return r->cfGetDenom(n, r); }

◆ n_GetNumerator()

static FORCE_INLINE number n_GetNumerator ( number &  n,
const coeffs  r 
)
static

return the numerator of n (if elements of r are by nature not fractional, result is n)

Definition at line 608 of file coeffs.h.

609{ assume(r != NULL); assume(r->cfGetNumerator!=NULL); return r->cfGetNumerator(n, r); }

◆ n_GetUnit()

static FORCE_INLINE number n_GetUnit ( number  n,
const coeffs  r 
)
static

in Z: 1 in Z/kZ (where k is not a prime): largest divisor of n (taken in Z) that is co-prime with k in Z/2^kZ: largest odd divisor of n (taken in Z) other cases: not implemented

Definition at line 532 of file coeffs.h.

533{ assume(r != NULL); assume(r->cfGetUnit!=NULL); return r->cfGetUnit(n,r); }

◆ n_Greater()

static FORCE_INLINE BOOLEAN n_Greater ( number  a,
number  b,
const coeffs  r 
)
static

ordered fields: TRUE iff 'a' is larger than 'b'; in Z/pZ: TRUE iff la > lb, where la and lb are the long's representing

in C: TRUE iff (Im(a) > Im(b)) in K(a)/<p(a)>: TRUE iff (a != 0 and (b == 0 or deg(a) > deg(b)) in K(t_1, ..., t_n): TRUE only if one or both numerator polynomials are zero or if their degrees are equal. In this case, TRUE if LC(numerator(a)) > LC(numerator(b)) in Z/2^kZ: TRUE if n_DivBy(a, b) in Z/mZ: TRUE iff the internal mpz's fulfill the relation '>' in Z: TRUE iff a > b

!!! Recommendation: remove implementations for unordered fields !!! and raise errors instead, in these cases

Definition at line 511 of file coeffs.h.

512{ assume(r != NULL); assume(r->cfGreater!=NULL); return r->cfGreater(a,b,r); }

◆ n_GreaterZero()

static FORCE_INLINE BOOLEAN n_GreaterZero ( number  n,
const coeffs  r 
)
static

ordered fields: TRUE iff 'n' is positive; in Z/pZ: TRUE iff 0 < m <= roundedBelow(p/2), where m is the long representing n in C: TRUE iff (Im(n) != 0 and Im(n) >= 0) or (Im(n) == 0 and Re(n) >= 0) in K(a)/<p(a)>: TRUE iff (n != 0 and (LC(n) > 0 or deg(n) > 0)) in K(t_1, ..., t_n): TRUE iff (LC(numerator(n) is a constant and > 0) or (LC(numerator(n) is not a constant) in Z/2^kZ: TRUE iff 0 < n <= 2^(k-1) in Z/mZ: TRUE iff the internal mpz is greater than zero in Z: TRUE iff n > 0

!!! Recommendation: remove implementations for unordered fields !!! and raise errors instead, in these cases !!! Do not follow this recommendation: while writing polys, !!! between 2 monomials will be an additional + iff !n_GreaterZero(next coeff) Then change definition to include n_GreaterZero => printing does NOT start with -

Definition at line 494 of file coeffs.h.

495{ assume(r != NULL); assume(r->cfGreaterZero!=NULL); return r->cfGreaterZero(n,r); }

◆ n_ImPart()

static FORCE_INLINE number n_ImPart ( number  i,
const coeffs  cf 
)
static

Definition at line 793 of file coeffs.h.

794{ assume(cf != NULL); assume(cf->cfImPart!=NULL); return cf->cfImPart(i,cf); }
int i
Definition: cfEzgcd.cc:132
CanonicalForm cf
Definition: cfModGcd.cc:4082

◆ n_Init()

static FORCE_INLINE number n_Init ( long  i,
const coeffs  r 
)
static

a number representing i in the given coeff field/ring r

Definition at line 538 of file coeffs.h.

539{ assume(r != NULL); assume(r->cfInit!=NULL); return r->cfInit(i,r); }

◆ n_InitMPZ()

static FORCE_INLINE number n_InitMPZ ( mpz_t  n,
const coeffs  r 
)
static

conversion of a GMP integer to number

Definition at line 542 of file coeffs.h.

543{ assume(r != NULL); assume(r->cfInitMPZ != NULL); return r->cfInitMPZ(n,r); }

◆ n_InpAdd()

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

addition of 'a' and 'b'; replacement of 'a' by the sum a+b

Definition at line 646 of file coeffs.h.

647{ assume(r != NULL); assume(r->cfInpAdd!=NULL); r->cfInpAdd(a,b,r); }

◆ n_InpMult()

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

multiplication of 'a' and 'b'; replacement of 'a' by the product a*b

Definition at line 641 of file coeffs.h.

642{ assume(r != NULL); assume(r->cfInpMult!=NULL); r->cfInpMult(a,b,r); }

◆ n_InpNeg()

static FORCE_INLINE number n_InpNeg ( number  n,
const coeffs  r 
)
static

in-place negation of n MUST BE USED: n = n_InpNeg(n) (no copy is returned)

Definition at line 557 of file coeffs.h.

558{ assume(r != NULL); assume(r->cfInpNeg!=NULL); return r->cfInpNeg(n,r); }

◆ n_Int()

static FORCE_INLINE long n_Int ( number &  n,
const coeffs  r 
)
static

conversion of n to an int; 0 if not possible in Z/pZ: the representing int lying in (-p/2 .. p/2]

Definition at line 547 of file coeffs.h.

548{ assume(r != NULL); assume(r->cfInt!=NULL); return r->cfInt(n,r); }

◆ n_IntMod()

static FORCE_INLINE number n_IntMod ( number  a,
number  b,
const coeffs  r 
)
static

for r a field, return n_Init(0,r) always: n_Div(a,b,r)*b+n_IntMod(a,b,r)==a n_IntMod(a,b,r) >=0

Definition at line 628 of file coeffs.h.

629{ assume(r != NULL); return r->cfIntMod(a,b,r); }

◆ n_Invers()

static FORCE_INLINE number n_Invers ( number  a,
const coeffs  r 
)
static

return the multiplicative inverse of 'a'; raise an error if 'a' is not invertible

!!! Recommendation: rename to 'n_Inverse'

Definition at line 564 of file coeffs.h.

565{ assume(r != NULL); assume(r->cfInvers!=NULL); return r->cfInvers(a,r); }

◆ n_IsMOne()

static FORCE_INLINE BOOLEAN n_IsMOne ( number  n,
const coeffs  r 
)
static

TRUE iff 'n' represents the additive inverse of the one element, i.e. -1.

Definition at line 472 of file coeffs.h.

473{ assume(r != NULL); assume(r->cfIsMOne!=NULL); return r->cfIsMOne(n,r); }

◆ n_IsOne()

static FORCE_INLINE BOOLEAN n_IsOne ( number  n,
const coeffs  r 
)
static

TRUE iff 'n' represents the one element.

Definition at line 468 of file coeffs.h.

469{ assume(r != NULL); assume(r->cfIsOne!=NULL); return r->cfIsOne(n,r); }

◆ n_IsUnit()

static FORCE_INLINE BOOLEAN n_IsUnit ( number  n,
const coeffs  r 
)
static

TRUE iff n has a multiplicative inverse in the given coeff field/ring r.

Definition at line 515 of file coeffs.h.

516{ assume(r != NULL); assume(r->cfIsUnit!=NULL); return r->cfIsUnit(n,r); }

◆ n_IsZero()

static FORCE_INLINE BOOLEAN n_IsZero ( number  n,
const coeffs  r 
)
static

TRUE iff 'n' represents the zero element.

Definition at line 464 of file coeffs.h.

465{ assume(r != NULL); assume(r->cfIsZero!=NULL); return r->cfIsZero(n,r); }

◆ n_Lcm()

static FORCE_INLINE number n_Lcm ( number  a,
number  b,
const coeffs  r 
)
static

in Z: return the lcm of 'a' and 'b' in Z/nZ, Z/2^kZ: computed as in the case Z in Z/pZ, C, R: not implemented in K(a)/<p(a)>: not implemented in K(t_1, ..., t_n): not implemented

Definition at line 690 of file coeffs.h.

691{ assume(r != NULL); assume(r->cfLcm!=NULL); return r->cfLcm(a,b,r); }

◆ n_MPZ()

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

conversion of n to a GMP integer; 0 if not possible

Definition at line 551 of file coeffs.h.

552{ assume(r != NULL); assume(r->cfMPZ!=NULL); r->cfMPZ(result, n, r); }
return result
Definition: facAbsBiFact.cc:75

◆ n_Mult()

static FORCE_INLINE number n_Mult ( number  a,
number  b,
const coeffs  r 
)
static

return the product of 'a' and 'b', i.e., a*b

Definition at line 636 of file coeffs.h.

637{ assume(r != NULL); assume(r->cfMult!=NULL); return r->cfMult(a, b, r); }

◆ n_Normalize()

static FORCE_INLINE void n_Normalize ( number &  n,
const coeffs  r 
)
static

inplace-normalization of n; produces some canonical representation of n;

!!! Recommendation: remove this method from the user-interface, i.e., !!! this should be hidden

Definition at line 578 of file coeffs.h.

579{ assume(r != NULL); assume(r->cfNormalize!=NULL); r->cfNormalize(n,r); }

◆ n_NormalizeHelper()

static FORCE_INLINE number n_NormalizeHelper ( number  a,
number  b,
const coeffs  r 
)
static

assume that r is a quotient field (otherwise, return 1) for arguments (a1/a2,b1/b2) return (lcm(a1,b2)/1)

Definition at line 695 of file coeffs.h.

696{ assume(r != NULL); assume(r->cfNormalizeHelper!=NULL); return r->cfNormalizeHelper(a,b,r); }

◆ n_NumberOfParameters()

static FORCE_INLINE int n_NumberOfParameters ( const coeffs  r)
static

Returns the number of parameters.

Definition at line 774 of file coeffs.h.

775{ assume(r != NULL); return r->iNumberOfParameters; }

◆ n_Param()

static FORCE_INLINE number n_Param ( const int  iParameter,
const coeffs  r 
)
static

return the (iParameter^th) parameter as a NEW number NOTE: parameter numbering: 1..n_NumberOfParameters(...)

Definition at line 783 of file coeffs.h.

784{ assume(r != NULL);
785 assume((iParameter >= 1) || (iParameter <= n_NumberOfParameters(r)));
786 assume(r->cfParameter != NULL);
787 return r->cfParameter(iParameter, r);
788}
static FORCE_INLINE int n_NumberOfParameters(const coeffs r)
Returns the number of parameters.
Definition: coeffs.h:774

◆ n_ParameterNames()

static FORCE_INLINE char const ** n_ParameterNames ( const coeffs  r)
static

Returns a (const!) pointer to (const char*) names of parameters.

Definition at line 778 of file coeffs.h.

779{ assume(r != NULL); return r->pParameterNames; }

◆ n_ParDeg()

static FORCE_INLINE int n_ParDeg ( number  n,
const coeffs  r 
)
static

Definition at line 770 of file coeffs.h.

771{ assume(r != NULL); assume(r->cfParDeg != NULL); return r->cfParDeg(n,r); }

◆ n_Power()

static FORCE_INLINE void n_Power ( number  a,
int  b,
number *  res,
const coeffs  r 
)
static

fill res with the power a^b

Definition at line 632 of file coeffs.h.

633{ assume(r != NULL); assume(r->cfPower!=NULL); r->cfPower(a,b,res,r); }
CanonicalForm res
Definition: facAbsFact.cc:60

◆ n_Print()

void n_Print ( number &  a,
const coeffs  r 
)

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

Definition at line 646 of file numbers.cc.

648{
649 assume(r != NULL);
650 n_Test(a,r);
651
652 StringSetS("");
653 n_Write(a, r);
654 { char* s = StringEndS(); Print("%s", s); omFree(s); }
#define n_Test(a, r)
BOOLEAN n_Test(number a, const coeffs r)
Definition: coeffs.h:712
static FORCE_INLINE void n_Write(number n, const coeffs r, const BOOLEAN bShortOut=TRUE)
Definition: coeffs.h:591
#define Print
Definition: emacs.cc:80
#define omFree(addr)
Definition: omAllocDecl.h:261
void StringSetS(const char *st)
Definition: reporter.cc:128
char * StringEndS()
Definition: reporter.cc:151

◆ n_QuotRem()

static FORCE_INLINE number n_QuotRem ( number  a,
number  b,
number *  q,
const coeffs  r 
)
static

Definition at line 681 of file coeffs.h.

682{ assume(r != NULL); assume(r->cfQuotRem!=NULL); return r->cfQuotRem (a,b,q,r); }

◆ n_Random()

static FORCE_INLINE number n_Random ( siRandProc  p,
number  p1,
number  p2,
const coeffs  cf 
)
static

Definition at line 966 of file coeffs.h.

967{ assume( cf != NULL ); assume( cf->cfRandom != NULL ); return cf->cfRandom(p, p1, p2, cf); }

◆ n_Read()

static FORCE_INLINE const char * n_Read ( const char *  s,
number *  a,
const coeffs  r 
)
static

!!! Recommendation: This method is too cryptic to be part of the user- !!! interface. As defined here, it is merely a helper !!! method for parsing number input strings.

Definition at line 598 of file coeffs.h.

599{ assume(r != NULL); assume(r->cfRead!=NULL); return r->cfRead(s, a, r); }

◆ n_ReadFd()

static FORCE_INLINE number n_ReadFd ( const ssiInfo f,
const coeffs  r 
)
static

io via ssi:

Definition at line 974 of file coeffs.h.

975{ assume(r != NULL); assume(r->cfReadFd != NULL); return r->cfReadFd(f, r); }
FILE * f
Definition: checklibs.c:9

◆ n_RePart()

static FORCE_INLINE number n_RePart ( number  i,
const coeffs  cf 
)
static

Definition at line 790 of file coeffs.h.

791{ assume(cf != NULL); assume(cf->cfRePart!=NULL); return cf->cfRePart(i,cf); }

◆ n_SetMap()

static FORCE_INLINE nMapFunc n_SetMap ( const coeffs  src,
const coeffs  dst 
)
static

set the mapping function pointers for translating numbers from src to dst

Definition at line 700 of file coeffs.h.

701{ assume(src != NULL && dst != NULL); assume(dst->cfSetMap!=NULL);
702 if (src==dst) return ndCopyMap;
703 return dst->cfSetMap(src,dst);
704}
number ndCopyMap(number a, const coeffs src, const coeffs dst)
Definition: numbers.cc:282

◆ n_Size()

static FORCE_INLINE int n_Size ( number  n,
const coeffs  r 
)
static

return a non-negative measure for the complexity of n; return 0 only when n represents zero; (used for pivot strategies in matrix computations with entries from r)

Definition at line 570 of file coeffs.h.

571{ assume(r != NULL); assume(r->cfSize!=NULL); return r->cfSize(n,r); }

◆ n_Sub()

static FORCE_INLINE number n_Sub ( number  a,
number  b,
const coeffs  r 
)
static

return the difference of 'a' and 'b', i.e., a-b

Definition at line 655 of file coeffs.h.

656{ assume(r != NULL); assume(r->cfSub!=NULL); return r->cfSub(a, b, r); }

◆ n_SubringGcd()

static FORCE_INLINE number n_SubringGcd ( number  a,
number  b,
const coeffs  r 
)
static

Definition at line 666 of file coeffs.h.

667{ assume(r != NULL); assume(r->cfSubringGcd!=NULL); return r->cfSubringGcd(a,b,r); }

◆ n_Write()

static FORCE_INLINE void n_Write ( number  n,
const coeffs  r,
const BOOLEAN  bShortOut = TRUE 
)
static

Definition at line 591 of file coeffs.h.

592{ if (bShortOut) n_WriteShort(n, r); else n_WriteLong(n, r); }
static FORCE_INLINE void n_WriteLong(number n, const coeffs r)
write to the output buffer of the currently used reporter
Definition: coeffs.h:583
static FORCE_INLINE void n_WriteShort(number n, const coeffs r)
write to the output buffer of the currently used reporter in a shortest possible way,...
Definition: coeffs.h:588

◆ n_WriteFd()

static FORCE_INLINE void n_WriteFd ( number  a,
const ssiInfo f,
const coeffs  r 
)
static

io via ssi:

Definition at line 970 of file coeffs.h.

971{ assume(r != NULL); assume(r->cfWriteFd != NULL); return r->cfWriteFd(a, f, r); }

◆ n_WriteLong()

static FORCE_INLINE void n_WriteLong ( number  n,
const coeffs  r 
)
static

write to the output buffer of the currently used reporter

Definition at line 583 of file coeffs.h.

584{ assume(r != NULL); assume(r->cfWriteLong!=NULL); r->cfWriteLong(n,r); }

◆ n_WriteShort()

static FORCE_INLINE void n_WriteShort ( number  n,
const coeffs  r 
)
static

write to the output buffer of the currently used reporter in a shortest possible way, e.g. in K(a): a2 instead of a^2

Definition at line 588 of file coeffs.h.

589{ assume(r != NULL); assume(r->cfWriteShort!=NULL); r->cfWriteShort(n,r); }

◆ n_XExtGcd()

static FORCE_INLINE number n_XExtGcd ( number  a,
number  b,
number *  s,
number *  t,
number *  u,
number *  v,
const coeffs  r 
)
static

Definition at line 673 of file coeffs.h.

674{ assume(r != NULL); assume(r->cfXExtGcd!=NULL); return r->cfXExtGcd (a,b,s,t,u,v,r); }
const Variable & v
< [in] a sqrfree bivariate poly
Definition: facBivar.h:39

◆ nCoeff_has_simple_Alloc()

static FORCE_INLINE BOOLEAN nCoeff_has_simple_Alloc ( const coeffs  r)
static

TRUE if n_Delete/n_New are empty operations.

Definition at line 906 of file coeffs.h.

907{ assume(r != NULL); return r->has_simple_Alloc; }

◆ nCoeff_has_simple_inverse()

static FORCE_INLINE BOOLEAN nCoeff_has_simple_inverse ( const coeffs  r)
static

TRUE, if the computation of the inverse is fast, i.e. prefer leading coeff. 1 over content.

Definition at line 902 of file coeffs.h.

903{ assume(r != NULL); return r->has_simple_Inverse; }

◆ nCoeff_has_Units()

static FORCE_INLINE BOOLEAN nCoeff_has_Units ( const coeffs  r)
static

returns TRUE, if r is not a field and r has non-trivial units

Definition at line 797 of file coeffs.h.

798{ assume(r != NULL); return ((getCoeffType(r)==n_Zn) || (getCoeffType(r)==n_Z2m) || (getCoeffType(r)==n_Znm)); }
static FORCE_INLINE n_coeffType getCoeffType(const coeffs r)
Returns the type of coeffs domain.
Definition: coeffs.h:421

◆ nCoeff_is_algExt()

static FORCE_INLINE BOOLEAN nCoeff_is_algExt ( const coeffs  r)
static

TRUE iff r represents an algebraic extension field.

Definition at line 910 of file coeffs.h.

911{ assume(r != NULL); return (getCoeffType(r)==n_algExt); }

◆ nCoeff_is_CF()

static FORCE_INLINE BOOLEAN nCoeff_is_CF ( const coeffs  r)
static

Definition at line 897 of file coeffs.h.

898{ assume(r != NULL); return getCoeffType(r)==n_CF; }

◆ nCoeff_is_Domain()

static FORCE_INLINE BOOLEAN nCoeff_is_Domain ( const coeffs  r)
static

returns TRUE, if r is a field or r has no zero divisors (i.e is a domain)

Definition at line 739 of file coeffs.h.

740{
741 assume(r != NULL);
742 return (r->is_domain);
743}

◆ nCoeff_is_Extension()

static FORCE_INLINE BOOLEAN nCoeff_is_Extension ( const coeffs  r)
static

Definition at line 846 of file coeffs.h.

847{
848 assume(r != NULL);
849 return (getCoeffType(r)==n_algExt) || (getCoeffType(r)==n_transExt);
850}

◆ nCoeff_is_GF() [1/2]

static FORCE_INLINE BOOLEAN nCoeff_is_GF ( const coeffs  r)
static

Definition at line 839 of file coeffs.h.

840{ assume(r != NULL); return getCoeffType(r)==n_GF; }

◆ nCoeff_is_GF() [2/2]

static FORCE_INLINE BOOLEAN nCoeff_is_GF ( const coeffs  r,
int  q 
)
static

Definition at line 842 of file coeffs.h.

843{ assume(r != NULL); return (getCoeffType(r)==n_GF) && (r->ch == q); }

◆ nCoeff_is_long_C()

static FORCE_INLINE BOOLEAN nCoeff_is_long_C ( const coeffs  r)
static

Definition at line 894 of file coeffs.h.

895{ assume(r != NULL); return getCoeffType(r)==n_long_C; }

◆ nCoeff_is_long_R()

static FORCE_INLINE BOOLEAN nCoeff_is_long_R ( const coeffs  r)
static

Definition at line 891 of file coeffs.h.

892{ assume(r != NULL); return getCoeffType(r)==n_long_R; }

◆ nCoeff_is_numeric()

static FORCE_INLINE BOOLEAN nCoeff_is_numeric ( const coeffs  r)
static

Definition at line 832 of file coeffs.h.

833{ assume(r != NULL); return (getCoeffType(r)==n_R) || (getCoeffType(r)==n_long_R) || (getCoeffType(r)==n_long_C); }

◆ nCoeff_is_Q()

static FORCE_INLINE BOOLEAN nCoeff_is_Q ( const coeffs  r)
static

Definition at line 806 of file coeffs.h.

807{
808 assume(r != NULL);
809 #if SI_INTEGER_VARIANT==1
810 return getCoeffType(r)==n_Q && (r->is_field);
811 #else
812 return getCoeffType(r)==n_Q;
813 #endif
814}

◆ nCoeff_is_Q_a()

static FORCE_INLINE BOOLEAN nCoeff_is_Q_a ( const coeffs  r)
static

Definition at line 885 of file coeffs.h.

886{
887 assume(r != NULL);
888 return ((n_GetChar(r) == 0) && nCoeff_is_Extension(r));
889}
static FORCE_INLINE BOOLEAN nCoeff_is_Extension(const coeffs r)
Definition: coeffs.h:846
static FORCE_INLINE int n_GetChar(const coeffs r)
Return the characteristic of the coeff. domain.
Definition: coeffs.h:444

◆ nCoeff_is_Q_algext()

static FORCE_INLINE BOOLEAN nCoeff_is_Q_algext ( const coeffs  r)
static

is it an alg. ext. of Q?

Definition at line 914 of file coeffs.h.

915{ assume(r != NULL); return ((n_GetChar(r) == 0) && nCoeff_is_algExt(r)); }
static FORCE_INLINE BOOLEAN nCoeff_is_algExt(const coeffs r)
TRUE iff r represents an algebraic extension field.
Definition: coeffs.h:910

◆ nCoeff_is_Q_or_BI()

static FORCE_INLINE BOOLEAN nCoeff_is_Q_or_BI ( const coeffs  r)
static

Definition at line 829 of file coeffs.h.

830{ assume(r != NULL); return getCoeffType(r)==n_Q; }

◆ nCoeff_is_R()

static FORCE_INLINE BOOLEAN nCoeff_is_R ( const coeffs  r)
static

Definition at line 836 of file coeffs.h.

837{ assume(r != NULL); return getCoeffType(r)==n_R; }

◆ nCoeff_is_Ring()

static FORCE_INLINE BOOLEAN nCoeff_is_Ring ( const coeffs  r)
static

Definition at line 730 of file coeffs.h.

731{ assume(r != NULL); return (r->is_field==0); }

◆ nCoeff_is_Ring_2toM()

static FORCE_INLINE BOOLEAN nCoeff_is_Ring_2toM ( const coeffs  r)
static

Definition at line 724 of file coeffs.h.

725{ assume(r != NULL); return (getCoeffType(r)==n_Z2m); }

◆ nCoeff_is_Ring_PtoM()

static FORCE_INLINE BOOLEAN nCoeff_is_Ring_PtoM ( const coeffs  r)
static

Definition at line 727 of file coeffs.h.

728{ assume(r != NULL); return (getCoeffType(r)==n_Znm); }

◆ nCoeff_is_transExt()

static FORCE_INLINE BOOLEAN nCoeff_is_transExt ( const coeffs  r)
static

TRUE iff r represents a transcendental extension field.

Definition at line 918 of file coeffs.h.

919{ assume(r != NULL); return (getCoeffType(r)==n_transExt); }

◆ nCoeff_is_Z()

static FORCE_INLINE BOOLEAN nCoeff_is_Z ( const coeffs  r)
static

Definition at line 816 of file coeffs.h.

817{
818 assume(r != NULL);
819 #if SI_INTEGER_VARIANT==1
820 return ((getCoeffType(r)==n_Q) && (!r->is_field));
821 #else
822 return getCoeffType(r)==n_Z;
823 #endif
824}

◆ nCoeff_is_Zn()

static FORCE_INLINE BOOLEAN nCoeff_is_Zn ( const coeffs  r)
static

Definition at line 826 of file coeffs.h.

827{ assume(r != NULL); return getCoeffType(r)==n_Zn; }

◆ nCoeff_is_Zp() [1/2]

static FORCE_INLINE BOOLEAN nCoeff_is_Zp ( const coeffs  r)
static

Definition at line 800 of file coeffs.h.

801{ assume(r != NULL); return getCoeffType(r)==n_Zp; }

◆ nCoeff_is_Zp() [2/2]

static FORCE_INLINE BOOLEAN nCoeff_is_Zp ( const coeffs  r,
int  p 
)
static

Definition at line 803 of file coeffs.h.

804{ assume(r != NULL); return ((getCoeffType(r)==n_Zp) && (r->ch == p)); }

◆ nCoeff_is_Zp_a() [1/2]

static FORCE_INLINE BOOLEAN nCoeff_is_Zp_a ( const coeffs  r)
static

Definition at line 859 of file coeffs.h.

860{
861 assume(r != NULL);
862 return ((!nCoeff_is_Ring(r)) && (n_GetChar(r) != 0) && nCoeff_is_Extension(r));
863}

◆ nCoeff_is_Zp_a() [2/2]

static FORCE_INLINE BOOLEAN nCoeff_is_Zp_a ( const coeffs  r,
int  p 
)
static

Definition at line 872 of file coeffs.h.

873{
874 assume(r != NULL);
875 assume(p != 0);
876 return ((!nCoeff_is_Ring(r)) && (n_GetChar(r) == p) && nCoeff_is_Extension(r));
877}

◆ nCoeffName()

static FORCE_INLINE char * nCoeffName ( const coeffs  cf)
static

Definition at line 963 of file coeffs.h.

964{ assume( cf != NULL ); return cf->cfCoeffName(cf); }

◆ nCoeffString()

static FORCE_INLINE char * nCoeffString ( const coeffs  cf)
static

TODO: make it a virtual method of coeffs, together with: Decompose & Compose, rParameter & rPar.

Definition at line 959 of file coeffs.h.

960{ assume( cf != NULL ); return cf->cfCoeffString(cf); }

◆ nCopyCoeff()

static FORCE_INLINE coeffs nCopyCoeff ( const coeffs  r)
static

"copy" coeffs, i.e. increment ref

Definition at line 429 of file coeffs.h.

430{ assume(r!=NULL); r->ref++; return r;}

◆ ndCopyMap()

number ndCopyMap ( number  a,
const coeffs  src,
const coeffs  dst 
)

Definition at line 282 of file numbers.cc.

283{
284 // aRing and r need not be the same, but must be the same representation
285 assume(aRing->rep==r->rep);
287 return a;
288 else
289 return r->cfCopy(a, r);
290}
static FORCE_INLINE BOOLEAN nCoeff_has_simple_Alloc(const coeffs r)
TRUE if n_Delete/n_New are empty operations.
Definition: coeffs.h:906

◆ nInitChar()

coeffs nInitChar ( n_coeffType  t,
void *  parameter 
)

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

Definition at line 392 of file numbers.cc.

394{
396
397 while((n!=NULL) && (n->nCoeffIsEqual!=NULL) && (!n->nCoeffIsEqual(n,t,parameter)))
398 n=n->next;
399
400 if (n==NULL)
401 {
402 n=(n_Procs_s*)omAlloc0(sizeof(n_Procs_s));
403 n->next=cf_root;
404 n->ref=1;
405 n->type=t;
406
407 // default entries (different from NULL) for some routines:
409 n->cfSize = ndSize;
413 n->cfDelete= ndDelete;
414 n->cfAnn = ndAnn;
417 n->cfCoeffName = ndCoeffName; // should alway be changed!
420 n->cfCopy = ndCopy;
421 n->cfIntMod=ndIntMod; /* dummy !! */
423 n->cfGcd = ndGcd;
424 n->cfNormalizeHelper = ndGcd; /* tricky, isn't it ?*/
425 n->cfLcm = ndGcd; /* tricky, isn't it ?*/
426 n->cfInitMPZ = ndInitMPZ;
427 n->cfMPZ = ndMPZ;
428 n->cfPower = ndPower;
429 n->cfQuotRem = ndQuotRem;
430 n->cfInvers = ndInvers;
431 n->cfRandom = ndRandom;
432
433 n->cfKillChar = ndKillChar; /* dummy */
434 n->cfSetChar = ndSetChar; /* dummy */
435 // temp. removed to catch all the coeffs which miss to implement this!
436
437 n->cfChineseRemainder = ndChineseRemainder; /* not implemented */
438 n->cfFarey = ndFarey; /* not implemented */
439 n->cfParDeg = ndParDeg; /* not implemented */
440 n->cfReadFd = ndReadFd; /* not implemented */
441 n->cfWriteFd = ndWriteFd; /* not implemented */
442
444
447
448 n->cfEucNorm = ndEucNorm;
449#ifdef HAVE_RINGS
450 n->cfDivComp = ndDivComp;
451 n->cfDivBy = ndDivBy;
452 n->cfExtGcd = ndExtGcd;
453 n->cfXExtGcd = ndXExtGcd;
454 //n->cfGetUnit = ndGetUnit_Ring;// set afterwards
455#endif
456
457 // report error, if not redefined
458 n->cfRead=ndRead;
460
461#ifdef LDEBUG
463#endif
464
467
468 BOOLEAN nOK=TRUE;
469 // init
470 if ((t<=nLastCoeffs) && (nInitCharTable[t]!=NULL))
471 nOK = (nInitCharTable[t])(n,parameter);
472 else
473 Werror("Sorry: the coeff type [%d] was not registered: it is missing in nInitCharTable", (int)t);
474 if (nOK)
475 {
476 omFreeSize(n,sizeof(*n));
477 return NULL;
478 }
479 cf_root=n;
480 // post init settings:
481 if (n->cfRePart==NULL) n->cfRePart=n->cfCopy;
482 if (n->cfExactDiv==NULL) n->cfExactDiv=n->cfDiv;
483 if (n->cfSubringGcd==NULL) n->cfSubringGcd=n->cfGcd;
484 if (n->cfWriteShort==NULL) n->cfWriteShort = n->cfWriteLong;
485 if (n->cfIsUnit==NULL)
486 {
488 else n->cfIsUnit=ndIsUnit_Ring;
489 }
490 #ifdef HAVE_RINGS
491 if (n->cfGetUnit==NULL)
492 {
493 if (n->is_field) n->cfGetUnit=n->cfCopy;
495 }
496 if ((n->cfInvers==ndInvers)&&(n->is_field))
497 {
499 }
500 #endif
501
502
503 if(n->cfMult==NULL) PrintS("cfMult missing\n");
504 if(n->cfSub==NULL) PrintS("cfSub missing\n");
505 if(n->cfAdd==NULL) PrintS("cfAdd missing\n");
506 if(n->cfDiv==NULL) PrintS("cfDiv missing\n");
507 if(n->cfExactDiv==NULL) PrintS("cfExactDiv missing\n");
508 if(n->cfInit==NULL) PrintS("cfInit missing\n");
509 if(n->cfInt==NULL) PrintS("cfInt missing\n");
510 if(n->cfIsUnit==NULL) PrintS("cfIsUnit missing\n");
511 if(n->cfGetUnit==NULL) PrintS("cfGetUnit missing\n");
512 if(n->cfInpNeg==NULL) PrintS("cfInpNeg missing\n");
513 if(n->cfXExtGcd==NULL) PrintS("cfXExtGcd missing\n");
514 if(n->cfAnn==NULL) PrintS("cfAnn missing\n");
515 if(n->cfWriteLong==NULL) PrintS("cfWriteLong missing\n");
516
518
519 assume( (n->iNumberOfParameters == 0 && n->pParameterNames == NULL) ||
520 (n->iNumberOfParameters > 0 && n->pParameterNames != NULL) );
521
522
523 if(n->cfGreater==NULL) PrintS("cfGreater missing\n");
524 if(n->cfEqual==NULL) PrintS("cfEqual missing\n");
525 if(n->cfIsZero==NULL) PrintS("cfIsZero missing\n");
526 if(n->cfIsOne==NULL) PrintS("cfIsOne missing\n");
527 if(n->cfIsMOne==NULL) PrintS("cfIsMOne missing\n");
528 if(n->cfGreaterZero==NULL) PrintS("cfGreaterZero missing\n");
529 /* error reporter:
530 if(n->cfRead==ndRead) PrintS("cfRead missing\n");
531 if(n->cfSetMap==ndSetMap) PrintS("cfSetMap missing\n");
532 */
533
534 assume(n->type==t);
535
536#ifndef SING_NDEBUG
537 if(n->cfWriteLong==NULL) Warn("cfWrite is NULL for coeff %d",t);
538 if(n->cfWriteShort==NULL) Warn("cfWriteShort is NULL for coeff %d",t);
539#endif
540 }
541 else
542 {
543 n->ref++;
544 }
545 return n;
int BOOLEAN
Definition: auxiliary.h:87
#define TRUE
Definition: auxiliary.h:100
#define Warn
Definition: emacs.cc:77
static void ndPower(number a, int i, number *res, const coeffs r)
Definition: numbers.cc:79
static BOOLEAN ndIsUnit_Field(number a, const coeffs r)
Definition: numbers.cc:127
CanonicalForm ndConvSingNFactoryN(number, BOOLEAN, const coeffs)
Definition: numbers.cc:303
static int ndDivComp(number, number, const coeffs)
Definition: numbers.cc:299
static number ndEucNorm(number a, const coeffs cf)
Definition: numbers.cc:133
static number ndGetUnit_Ring(number, const coeffs r)
Definition: numbers.cc:129
static BOOLEAN ndDBTest(number, const char *, const int, const coeffs)
Definition: numbers.cc:137
number ndGcd(number, number, const coeffs r)
Definition: numbers.cc:192
static void ndKillChar(coeffs)
Definition: numbers.cc:292
static number ndConvFactoryNSingN(const CanonicalForm, const coeffs)
[in, out] a bigint number >= 0
Definition: numbers.cc:310
static void ndClearDenominators(ICoeffsEnumerator &, number &d, const coeffs r)
Definition: numbers.cc:272
static void ndClearContent(ICoeffsEnumerator &numberCollectionEnumerator, number &c, const coeffs r)
Definition: numbers.cc:198
number ndReadFd(const ssiInfo *f, const coeffs r)
Definition: numbers.cc:155
static int ndParDeg(number n, const coeffs r)
Definition: numbers.cc:166
static BOOLEAN ndCoeffIsEqual(const coeffs r, n_coeffType n, void *)
Definition: numbers.cc:340
VAR n_Procs_s * cf_root
Definition: numbers.cc:45
static BOOLEAN ndIsUnit_Ring(number a, const coeffs r)
Definition: numbers.cc:125
void ndNormalize(number &, const coeffs)
Definition: numbers.cc:190
static int ndSize(number a, const coeffs r)
Definition: numbers.cc:196
static number ndIntMod(number, number, const coeffs r)
Definition: numbers.cc:193
void ndInpAdd(number &a, number b, const coeffs r)
Definition: numbers.cc:72
static void ndWriteFd(number a, const ssiInfo *f, const coeffs r)
Definition: numbers.cc:161
static number ndFarey(number, number, const coeffs r)
Definition: numbers.cc:140
static void ndMPZ(mpz_t result, number &n, const coeffs r)
Converts a non-negative bigint number into a GMP number.
Definition: numbers.cc:318
STATIC_VAR n_coeffType nLastCoeffs
Definition: numbers.cc:354
static number ndAnn(number, const coeffs)
Definition: numbers.cc:51
static number ndGetDenom(number &, const coeffs r)
Definition: numbers.cc:194
static void ndDelete(number *d, const coeffs)
Definition: numbers.cc:50
STATIC_VAR cfInitCharProc * nInitCharTable
Definition: numbers.cc:388
static number ndInvers_Ring(number a, const coeffs r)
Definition: numbers.cc:116
static number ndParameter(const int, const coeffs r)
Definition: numbers.cc:171
static number ndXExtGcd(number a, number b, number *s, number *t, number *u, number *v, const coeffs r)
Definition: numbers.cc:145
static number ndCopy(number a, const coeffs)
Definition: numbers.cc:281
static void ndInpMult(number &a, number b, const coeffs r)
Definition: numbers.cc:66
static number ndChineseRemainder(number *, number *, int, BOOLEAN, CFArray &, const coeffs r)
Definition: numbers.cc:150
static char * ndCoeffString(const coeffs r)
Definition: numbers.cc:52
static number ndGetNumerator(number &a, const coeffs r)
Definition: numbers.cc:195
static BOOLEAN ndDivBy(number, number, const coeffs)
Definition: numbers.cc:298
static number ndInitMPZ(mpz_t m, const coeffs r)
Definition: numbers.cc:323
static nMapFunc ndSetMap(const coeffs src, const coeffs dst)
Definition: numbers.cc:333
static const char * ndRead(const char *s, number *, const coeffs r)
Definition: numbers.cc:328
static number ndInvers(number a, const coeffs r)
Definition: numbers.cc:109
static void ndCoeffWrite(const coeffs r, BOOLEAN)
Definition: numbers.cc:56
static number ndRandom(siRandProc p, number p1, number p2, const coeffs cf)
Definition: numbers.cc:131
static number ndReturn0(number, const coeffs r)
Definition: numbers.cc:191
static number ndExtGcd(number, number, number *, number *, const coeffs r)
Definition: numbers.cc:300
static number ndQuotRem(number a, number b, number *r, const coeffs R)
Definition: numbers.cc:347
static char * ndCoeffName(const coeffs r)
Definition: numbers.cc:60
static void ndSetChar(const coeffs)
Definition: numbers.cc:293
#define omFreeSize(addr, size)
Definition: omAllocDecl.h:260
#define omAlloc0(size)
Definition: omAllocDecl.h:211
void PrintS(const char *s)
Definition: reporter.cc:284
void Werror(const char *fmt,...)
Definition: reporter.cc:189
BOOLEAN(* cfIsUnit)(number a, const coeffs r)
Definition: coeffs.h:378
number(* cfChineseRemainder)(number *x, number *q, int rl, BOOLEAN sym, CFArray &inv_cache, const coeffs)
chinese remainder returns X with X mod q[i]=x[i], i=0..rl-1
Definition: coeffs.h:297
number(* cfNormalizeHelper)(number a, number b, const coeffs r)
Definition: coeffs.h:271
int(* cfDivComp)(number a, number b, const coeffs r)
Definition: coeffs.h:377
BOOLEAN(*)(*)(*)(*)(*)(*) cfGreaterZero(number a, const coeffs r)
Definition: coeffs.h:237
number(* cfExtGcd)(number a, number b, number *s, number *t, const coeffs r)
Definition: coeffs.h:248
number(* cfGetUnit)(number a, const coeffs r)
Definition: coeffs.h:379
number(* cfLcm)(number a, number b, const coeffs r)
Definition: coeffs.h:270
number(* cfGetNumerator)(number &n, const coeffs r)
Definition: coeffs.h:241
number(* cfInvers)(number a, const coeffs r)
return 1/a
Definition: coeffs.h:197
number(* cfInit)(long i, const coeffs r)
init with an integer
Definition: coeffs.h:178
int iNumberOfParameters
Number of Parameters in the coeffs (default 0)
Definition: coeffs.h:319
number(* cfInpNeg)(number a, const coeffs r)
changes argument inline: a:= -a return -a! (no copy is returned) the result should be assigned to the...
Definition: coeffs.h:195
number(* cfInitMPZ)(mpz_t i, const coeffs r)
init with a GMP integer
Definition: coeffs.h:181
BOOLEAN is_field
TRUE, if cf is a field.
Definition: coeffs.h:140
nMapFunc(* cfSetMap)(const coeffs src, const coeffs dst)
Definition: coeffs.h:275
number(* cfParameter)(const int i, const coeffs r)
create i^th parameter or NULL if not possible
Definition: coeffs.h:303
void(* cfSetChar)(const coeffs r)
Definition: coeffs.h:161
number(* convFactoryNSingN)(const CanonicalForm n, const coeffs r)
conversion to CanonicalForm(factory) to number
Definition: coeffs.h:315
number(* cfGcd)(number a, number b, const coeffs r)
Definition: coeffs.h:246
number(* cfImPart)(number a, const coeffs r)
Definition: coeffs.h:201
number(* cfFarey)(number p, number n, const coeffs)
rational reconstruction: "best" rational a/b with a/b = p mod n
Definition: coeffs.h:291
coeffs next
Definition: coeffs.h:125
number(* cfCopy)(number a, const coeffs r)
return a copy of a
Definition: coeffs.h:199
int ref
Definition: coeffs.h:126
BOOLEAN(*)(*)(*) cfIsZero(number a, const coeffs r)
Definition: coeffs.h:228
void(* cfKillChar)(coeffs r)
Definition: coeffs.h:159
BOOLEAN(*)(*) cfEqual(number a, number b, const coeffs r)
tests
Definition: coeffs.h:227
numberfunc cfIntMod
Definition: coeffs.h:175
numberfunc cfExactDiv
Definition: coeffs.h:175
void(* cfMPZ)(mpz_t result, number &n, const coeffs r)
Converts a (integer) number n into a GMP number, 0 if impossible.
Definition: coeffs.h:190
BOOLEAN(* nCoeffIsEqual)(const coeffs r, n_coeffType n, void *parameter)
Definition: coeffs.h:145
number(* cfXExtGcd)(number a, number b, number *s, number *t, number *u, number *v, const coeffs r)
Definition: coeffs.h:256
void(* cfWriteShort)(number a, const coeffs r)
print a given number in a shorter way, if possible e.g. in K(a): a2 instead of a^2
Definition: coeffs.h:208
number(* cfRePart)(number a, const coeffs r)
Definition: coeffs.h:200
void(* cfNormalize)(number &a, const coeffs r)
Definition: coeffs.h:223
numberfunc cfMult
Definition: coeffs.h:175
number(* cfGetDenom)(number &n, const coeffs r)
Definition: coeffs.h:240
void(* cfWriteLong)(number a, const coeffs r)
print a given number (long format)
Definition: coeffs.h:204
number(* cfSubringGcd)(number a, number b, const coeffs r)
Definition: coeffs.h:247
BOOLEAN(*)(*)(*)(*) cfIsOne(number a, const coeffs r)
Definition: coeffs.h:229
number(* cfEucNorm)(number a, const coeffs r)
Definition: coeffs.h:258
number(* cfAnn)(number a, const coeffs r)
Definition: coeffs.h:261
char *(* cfCoeffString)(const coeffs r)
string output of coeff description
Definition: coeffs.h:151
number(* cfReadFd)(const ssiInfo *f, const coeffs r)
Definition: coeffs.h:278
void(* cfPower)(number a, int i, number *result, const coeffs r)
Definition: coeffs.h:239
CanonicalForm(* convSingNFactoryN)(number n, BOOLEAN setChar, const coeffs r)
Definition: coeffs.h:316
long(* cfInt)(number &n, const coeffs r)
convertion to long, 0 if impossible
Definition: coeffs.h:187
BOOLEAN(* cfGreater)(number a, number b, const coeffs r)
Definition: coeffs.h:225
number(* cfQuotRem)(number a, number b, number *rem, const coeffs r)
Definition: coeffs.h:269
void(* cfCoeffWrite)(const coeffs r, BOOLEAN details)
output of coeff description via Print
Definition: coeffs.h:148
void(* cfDelete)(number *a, const coeffs r)
Definition: coeffs.h:272
numberfunc cfSub
Definition: coeffs.h:175
BOOLEAN(* cfDBTest)(number a, const char *f, const int l, const coeffs r)
Test: is "a" a correct number?
Definition: coeffs.h:415
void(* cfWriteFd)(number a, const ssiInfo *f, const coeffs r)
Definition: coeffs.h:277
n_coeffType type
Definition: coeffs.h:128
numberfunc cfAdd
Definition: coeffs.h:175
number(* cfRandom)(siRandProc p, number p1, number p2, const coeffs cf)
a function returning random elements
Definition: coeffs.h:306
BOOLEAN(*)(*)(*)(*)(*) cfIsMOne(number a, const coeffs r)
Definition: coeffs.h:232
numberfunc cfDiv
Definition: coeffs.h:175
char const ** pParameterNames
array containing the names of Parameters (default NULL)
Definition: coeffs.h:322
char *(* cfCoeffName)(const coeffs r)
default name of cf, should substitue cfCoeffWrite, cfCoeffString
Definition: coeffs.h:154
int(* cfParDeg)(number x, const coeffs r)
degree for coeffcients: -1 for 0, 0 for "constants", ...
Definition: coeffs.h:300
void(* cfInpMult)(number &a, number b, const coeffs r)
Inplace: a *= b.
Definition: coeffs.h:281
int(* cfSize)(number n, const coeffs r)
how complicated, (0) => 0, or positive
Definition: coeffs.h:184
void(* cfInpAdd)(number &a, number b, const coeffs r)
Inplace: a += b.
Definition: coeffs.h:284
BOOLEAN(* cfDivBy)(number a, number b, const coeffs r)
Definition: coeffs.h:381
nCoeffsEnumeratorFunc cfClearContent
function pointer behind n_ClearContent
Definition: coeffs.h:309
nCoeffsEnumeratorFunc cfClearDenominators
function pointer behind n_ClearDenominators
Definition: coeffs.h:312
const char *(* cfRead)(const char *s, number *a, const coeffs r)
Definition: coeffs.h:221

◆ nKillChar()

void nKillChar ( coeffs  r)

undo all initialisations

Definition at line 547 of file numbers.cc.

549{
550 if (r!=NULL)
551 {
552 r->ref--;
553 if (r->ref<=0)
554 {
555 n_Procs_s tmp;
556 n_Procs_s* n=&tmp;
557 tmp.next=cf_root;
558 while((n->next!=NULL) && (n->next!=r)) n=n->next;
559 if (n->next==r)
560 {
561 n->next=n->next->next;
562 if (cf_root==r) cf_root=n->next;
563 assume (r->cfKillChar!=NULL); r->cfKillChar(r);
564 omFreeSize((void *)r, sizeof(n_Procs_s));
565 r=NULL;
566 }
567 else
568 {
569 WarnS("cf_root list destroyed");
570 }
571 }
572 }
#define WarnS
Definition: emacs.cc:78

◆ nNew()

void nNew ( number *  a)

Definition at line 47 of file numbers.cc.

47{ *d=NULL; }

◆ nSetChar()

static FORCE_INLINE void nSetChar ( const coeffs  r)
static

initialisations after each ring change

Definition at line 436 of file coeffs.h.

437{ assume(r!=NULL); assume(r->cfSetChar != NULL); r->cfSetChar(r); }

◆ number2mpz()

static FORCE_INLINE void number2mpz ( number  n,
coeffs  c,
mpz_t  m 
)
static

Definition at line 987 of file coeffs.h.

987{ n_MPZ(m, n, c); }
static FORCE_INLINE void n_MPZ(mpz_t result, number &n, const coeffs r)
conversion of n to a GMP integer; 0 if not possible
Definition: coeffs.h:551

Variable Documentation

◆ fftable

const unsigned short fftable[]
extern

Definition at line 31 of file ffields.cc.

◆ rnumber_bin

EXTERN_VAR omBin rnumber_bin

Definition at line 84 of file coeffs.h.