Changeset 196cdf in git

Timestamp:

May 9, 2005, 1:48:47 PM (18 years ago)

Author:

Michael Brickenstein <bricken@…>

Branches:

(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a657104b677b4c461d018cbf3204d72d34ad66a9')

Children:

2fc36ac3ab2c9f6c6edbb59e818faece93630e52

Parents:

f6c9006209a9d3dd56eda544c0153792c2522afd

Message:

*bricken: cleaning


git-svn-id: file:///usr/local/Singular/svn/trunk@8107 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• kernel/tgb.cc (modified) (6 diffs)

kernel/tgb.cc

@@ -1641 +1641 @@
 //mac_polys exp are smaller iff they are greater by monomial ordering
 //corresponding to solving linear equations notation
+
+//* obsolete
 struct int_poly_pair{
   poly p;
@@ -1646 +1648 @@
 };
 
+
+//* obsolete
 void t2ippa_rec(poly* ip,int* ia, poly_tree_node* k, int &offset){
     if(!k) return;
@@ -1656 +1660 @@
     delete k;
   }
+
+//*obsolete
 void t2ippa(poly* ip,int* ia,exp_number_builder & e){
 
@@ -1671 +1677 @@
   return TRUE;
 }
+
+//*obsolete
 void pre_comp(poly* p,int & pn,calc_dat* c){
   if(!(pn))
@@ -4101 +4109 @@
     int d=erg.to_reduce_u-erg.to_reduce_l+1;
     //if ((!erg.fromS)&&(d>100)){
-    if (0){
-      PrintS("L");
-      if(!erg.fromS){
-        erg.to_reduce_u=si_max(erg.to_reduce_u,erg.reduce_by);
-        if (pLmEqual(los[erg.reduce_by].p,los[erg.to_reduce_l].p))
-          erg.to_reduce_l=si_min(erg.to_reduce_l,erg.reduce_by);
-      }
-      int pn=erg.to_reduce_u+1-erg.to_reduce_l;
-      poly* p=(poly*) omalloc((pn)*sizeof(poly));
-      int i;
-      for(i=0;i<pn;i++){
-        int len;
-        los[erg.to_reduce_l+i].flatten();
-        kBucketClear(los[erg.to_reduce_l+i].bucket,&p[i],&len);
-        
-        redTailShort(p[i],c->strat);
-      }
-      pre_comp(p,pn,c);
-      int j;
-      for(j=0;j<pn;j++){
-        los[erg.to_reduce_l+j].p=p[j];
-        los[erg.to_reduce_l+j].sev=pGetShortExpVector(p[j]);
-        los[erg.to_reduce_l+j].sum=NULL;
-        int len=pLength(p[j]);
-        kBucketInit(los[erg.to_reduce_l+j].bucket,los[erg.to_reduce_l+j].p,len);
-      }
-      for(j=erg.to_reduce_l+pn;j<=erg.to_reduce_u;j++){
-        los[j].p=NULL;
-        
-      }
-
-      omfree(p);
-    }
-    else {
+    
     multi_reduction_lls_trick(los,losl,c,erg);
     int sum=0;
@@ -4144 +4119 @@
     //Print("\n");
     multi_reduce_step(erg,los,c);
-    }
+   
 //     reduction_step *rs=create_reduction_step(erg, los, c);
 //     rs->reduce(los,erg.to_reduce_l,erg.to_reduce_u);