|
| coeffs | next |
| int | ref |
| n_coeffRep | rep |
| n_coeffType | type |
| int | factoryVarOffset |
| | how many variables of factory are already used by this coeff
|
| BOOLEAN | has_simple_Alloc |
| | TRUE, if nDelete/nCopy are dummies.
|
| BOOLEAN | has_simple_Inverse |
| | TRUE, if std should make polynomials monic (if nInvers is cheap) if false, then a gcd routine is used for a content computation.
|
| BOOLEAN | is_field |
| | TRUE, if cf is a field.
|
| BOOLEAN | is_domain |
| | TRUE, if cf is a domain.
|
| BOOLEAN(*) | nCoeffIsEqual (const coeffs r, n_coeffType n, void *parameter) |
| void(*) | cfCoeffWrite (const coeffs r, BOOLEAN details) |
| | output of coeff description via Print
|
| char *(*) | cfCoeffString (const coeffs r) |
| | string output of coeff description
|
| char *(*) | cfCoeffName (const coeffs r) |
| | default name of cf, should substitute cfCoeffWrite, cfCoeffString
|
| void(*) | cfKillChar (coeffs r) |
| void(*) | cfSetChar (const coeffs r) |
| numberfunc | cfMult |
| numberfunc | cfSub |
| numberfunc | cfAdd |
| numberfunc | cfDiv |
| numberfunc | cfIntMod |
| numberfunc | cfExactDiv |
| number(*) | cfInit (long i, const coeffs r) |
| | init with an integer
|
| number(*) | cfInitMPZ (mpz_t i, const coeffs r) |
| | init with a GMP integer
|
| int(*) | cfSize (number n, const coeffs r) |
| | how complicated, (0) => 0, or positive
|
| long(*) | cfInt (number &n, const coeffs r) |
| | conversion to long, 0 if impossible
|
| void(*) | cfMPZ (mpz_t result, number &n, const coeffs r) |
| | Converts a (integer) number n into a GMP number, 0 if impossible.
|
| 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 original argument: e.g. a = n_InpNeg(a,r)
|
| number(*) | cfInvers (number a, const coeffs r) |
| | return 1/a
|
| number(*) | cfCopy (number a, const coeffs r) |
| | return a copy of a
|
| number(*) | cfRePart (number a, const coeffs r) |
| number(*) | cfImPart (number a, const coeffs r) |
| void(*) | cfWriteLong (number a, const coeffs r) |
| | print a given number (long format)
|
| 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
|
| const char *(*) | cfRead (const char *s, number *a, const coeffs r) |
| void(*) | cfNormalize (number &a, const coeffs r) |
| BOOLEAN(*) | cfGreater (number a, number b, const coeffs r) |
| BOOLEAN(*) | cfEqual (number a, number b, const coeffs r) |
| | tests
|
| BOOLEAN(*) | cfIsZero (number a, const coeffs r) |
| BOOLEAN(*) | cfIsOne (number a, const coeffs r) |
| BOOLEAN(*) | cfIsMOne (number a, const coeffs r) |
| BOOLEAN(*) | cfGreaterZero (number a, const coeffs r) |
| void(*) | cfPower (number a, int i, number *result, const coeffs r) |
| number(*) | cfGetDenom (number &n, const coeffs r) |
| number(*) | cfGetNumerator (number &n, const coeffs r) |
| number(*) | cfGcd (number a, number b, const coeffs r) |
| number(*) | cfSubringGcd (number a, number b, const coeffs r) |
| number(*) | cfExtGcd (number a, number b, number *s, number *t, const coeffs r) |
| number(*) | cfXExtGcd (number a, number b, number *s, number *t, number *u, number *v, const coeffs r) |
| number(*) | cfEucNorm (number a, const coeffs r) |
| number(*) | cfAnn (number a, const coeffs r) |
| number(*) | cfQuotRem (number a, number b, number *rem, const coeffs r) |
| number(*) | cfLcm (number a, number b, const coeffs r) |
| number(*) | cfNormalizeHelper (number a, number b, const coeffs r) |
| void(*) | cfDelete (number *a, const coeffs r) |
| nMapFunc(*) | cfSetMap (const coeffs src, const coeffs dst) |
| void(*) | cfWriteFd (number a, const ssiInfo *f, const coeffs r) |
| number(*) | cfReadFd (const ssiInfo *f, const coeffs r) |
| void(*) | cfInpMult (number &a, number b, const coeffs r) |
| | Inplace: a *= b.
|
| void(*) | cfInpAdd (number &a, number b, const coeffs r) |
| | Inplace: a += b.
|
| number(*) | cfFarey (number p, number n, const coeffs) |
| | rational reconstruction: "best" rational a/b with a/b = p mod n
|
| 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
|
| int(*) | cfParDeg (number x, const coeffs r) |
| | degree for coefficients: -1 for 0, 0 for "constants", ...
|
| number(*) | cfParameter (const int i, const coeffs r) |
| | create i^th parameter or NULL if not possible
|
| number(*) | cfRandom (siRandProc p, number p1, number p2, const coeffs cf) |
| | a function returning random elements
|
| nCoeffsEnumeratorFunc | cfClearContent |
| | function pointer behind n_ClearContent
|
| nCoeffsEnumeratorFunc | cfClearDenominators |
| | function pointer behind n_ClearDenominators
|
| number(*) | convFactoryNSingN (const CanonicalForm n, const coeffs r) |
| | conversion to CanonicalForm(factory) to number
|
| CanonicalForm(*) | convSingNFactoryN (number n, BOOLEAN setChar, const coeffs r) |
| int | iNumberOfParameters |
| | Number of Parameters in the coeffs (default 0).
|
| char const ** | pParameterNames |
| | array containing the names of Parameters (default NULL)
|
| ring | extRing |
| int | ch |
| short | float_len |
| short | float_len2 |
| int | m_nfCharQ |
| | the number of elements: q
|
| int | m_nfM1 |
| | representation of -1
|
| int | m_nfCharP |
| | the characteristic: p
|
| int | m_nfCharQ1 |
| | q-1
|
| unsigned short * | m_nfPlus1Table |
| int * | m_nfMinPoly |
| unsigned short * | npInvTable |
| unsigned short * | npExpTable |
| unsigned short * | npLogTable |
| int | npPminus1M |
| | characteristic - 1
|
| int(*) | cfDivComp (number a, number b, const coeffs r) |
| BOOLEAN(*) | cfIsUnit (number a, const coeffs r) |
| number(*) | cfGetUnit (number a, const coeffs r) |
| BOOLEAN(*) | cfDivBy (number a, number b, const coeffs r) |
| | test if b divides a cfDivBy(zero,b,r) is true, if b is a zero divisor
|
| mpz_ptr | modBase |
| unsigned long | modExponent |
| mpz_ptr | modNumber |
| unsigned long | mod2mMask |
| coeffs(*) | cfQuot1 (number c, const coeffs r) |
| void * | data |
| number(*) | cfReadFd_S (char **s, const coeffs r) |
| void(*) | cfWriteFd_S (number a, const coeffs r) |
| BOOLEAN(*) | cfDBTest (number a, const char *f, const int l, const coeffs r) |
| | Test: is "a" a correct number?
|
Definition at line 129 of file coeffs.h.
