[493c477] | 1 | /* emacs edit mode for this file is -*- C++ -*- */ |
---|
[341696] | 2 | /* $Id$ */ |
---|
[2dd068] | 3 | |
---|
[e4fe2b] | 4 | #include "config.h" |
---|
[cc1367] | 5 | |
---|
[650f2d8] | 6 | #include "cf_assert.h" |
---|
[cc1367] | 7 | |
---|
[2dd068] | 8 | #include "cf_defs.h" |
---|
| 9 | #include "canonicalform.h" |
---|
| 10 | #include "cf_binom.h" |
---|
| 11 | |
---|
| 12 | #define MAXPT 40 |
---|
| 13 | |
---|
| 14 | #define INITPT 10 |
---|
| 15 | |
---|
| 16 | CFArray * ptZ = 0; |
---|
| 17 | CFArray * ptF = 0; |
---|
| 18 | |
---|
| 19 | int charac = 0; |
---|
| 20 | int gfdeg = 0; |
---|
| 21 | int ptZmax = INITPT; |
---|
| 22 | int ptFmax = 0; |
---|
| 23 | |
---|
[318de0] | 24 | void |
---|
| 25 | resetFPT() |
---|
| 26 | { |
---|
| 27 | ptFmax = 0; |
---|
| 28 | } |
---|
| 29 | |
---|
[2dd068] | 30 | void |
---|
| 31 | initPT ( ) |
---|
| 32 | { |
---|
| 33 | static bool initialized = false; |
---|
| 34 | |
---|
| 35 | if ( ! initialized ) { |
---|
[806c18] | 36 | initialized = true; |
---|
| 37 | ptZ = new CFArray[MAXPT+1]; |
---|
| 38 | ptF = new CFArray[MAXPT+1]; |
---|
| 39 | int i, j; |
---|
| 40 | ptZ[0] = CFArray(1); ptZ[0][0] = 1; |
---|
| 41 | ptF[0] = CFArray(1); |
---|
| 42 | for ( i = 1; i <= INITPT; i++ ) { |
---|
| 43 | ptF[i] = CFArray(i+1); |
---|
| 44 | ptZ[i] = CFArray(i+1); |
---|
| 45 | (ptZ[i])[0] = 1; |
---|
| 46 | for ( j = 1; j < i; j++ ) |
---|
| 47 | (ptZ[i])[j] = (ptZ[i-1])[j-1] + (ptZ[i-1])[j]; |
---|
| 48 | (ptZ[i])[i] = 1; |
---|
| 49 | } |
---|
| 50 | for ( i = INITPT+1; i <= MAXPT; i++ ) { |
---|
| 51 | ptF[i] = CFArray(i+1); |
---|
| 52 | ptZ[i] = CFArray(i+1); |
---|
| 53 | } |
---|
| 54 | ptZmax = INITPT; |
---|
| 55 | ptFmax = 0; |
---|
[2dd068] | 56 | } |
---|
| 57 | } |
---|
| 58 | |
---|
| 59 | CanonicalForm |
---|
| 60 | binomialpower ( const Variable & x, const CanonicalForm & a, int n ) |
---|
| 61 | { |
---|
| 62 | if ( n == 0 ) |
---|
[806c18] | 63 | return 1; |
---|
[2dd068] | 64 | else if ( n == 1 ) |
---|
[806c18] | 65 | return x + a; |
---|
[2dd068] | 66 | else if ( getCharacteristic() == 0 ) { |
---|
[806c18] | 67 | if ( n <= MAXPT ) { |
---|
| 68 | if ( n > ptZmax ) { |
---|
| 69 | int i, j; |
---|
| 70 | for ( i = ptZmax+1; i <= n; i++ ) { |
---|
| 71 | (ptZ[i])[0] = 1; |
---|
| 72 | for ( j = 1; j < i; j++ ) |
---|
| 73 | (ptZ[i])[j] = (ptZ[i-1])[j-1] + (ptZ[i-1])[j]; |
---|
| 74 | (ptZ[i])[i] = 1; |
---|
| 75 | } |
---|
| 76 | ptZmax = n; |
---|
| 77 | } |
---|
| 78 | CanonicalForm result = 0, apower = 1; |
---|
| 79 | int k; |
---|
| 80 | for ( k = n; k >= 0; k-- ) { |
---|
| 81 | result += power( x, k ) * apower * (ptZ[n])[k]; |
---|
| 82 | if ( k != 0 ) |
---|
| 83 | apower *= a; |
---|
| 84 | } |
---|
| 85 | return result; |
---|
| 86 | } |
---|
| 87 | else { |
---|
| 88 | CanonicalForm result = binomialpower( x, a, MAXPT ); |
---|
| 89 | CanonicalForm xa = x + a; |
---|
| 90 | int i; |
---|
| 91 | for ( i = MAXPT; i < n; i++ ) |
---|
| 92 | result *= xa; |
---|
| 93 | return result; |
---|
| 94 | } |
---|
[2dd068] | 95 | } |
---|
| 96 | else { |
---|
[806c18] | 97 | if ( getCharacteristic() != charac || gfdeg != getGFDegree() ) { |
---|
| 98 | ptFmax = 0; |
---|
| 99 | charac = getCharacteristic(); |
---|
| 100 | gfdeg = getGFDegree(); |
---|
| 101 | (ptF[0])[0] = 1; |
---|
| 102 | } |
---|
| 103 | if ( n <= MAXPT ) { |
---|
| 104 | if ( n > ptFmax ) { |
---|
| 105 | int i, j; |
---|
| 106 | for ( i = ptFmax+1; i <= n; i++ ) { |
---|
| 107 | (ptF[i])[0] = 1; |
---|
| 108 | for ( j = 1; j < i; j++ ) |
---|
| 109 | (ptF[i])[j] = (ptF[i-1])[j-1] + (ptF[i-1])[j]; |
---|
| 110 | (ptF[i])[i] = 1; |
---|
| 111 | } |
---|
| 112 | ptFmax = n; |
---|
| 113 | } |
---|
| 114 | CanonicalForm result = 0, apower = 1; |
---|
| 115 | int k; |
---|
| 116 | for ( k = n; k >= 0; k-- ) { |
---|
| 117 | result += power( x, k ) * apower * (ptF[n])[k]; |
---|
| 118 | if ( k != 0 ) |
---|
| 119 | apower *= a; |
---|
| 120 | } |
---|
| 121 | return result; |
---|
| 122 | } |
---|
| 123 | else { |
---|
| 124 | CanonicalForm result = binomialpower( x, a, MAXPT ); |
---|
| 125 | CanonicalForm xa = x + a; |
---|
| 126 | int i; |
---|
| 127 | for ( i = MAXPT; i < n; i++ ) |
---|
| 128 | result *= xa; |
---|
| 129 | return result; |
---|
| 130 | } |
---|
[2dd068] | 131 | } |
---|
| 132 | } |
---|