My Project
coeffrings.h
Go to the documentation of this file.
1#ifndef COEFFRINGS_H
2#define COEFFRINGS_H
3
4#include "misc/auxiliary.h"
5#include "coeffs/coeffs.h"
7
8static FORCE_INLINE number n_Copy(number n, const ring r){ return n_Copy(n, r->cf); }
9static FORCE_INLINE void n_Delete(number* p, const ring r){ n_Delete(p, r->cf); }
10static FORCE_INLINE BOOLEAN n_Equal(number a, number b, const ring r){ return n_Equal(a, b, r->cf); }
11static FORCE_INLINE nMapFunc n_SetMap(const ring src, const ring dst){ return n_SetMap(src->cf,dst->cf); }
12static FORCE_INLINE int n_GetChar(const ring r){ return n_GetChar(r->cf); }
13
14// static FORCE_INLINE BOOLEAN n_Test(number n, const char *filename, const int linenumber, const ring r){ return n_Test( n, r->cf); }
15// static FORCE_INLINE BOOLEAN n_Test(number a, const ring r){ return n_Test(a, r); }
16// #define n_Test(a,r)
17
18
19
20static FORCE_INLINE BOOLEAN n_IsZero(number n, const ring r){ return n_IsZero(n,r->cf); }
21static FORCE_INLINE BOOLEAN n_IsOne(number n, const ring r){ return n_IsOne(n,r->cf); }
22static FORCE_INLINE BOOLEAN n_IsMOne(number n, const ring r){ return n_IsMOne(n,r->cf); }
23static FORCE_INLINE BOOLEAN n_GreaterZero(number n, const ring r){ return n_GreaterZero(n,r->cf); }
24static FORCE_INLINE number n_Init(int i, const ring r){ return n_Init(i,r->cf); }
25static FORCE_INLINE number n_InpNeg(number n, const ring r){ return n_InpNeg(n,r->cf); }
26static FORCE_INLINE number n_Invers(number a, const ring r){ return n_Invers(a,r->cf); }
27static FORCE_INLINE int n_Size(number n, const ring r){ return n_Size(n,r->cf); }
28static FORCE_INLINE void n_Normalize(number& n, const ring r){ return n_Normalize(n,r->cf); }
29static FORCE_INLINE void n_Write(number& n, const ring r){ return n_Write(n, r->cf, rShortOut(r)); }
30static FORCE_INLINE number n_GetDenom(number& n, const ring r){ return n_GetDenom(n, r->cf);}
31static FORCE_INLINE number n_GetNumerator(number& n, const ring r){ return n_GetNumerator(n, r->cf);}
32static FORCE_INLINE void n_Power(number a, int b, number *res, const ring r){ n_Power(a,b,res,r->cf); }
33static FORCE_INLINE number n_Mult(number a, number b, const ring r){ return n_Mult(a, b, r->cf);}
34static FORCE_INLINE void n_InpMult(number &a, number b, const ring r){ n_InpMult(a,b,r->cf); }
35static FORCE_INLINE number n_Sub(number a, number b, const ring r){ return n_Sub(a, b, r->cf);}
36static FORCE_INLINE number n_Add(number a, number b, const ring r){ return n_Add(a, b, r->cf);}
37static FORCE_INLINE number n_Div(number a, number b, const ring r){ return n_Div(a,b, r->cf);}
38static FORCE_INLINE number n_ExactDiv(number a, number b, const ring r){ return n_ExactDiv(a,b, r->cf);}
39static FORCE_INLINE number n_Gcd(number a, number b, const ring r){ return n_Gcd(a,b, r->cf);}
40
41#ifdef HAVE_RINGS
42static FORCE_INLINE BOOLEAN n_IsUnit(number n, const ring r){ return n_IsUnit(n, r->cf);}
43static FORCE_INLINE number n_GetUnit(number n, const ring r){ return n_GetUnit(n, r->cf);}
44static FORCE_INLINE BOOLEAN n_DivBy(number a, number b, const ring r){ return n_DivBy(a,b, r->cf);}
45#endif
46
47static FORCE_INLINE int n_ParDeg(number n, const ring r){ assume(r != NULL); assume(r->cf != NULL); return n_ParDeg(n,r->cf); }
48
49#endif /* COEFFRINGS_H */
All the auxiliary stuff.
#define NULL
Definition: auxiliary.h:104
int BOOLEAN
Definition: auxiliary.h:87
#define FORCE_INLINE
Definition: auxiliary.h:329
int i
Definition: cfEzgcd.cc:132
int p
Definition: cfModGcd.cc:4080
CanonicalForm b
Definition: cfModGcd.cc:4105
static FORCE_INLINE number n_InpNeg(number n, const ring r)
Definition: coeffrings.h:25
static FORCE_INLINE BOOLEAN n_GreaterZero(number n, const ring r)
Definition: coeffrings.h:23
static FORCE_INLINE int n_Size(number n, const ring r)
Definition: coeffrings.h:27
static FORCE_INLINE number n_ExactDiv(number a, number b, const ring r)
Definition: coeffrings.h:38
static FORCE_INLINE number n_GetDenom(number &n, const ring r)
Definition: coeffrings.h:30
static FORCE_INLINE BOOLEAN n_DivBy(number a, number b, const ring r)
Definition: coeffrings.h:44
static FORCE_INLINE number n_Add(number a, number b, const ring r)
Definition: coeffrings.h:36
static FORCE_INLINE void n_Power(number a, int b, number *res, const ring r)
Definition: coeffrings.h:32
static FORCE_INLINE number n_Invers(number a, const ring r)
Definition: coeffrings.h:26
static FORCE_INLINE number n_Gcd(number a, number b, const ring r)
Definition: coeffrings.h:39
static FORCE_INLINE int n_ParDeg(number n, const ring r)
Definition: coeffrings.h:47
static FORCE_INLINE number n_GetUnit(number n, const ring r)
Definition: coeffrings.h:43
static FORCE_INLINE BOOLEAN n_IsMOne(number n, const ring r)
Definition: coeffrings.h:22
static FORCE_INLINE number n_Sub(number a, number b, const ring r)
Definition: coeffrings.h:35
static FORCE_INLINE BOOLEAN n_IsZero(number n, const ring r)
Definition: coeffrings.h:20
static FORCE_INLINE nMapFunc n_SetMap(const ring src, const ring dst)
Definition: coeffrings.h:11
static FORCE_INLINE number n_GetNumerator(number &n, const ring r)
Definition: coeffrings.h:31
static FORCE_INLINE BOOLEAN n_IsUnit(number n, const ring r)
Definition: coeffrings.h:42
static FORCE_INLINE number n_Mult(number a, number b, const ring r)
Definition: coeffrings.h:33
static FORCE_INLINE BOOLEAN n_IsOne(number n, const ring r)
Definition: coeffrings.h:21
static FORCE_INLINE void n_InpMult(number &a, number b, const ring r)
Definition: coeffrings.h:34
static FORCE_INLINE number n_Div(number a, number b, const ring r)
Definition: coeffrings.h:37
static FORCE_INLINE void n_Delete(number *p, const ring r)
Definition: coeffrings.h:9
static FORCE_INLINE number n_Copy(number n, const ring r)
Definition: coeffrings.h:8
static FORCE_INLINE BOOLEAN n_Equal(number a, number b, const ring r)
Definition: coeffrings.h:10
static FORCE_INLINE int n_GetChar(const ring r)
Definition: coeffrings.h:12
static FORCE_INLINE number n_Init(int i, const ring r)
Definition: coeffrings.h:24
static FORCE_INLINE void n_Write(number &n, const ring r)
Definition: coeffrings.h:29
static FORCE_INLINE void n_Normalize(number &n, const ring r)
Definition: coeffrings.h:28
Coefficient rings, fields and other domains suitable for Singular polynomials.
number(* nMapFunc)(number a, const coeffs src, const coeffs dst)
maps "a", which lives in src, into dst
Definition: coeffs.h:74
CanonicalForm res
Definition: facAbsFact.cc:60
#define assume(x)
Definition: mod2.h:387
static BOOLEAN rShortOut(const ring r)
Definition: ring.h:583