[35aab3] | 1 | #ifndef FFIELDS_H |
---|
| 2 | #define FFIELDS_H |
---|
| 3 | /**************************************** |
---|
| 4 | * Computer Algebra System SINGULAR * |
---|
| 5 | ****************************************/ |
---|
[85e68dd] | 6 | /* $Id: ffields.h,v 1.2 2008-03-19 17:44:08 Singular Exp $ */ |
---|
[35aab3] | 7 | /* |
---|
| 8 | * ABSTRACT: finite fields with a none-prime number of elements (via tables) |
---|
| 9 | */ |
---|
| 10 | #include "structs.h" |
---|
| 11 | |
---|
| 12 | |
---|
| 13 | BOOLEAN nfGreaterZero (number k); |
---|
| 14 | number nfMult (number a, number b); |
---|
| 15 | number nfInit (int i); |
---|
| 16 | number nfPar (int i); |
---|
| 17 | int nfParDeg (number n); |
---|
| 18 | int nfInt (number &n); |
---|
| 19 | number nfAdd (number a, number b); |
---|
| 20 | number nfSub (number a, number b); |
---|
| 21 | void nfPower (number a, int i, number * result); |
---|
| 22 | BOOLEAN nfIsZero (number a); |
---|
| 23 | BOOLEAN nfIsOne (number a); |
---|
| 24 | BOOLEAN nfIsMOne (number a); |
---|
| 25 | number nfDiv (number a, number b); |
---|
| 26 | number nfNeg (number c); |
---|
| 27 | number nfInvers (number c); |
---|
| 28 | BOOLEAN nfGreater (number a, number b); |
---|
| 29 | BOOLEAN nfEqual (number a, number b); |
---|
| 30 | void nfWrite (number &a); |
---|
[85e68dd] | 31 | const char * nfRead (const char *s, number *a); |
---|
[35aab3] | 32 | #ifdef LDEBUG |
---|
[85e68dd] | 33 | BOOLEAN nfDBTest (number a, const char *f, const int l); |
---|
[35aab3] | 34 | #endif |
---|
| 35 | void nfSetChar (int c, char ** param); |
---|
| 36 | |
---|
| 37 | nMapFunc nfSetMap (ring src, ring dst); |
---|
| 38 | char * nfName (number n); |
---|
| 39 | extern int nfMinPoly[]; |
---|
| 40 | void nfShowMipo(); |
---|
| 41 | #endif |
---|
| 42 | |
---|