 |
My Project
debian-1:4.1.1-p2+ds-4build1
|
Go to the documentation of this file.
14 #include "factory/factory.h"
35 #ifdef HAVE_POLYEXTENSIONS
42 struct SNumberStatistic number_stats;
57 char *
s=(
char *)
omAlloc(11);snprintf(
s,11,
"Coeffs(%d)",r->type);
63 snprintf(
s,11,
"Coeffs(%d)",r->type);
68 number n=r->cfMult(a,
b,r);
74 number n=r->cfAdd(a,
b,r);
83 *
res = r->cfInit(1, r);
87 *
res = r->cfCopy(a, r);
91 *
res = r->cfMult(a, a, r);
95 number
b = r->cfInvers(a, r);
102 r->cfInpMult(*
res, *
res, r);
105 r->cfInpMult(*
res, a, r);
111 number one=r->cfInit(1,r);
112 number
res=r->cfDiv(one,a,r);
130 Werror(
"ChineseRemainder not implemented for %s (c=%d)",r->cfCoeffString(r),
getCoeffType(r));
131 return r->cfInit(0,r);
136 return (-r->cfIsZero(n,r));
141 Werror(
"ndParameter: n_Parameter is not implemented/relevant for (coeff_type = %d)",
getCoeffType(r));
149 if (ret || (c==0) || (r->is_field))
151 number ch =
n_Init( c, r );
152 number
g =
n_Gcd( ch, a, r );
161 number
ndGcd(number, number,
const coeffs r) {
return r->cfInit(1,r); }
162 static number
ndIntMod(number, number,
const coeffs r) {
return r->cfInit(0,r); }
175 numberCollectionEnumerator.
Reset();
177 if( !numberCollectionEnumerator.
MoveNext() )
183 number &curr = numberCollectionEnumerator.
Current();
199 while( numberCollectionEnumerator.
MoveNext() )
201 number &n = numberCollectionEnumerator.
Current();
227 while( numberCollectionEnumerator.
MoveNext() )
229 number &n = numberCollectionEnumerator.
Current();
254 assume(aRing->rep==r->rep);
258 return r->cfCopy(a, r);
269 static number
ndExtGcd (number, number, number *, number *,
const coeffs r) {
return r->cfInit(1,r); }
275 WerrorS(
"no conversion to factory");
281 WerrorS(
"no conversion from factory");
290 mpz_init_set_si(
result, r->cfInt(n, r) );
295 return r->cfInit( mpz_get_si(
m), r);
321 #ifdef HAVE_POLYEXTENSIONS
421 Werror(
"Sorry: the coeff type [%d] was not registered: it is missing in nInitCharTable", (
int)t);
527 assume (r->cfKillChar!=
NULL); r->cfKillChar(r);
533 WarnS(
"cf_root list destroyed");
575 && (strcmp(cf_name,n->
cfCoeffName(n))==0))
return n;
static FORCE_INLINE n_coeffType getCoeffType(const coeffs r)
Returns the type of coeffs domain.
void(* cfInpMult)(number &a, number b, const coeffs r)
Inplace: a *= b.
CanonicalForm(* convSingNFactoryN)(number n, BOOLEAN setChar, const coeffs r)
int(* cfSize)(number n, const coeffs r)
how complicated, (0) => 0, or positive
static void ndClearContent(ICoeffsEnumerator &numberCollectionEnumerator, number &c, const coeffs r)
number(* cfGcd)(number a, number b, const coeffs r)
int(* cfDivComp)(number a, number b, const coeffs r)
static FORCE_INLINE BOOLEAN nCoeff_is_numeric(const coeffs r)
static void ndClearDenominators(ICoeffsEnumerator &, number &d, const coeffs r)
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...
static BOOLEAN ndDivBy(number, number, const coeffs)
static number ndConvFactoryNSingN(const CanonicalForm, const coeffs)
[in, out] a bigint number >= 0
static FORCE_INLINE BOOLEAN nCoeff_is_Zp(const coeffs r)
number(* cfGetDenom)(number &n, const coeffs r)
int iNumberOfParameters
Number of Parameters in the coeffs (default 0)
virtual reference Current()=0
Gets the current element in the collection (read and write).
static void ndSetChar(const coeffs)
int(* cfParDeg)(number x, const coeffs r)
degree for coeffcients: -1 for 0, 0 for "constants", ...
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
static BOOLEAN ndCoeffIsEqual(const coeffs r, n_coeffType n, void *)
char *(* cfCoeffName)(const coeffs r)
default name of cf, should substitue cfCoeffWrite, cfCoeffString
void n_Print(number &a, const coeffs r)
print a number (BEWARE of string buffers!) mostly for debugging
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 int n_GetChar(const coeffs r)
Return the characteristic of the coeff. domain.
static number ndReturn0(number, const coeffs r)
BOOLEAN naInitChar(coeffs cf, void *infoStruct)
Initialize the coeffs object.
static BOOLEAN ndIsUnit(number a, const coeffs r)
static char * ndCoeffString(const coeffs r)
coeffs nFindCoeffByName(const char *cf_name)
find an existing coeff by its "CoeffName"
void(* cfCoeffWrite)(const coeffs r, BOOLEAN details)
output of coeff description via Print
static int ndParDeg(number n, const coeffs r)
static number ndParameter(const int, const coeffs r)
static number ndIntMod(number, number, const coeffs r)
number(* cfRePart)(number a, const coeffs r)
BOOLEAN(* cfDBTest)(number a, const char *f, const int l, const coeffs r)
Test: is "a" a correct number?
number ndCopyMap(number a, const coeffs aRing, const coeffs r)
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
static number ndQuotRem(number a, number b, number *r, const coeffs R)
static FORCE_INLINE BOOLEAN n_IsZero(number n, const coeffs r)
TRUE iff 'n' represents the zero element.
static FORCE_INLINE BOOLEAN nCoeff_is_GF(const coeffs r)
static FORCE_INLINE BOOLEAN n_IsOne(number n, const coeffs r)
TRUE iff 'n' represents the one element.
coeffs nInitChar(n_coeffType t, void *parameter)
one-time initialisations for new coeffs in case of an error return NULL
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 i...
BOOLEAN(* cfGreater)(number a, number b, const coeffs r)
static FORCE_INLINE void n_Normalize(number &n, const coeffs r)
inplace-normalization of n; produces some canonical representation of n;
BOOLEAN ngcInitChar(coeffs n, void *parameter)
Initialize r (n_long_C)
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 implementatio...
BOOLEAN npInitChar(coeffs r, void *p)
number(* cfInit)(long i, const coeffs r)
init with an integer
static number ndGetDenom(number &, const coeffs r)
virtual void Reset()=0
Sets the enumerator to its initial position: -1, which is before the first element in the collection.
void(* cfDelete)(number *a, const coeffs r)
static FORCE_INLINE BOOLEAN nCoeff_is_Q(const coeffs r)
static void ndInpMult(number &a, number b, const coeffs r)
CanonicalForm n_convSingNFactoryN(number n, BOOLEAN setChar, const coeffs r)
static int ndDivComp(number, number, const coeffs)
void(* cfPower)(number a, int i, number *result, const coeffs r)
n_coeffType nRegister(n_coeffType n, cfInitCharProc p)
const char *(* cfRead)(const char *s, number *a, const coeffs r)
cfInitCharProc nInitCharTableDefault[]
static number ndInitMPZ(mpz_t m, const coeffs r)
long(* cfInt)(number &n, const coeffs r)
convertion to long, 0 if impossible
static FORCE_INLINE void n_Write(number n, const coeffs r, const BOOLEAN bShortOut=TRUE)
number(* cfGetUnit)(number a, const coeffs r)
void(* cfMPZ)(mpz_t result, number &n, const coeffs r)
Converts a non-negative number n into a GMP number, 0 if impossible.
#define omFreeSize(addr, size)
static FORCE_INLINE BOOLEAN nCoeff_is_algExt(const coeffs r)
TRUE iff r represents an algebraic extension field.
number(* cfGetNumerator)(number &n, const coeffs r)
BOOLEAN(*)(*)(*) cfIsZero(number a, const coeffs r)
nCoeffsEnumeratorFunc cfClearDenominators
function pointer behind n_ClearDenominators
static FORCE_INLINE BOOLEAN nCoeff_is_Ring(const coeffs r)
static char * ndCoeffName(const coeffs r)
void(* cfInpAdd)(number &a, number b, const coeffs r)
Inplace: a += b.
number(* cfInvers)(number a, const coeffs r)
return 1/a
number(* cfInitMPZ)(mpz_t i, const coeffs r)
init with a GMP integer
void(* cfWriteLong)(number a, const coeffs r)
print a given number (long format)
BOOLEAN(* cfInitCharProc)(coeffs, void *)
initialize an object of type coeff, return FALSE in case of success
number ndGcd(number, number, const coeffs r)
static FORCE_INLINE BOOLEAN nCoeff_has_simple_Alloc(const coeffs r)
TRUE if n_Delete/n_New are empty operations.
static number ndAnn(number, const coeffs)
BOOLEAN(*)(*)(*)(*)(*)(*) cfGreaterZero(number a, const coeffs r)
number(* cfSubringGcd)(number a, number b, const coeffs r)
BOOLEAN nrnInitChar(coeffs r, void *p)
nMapFunc(* cfSetMap)(const coeffs src, const coeffs dst)
BOOLEAN nnInitChar(coeffs n, void *p)
Initialize r.
number(* cfCopy)(number a, const coeffs r)
return a copy of a
number(* cfImPart)(number a, const coeffs r)
static FORCE_INLINE number n_Init(long i, const coeffs r)
a number representing i in the given coeff field/ring r
static void ndKillChar(coeffs)
const char ** pParameterNames
array containing the names of Parameters (default NULL)
char *(* cfCoeffString)(const coeffs r)
string output of coeff description
static FORCE_INLINE BOOLEAN nCoeff_is_transExt(const coeffs r)
TRUE iff r represents a transcendental extension field.
number(* cfQuotRem)(number a, number b, number *rem, const coeffs r)
void(* cfSetChar)(const coeffs r)
BOOLEAN ntInitChar(coeffs cf, void *infoStruct)
Initialize the coeffs object.
static number ndCopy(number a, const coeffs)
static void ndDelete(number *d, const coeffs)
static FORCE_INLINE BOOLEAN nCoeff_has_Units(const coeffs r)
returns TRUE, if r is not a field and r has non-trivial units
number n_convFactoryNSingN(const CanonicalForm n, const coeffs r)
nCoeffsEnumeratorFunc cfClearContent
function pointer behind n_ClearContent
BOOLEAN(*)(*) cfEqual(number a, number b, const coeffs r)
tests
BOOLEAN nrInitChar(coeffs n, void *p)
Initialize r.
static number ndInvers(number a, const coeffs r)
number(* cfNormalizeHelper)(number a, number b, const coeffs r)
virtual bool MoveNext()=0
Advances the enumerator to the next element of the collection. returns true if the enumerator was suc...
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
void StringSetS(const char *st)
static void ndNormalize(number &, const coeffs)
BOOLEAN(*)(*)(*)(*) cfIsOne(number a, const coeffs r)
number(* cfAnn)(number a, const coeffs r)
void Werror(const char *fmt,...)
void(* cfNormalize)(number &a, const coeffs r)
number(* cfExtGcd)(number a, number b, number *s, number *t, const coeffs r)
static int ndSize(number a, const coeffs r)
static FORCE_INLINE number n_Copy(number n, const coeffs r)
return a copy of 'n'
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,...
void WerrorS(const char *s)
BOOLEAN(* cfIsUnit)(number a, const coeffs r)
number(* cfParameter)(const int i, const coeffs r)
create i^th parameter or NULL if not possible
BOOLEAN nfInitChar(coeffs r, void *parameter)
void nKillChar(coeffs r)
undo all initialisations
static void ndPower(number a, int i, number *res, const coeffs r)
number(* cfFarey)(number p, number n, const coeffs)
rational reconstruction: "best" rational a/b with a/b = p mod n
static void ndInpAdd(number &a, number b, const coeffs r)
static FORCE_INLINE BOOLEAN nCoeff_is_Q_algext(const coeffs r)
is it an alg. ext. of Q?
number nd_Copy(number a, const coeffs r)
number(* cfLcm)(number a, number b, const coeffs r)
void(* cfKillChar)(coeffs r)
number(* convFactoryNSingN)(const CanonicalForm n, const coeffs r)
conversion to CanonicalForm(factory) to number
const CanonicalForm int s
CanonicalForm ndConvSingNFactoryN(number, BOOLEAN, const coeffs)
static cfInitCharProc * nInitCharTable
static number ndExtGcd(number, number, number *, number *, const coeffs r)
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 exceptio...
static number ndFarey(number, number, const coeffs r)
static number ndChineseRemainder(number *, number *, int, BOOLEAN, CFArray &, const coeffs r)
BOOLEAN(* cfDivBy)(number a, number b, const coeffs r)
#define n_Test(a, r)
BOOLEAN n_Test(number a, const coeffs r)
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
BOOLEAN nlInitChar(coeffs r, void *p)
BOOLEAN nr2mInitChar(coeffs r, void *p)
BOOLEAN(* nCoeffIsEqual)(const coeffs r, n_coeffType n, void *parameter)
BOOLEAN n2pInitChar(coeffs cf, void *infoStruct)
static number ndGetNumerator(number &a, const coeffs r)
static BOOLEAN ndDBTest(number, const char *, const int, const coeffs)
BOOLEAN nrzInitChar(coeffs r, void *)
static n_coeffType nLastCoeffs
BOOLEAN(*)(*)(*)(*)(*) cfIsMOne(number a, const coeffs r)
BOOLEAN ngfInitChar(coeffs n, void *parameter)
Initialize r.
static FORCE_INLINE BOOLEAN nCoeff_is_Zp_a(const coeffs r)
static void ndMPZ(mpz_t result, number &n, const coeffs r)
Converts a non-negative bigint number into a GMP number.
#define omReallocSize(addr, o_size, size)