[BACK]Return to sugar.c CVS log [TXT][DIR] Up to [local] / OpenXM / src / kan96xx / Kan

Diff for /OpenXM/src/kan96xx/Kan/sugar.c between version 1.3 and 1.7

version 1.3, 2001/05/04 01:06:25 version 1.7, 2003/09/20 09:57:29
Line 1 
Line 1 
 /* $OpenXM: OpenXM/src/kan96xx/Kan/sugar.c,v 1.2 2000/01/16 07:55:41 takayama Exp $ */  /* $OpenXM: OpenXM/src/kan96xx/Kan/sugar.c,v 1.6 2003/09/12 02:52:50 takayama Exp $ */
 #include <stdio.h>  #include <stdio.h>
 #include "datatype.h"  #include "datatype.h"
 #include "extern2.h"  #include "extern2.h"
Line 6 
Line 6 
   
 #define mymax(p,q) (p>q?p:q)  #define mymax(p,q) (p>q?p:q)
   
 static int DebugReduction = 0;  /* static int DebugReduction = 0;
   */
   extern DebugReductionRed;
   extern DebugContentReduction;
   extern Ecart;
   extern int Ecart_sugarGrade;
   static int ecart_grade_sugar(POLY f);
   
 POLY reduction_sugar(POLY f,struct gradedPolySet *gset,int needSyz,  POLY reduction_sugar(POLY f,struct gradedPolySet *gset,int needSyz,
                      struct syz0 *syzp,int sugarGrade)                       struct syz0 *syzp,int sugarGrade)
Line 22  POLY reduction_sugar(POLY f,struct gradedPolySet *gset
Line 28  POLY reduction_sugar(POLY f,struct gradedPolySet *gset
   
   extern struct ring *CurrentRingp;    extern struct ring *CurrentRingp;
   struct ring *rp;    struct ring *rp;
     extern DoCancel;
   
     if (Ecart) {
           Ecart_sugarGrade = sugarGrade;
           return reduction_ecart(f,gset,needSyz,syzp);
     }
   if (needSyz) {    if (needSyz) {
     if (f ISZERO) { rp = CurrentRingp; } else { rp = f->m->ringp; }      if (f ISZERO) { rp = CurrentRingp; } else { rp = f->m->ringp; }
     cf = cxx(1,0,0,rp);      cf = cxx(1,0,0,rp);
     syz = ZERO;      syz = ZERO;
   }    }
   
     if (needSyz && DoCancel) {
           warningGradedSet("needSyz is not supported when DoCancel is turned on. DoCancel is set to 0.\n");
           DoCancel = 0;
     }
     if (DoCancel && (f != POLYNULL)) shouldReduceContent(f,1);
   
   reduced = 0; /* no */    reduced = 0; /* no */
   /* Take minimum */    /* Take minimum */
   gradelimit = (gset->maxGrade < sugarGrade+1 ?gset->maxGrade: sugarGrade+1);    gradelimit = (gset->maxGrade < sugarGrade+1 ?gset->maxGrade: sugarGrade+1);
Line 46  POLY reduction_sugar(POLY f,struct gradedPolySet *gset
Line 63  POLY reduction_sugar(POLY f,struct gradedPolySet *gset
             /* Reduce if and only if sugarGrade does not increase. */              /* Reduce if and only if sugarGrade does not increase. */
             if (tdegm+grd <= sugarGrade) {              if (tdegm+grd <= sugarGrade) {
               f = reduction1_sugar(f,set->g[i],needSyz,&cc,&cg,sugarGrade);                f = reduction1_sugar(f,set->g[i],needSyz,&cc,&cg,sugarGrade);
   
                 if (DoCancel && (f != POLYNULL)) {
                   if (shouldReduceContent(f,0)) {
                     struct coeff *cont;
                     f = reduceContentOfPoly(f,&cont);
                     shouldReduceContent(f,1);
                     if (DebugContentReduction) printf("CONT=%s ",coeffToString(cont));
                   }
                 }
   
               if (needSyz) {                if (needSyz) {
                 cf = ppMult(cc,cf);                  cf = ppMult(cc,cf);
                 syz = cpMult(toSyzCoeff(cc),syz);                  syz = cpMult(toSyzCoeff(cc),syz);
Line 65  POLY reduction_sugar(POLY f,struct gradedPolySet *gset
Line 92  POLY reduction_sugar(POLY f,struct gradedPolySet *gset
     syzp->cf = cf;   /* cf is in the CurrentRingp */      syzp->cf = cf;   /* cf is in the CurrentRingp */
     syzp->syz = syz; /* syz is in the SyzRingp */      syzp->syz = syz; /* syz is in the SyzRingp */
   }    }
   
     if (DoCancel && (f != POLYNULL)) {
       if (f->m->ringp->p == 0) {
             struct coeff *cont;
             f = reduceContentOfPoly(f,&cont);
             if (DebugContentReduction) printf("cont=%s ",coeffToString(cont));
       }
     }
   
   return(f);    return(f);
 }  }
   
Line 92  POLY reduction1_sugar(f,g,needSyz,c,h,sugarGrade)
Line 128  POLY reduction1_sugar(f,g,needSyz,c,h,sugarGrade)
   
   sv = (*sp)(f,g);    sv = (*sp)(f,g);
   f2 = ppAddv(cpMult((sv.a)->coeffp,f),ppMult(sv.b,g));    f2 = ppAddv(cpMult((sv.a)->coeffp,f),ppMult(sv.b,g));
   if (DebugReduction) {    if (DebugReductionRed) {
     printf("c=%s, d=%s, g=%s:  f --> c*f + d*g.\n",      printf("c=%s, d=%s, g=%s:  f --> c*f + d*g.\n",
            POLYToString(sv.a,'*',1),POLYToString(sv.b,'*',1),POLYToString(g,'*',1));             POLYToString(sv.a,'*',1),POLYToString(sv.b,'*',1),POLYToString(g,'*',1));
     printf("%s --> %s\n",POLYToString(f,'*',1),POLYToString(f2,'*',1));      printf("%s --> %s\n",POLYToString(f,'*',1),POLYToString(f2,'*',1));
Line 110  POLY reduction1_sugar(f,g,needSyz,c,h,sugarGrade)
Line 146  POLY reduction1_sugar(f,g,needSyz,c,h,sugarGrade)
     if (tdegm+grd <= sugarGrade) {      if (tdegm+grd <= sugarGrade) {
       sv = (*sp)(f,g);        sv = (*sp)(f,g);
       f2 = ppAddv(cpMult((sv.a)->coeffp,f),ppMult(sv.b,g));        f2 = ppAddv(cpMult((sv.a)->coeffp,f),ppMult(sv.b,g));
       if (DebugReduction) {        if (DebugReductionRed) {
         printf("! c=%s, d=%s, g=%s:  f --> c*f + d*g.\n",          printf("! c=%s, d=%s, g=%s:  f --> c*f + d*g.\n",
                POLYToString(sv.a,'*',1),POLYToString(sv.b,'*',1),POLYToString(g,'*',1));                 POLYToString(sv.a,'*',1),POLYToString(sv.b,'*',1),POLYToString(g,'*',1));
         printf("%s --> %s\n",POLYToString(f,'*',1),POLYToString(f2,'*',1));          printf("%s --> %s\n",POLYToString(f,'*',1),POLYToString(f2,'*',1));
Line 136  int grade_sugar(f)
Line 172  int grade_sugar(f)
   static int nn,mm,ll,cc,n,m,l,c;    static int nn,mm,ll,cc,n,m,l,c;
   static struct ring *cr = (struct ring *)NULL;    static struct ring *cr = (struct ring *)NULL;
   
     /* if (Ecart) return ecart_grade_sugar(f); */
   if (f ISZERO) return(-1);    if (f ISZERO) return(-1);
   tf = f->m;    tf = f->m;
   if (tf->ringp != cr) {    if (tf->ringp != cr) {
Line 170  int grade_sugar(f)
Line 207  int grade_sugar(f)
       r += tf->e[i].x;        r += tf->e[i].x;
       r += tf->e[i].D;        r += tf->e[i].D;
     }      }
       f = f->next;
       ans = (ans>r?ans:r);
     }
     return(ans);
   }
   
   static int ecart_grade_sugar(POLY f)  /* experimental */
   {
     int r;
     int i,ans;
     MONOMIAL tf;
     static int nn,mm,ll,cc,n,m,l,c;
     static struct ring *cr = (struct ring *)NULL;
     int soffset;
     int sdegree;
   
     if (f ISZERO) return(-1);
     tf = f->m;
     if (tf->ringp != cr) {
       n = tf->ringp->n;
       m = tf->ringp->m;
       l = tf->ringp->l;
       c = tf->ringp->c;
       nn = tf->ringp->nn;
       mm = tf->ringp->mm;
       ll = tf->ringp->ll;
       cc = tf->ringp->cc;
       cr = tf->ringp;
     }
   
     soffset = 0x7fffffff; /* large number */
     while (f != NULL) {
       r = 0;
       tf = f->m;
       for (i=m; i<nn; i++) {
         r -= tf->e[i].x;
         r += tf->e[i].D;
       }
       f = f->next;
       soffset = (r < soffset? r: soffset);
     }
   
     ans = 0;
     while (f != NULL) {
       r = 0;  sdegree = 0;
       tf = f->m;
       for (i=0; i<cc; i++) {
         r += tf->e[i].x;
         r += tf->e[i].D;
       }
       for (i=c; i<ll; i++) {
         r += tf->e[i].x;
         r += tf->e[i].D;
       }
       for (i=l; i<mm; i++) {
         r += tf->e[i].x;
         r += tf->e[i].D;
       }
       for (i=m; i<nn; i++) {
         r += tf->e[i].x;
         r += tf->e[i].D;
         sdegree -= tf->e[i].x;
         sdegree += tf->e[i].D;
   
       }
           r += sdegree-soffset;
     f = f->next;      f = f->next;
     ans = (ans>r?ans:r);      ans = (ans>r?ans:r);
   }    }
Legend:
Removed from v.1.3  
changed lines
  Added in v.1.7
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>