===================================================================
RCS file: /home/cvs/OpenXM/src/kan96xx/Kan/poly.c,v
retrieving revision 1.1.1.1
retrieving revision 1.4
diff -u -p -r1.1.1.1 -r1.4
--- OpenXM/src/kan96xx/Kan/poly.c	1999/10/08 02:12:01	1.1.1.1
+++ OpenXM/src/kan96xx/Kan/poly.c	2004/09/13 11:24:11	1.4
@@ -1,3 +1,4 @@
+/* $OpenXM: OpenXM/src/kan96xx/Kan/poly.c,v 1.3 2001/05/04 01:06:24 takayama Exp $ */
 #include <stdio.h>
 #include "datatype.h"
 #include "stackm.h"
@@ -25,7 +26,7 @@ void KinitKan(void) {
   int i;
   static char *smallx[] = {"x","t"};
   static char *smalld[] = {"h","T"};
-                           /* t  x  T  h */ 
+  /* t  x  T  h */ 
   static int smallOrder[] = { 1, 0, 0, 0,
                               0, 1, 0, 0,
                               0, 0, 1, 0,
@@ -53,6 +54,7 @@ void KinitKan(void) {
   SmallRing.gbListTower = NULL;
   SmallRing.outputOrder = outputOrderForSmallRing;
   SmallRing.name = "SmallRingp";
+  SmallRing.partialEcart = 0;
 
   CurrentRingp = &SmallRing;
   initSyzRingp();
@@ -63,7 +65,7 @@ void KinitKan(void) {
 
 #ifndef NOGC
   /* initialize MPZ */
-   mp_set_memory_functions(sGC_malloc,sGC_realloc2,sGC_free2);
+  mp_set_memory_functions(sGC_malloc,sGC_realloc2,sGC_free2);
 #endif
 
   /* Msize is 8 on SUN gcc */
@@ -96,7 +98,7 @@ void sGC_free2(void *p,size_t size)
 
 
 MONOMIAL newMonomial(ringp)
-struct ring *ringp;
+     struct ring *ringp;
 {
   MONOMIAL f;
   extern int Msize;
@@ -115,7 +117,7 @@ struct ring *ringp;
  
 
 MONOMIAL monomialCopy(m)
-MONOMIAL m;
+     MONOMIAL m;
 {
   extern int Msize;
   MONOMIAL f;
@@ -152,8 +154,8 @@ MP_INT *newMP_INT() {
 }
 
 POLY newCell(c,mon)
-struct coeff *c;
-MONOMIAL mon;
+     struct coeff *c;
+     MONOMIAL mon;
 {
   POLY ff;
   ff = (POLY) sGC_malloc(sizeof(struct listPoly));
@@ -166,10 +168,10 @@ MONOMIAL mon;
 
 /* constructors */
 POLY cxx(c,i,k,ringp)
-int c,i,k;
-struct ring *ringp;
-/*  c x_i^k where p is the characteristic. */
-/* New cell, monomial and coeff. */
+     int c,i,k;
+     struct ring *ringp;
+     /*  c x_i^k where p is the characteristic. */
+     /* New cell, monomial and coeff. */
 {
   POLY f;
   int p;
@@ -198,12 +200,12 @@ struct ring *ringp;
 }
 
 POLY bxx(c,i,k,ringp)
-MP_INT *c;     
-int i,k;
-struct ring *ringp;
-/*  c x_i^k.  c is not copied. */
+     MP_INT *c;     
+     int i,k;
+     struct ring *ringp;
+     /*  c x_i^k.  c is not copied. */
 {
-/* new cell, monomial, coeff. MP_INT c is not copied. */
+  /* new cell, monomial, coeff. MP_INT c is not copied. */
   POLY f;
   int p;
   p = ringp->p;
@@ -228,10 +230,10 @@ struct ring *ringp;
 }
 
 POLY cdd(c,i,k,ringp)
-int c,i,k;
-struct ring *ringp;
-/*  c D_i^k where p is the characteristic. */
-/* New cell, monomial and coeff. */
+     int c,i,k;
+     struct ring *ringp;
+     /*  c D_i^k where p is the characteristic. */
+     /* New cell, monomial and coeff. */
 {
   POLY f;
   int p;
@@ -262,7 +264,7 @@ struct ring *ringp;
 
 
 POLY pCopy(f)
-POLY f;
+     POLY f;
 {
   POLY node;
   struct listPoly nod;
@@ -280,7 +282,7 @@ POLY f;
 }
 
 POLY pcCopy(f)
-POLY f;
+     POLY f;
 {
   
   POLY node;
@@ -301,7 +303,7 @@ POLY f;
 }
 
 POLY pmCopy(f)
-POLY f;
+     POLY f;
 {
   POLY node;
   struct listPoly nod;
@@ -320,7 +322,7 @@ POLY f;
 }
 
 POLY pcmCopy(f)
-POLY f;
+     POLY f;
 {
   POLY node;
   struct listPoly nod;
@@ -339,7 +341,7 @@ POLY f;
 }
 
 POLY head(f)
-POLY f;
+     POLY f;
 {
   if (f == ZERO) return(f);
   else {
@@ -348,14 +350,14 @@ POLY f;
 }
 
 void errorPoly(str)
-char *str;
+     char *str;
 {
   fprintf(stderr,"Error(poly.c): %s\n",str);
   exit(20);
 }
 
 void warningPoly(str)
-char *str;
+     char *str;
 {
   fprintf(stderr,"Warning(poly.c): %s\n",str);
 }