Changeset 4bec55 in git


Ignore:
Timestamp:
Sep 11, 2004, 6:10:08 PM (20 years ago)
Author:
Michael Brickenstein <bricken@…>
Branches:
(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
Children:
0e815312687b458e3024cbb8a53404b673bb46d8
Parents:
3cdced81e6665498ee6163164b89c0e55afa222f
Message:
*bricken: further bugfixing


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

Legend:

Unmodified
Added
Removed
  • Singular/tgb.cc

    r3cdced r4bec55  
    19991999      mat->perm_rows(i,pn-1);
    20002000      pn--;
    2001       //if(i!=pn){i--;}
     2001      if(i!=pn){i--;}
    20022002    }
    20032003  }
     
    20632063        mat->perm_rows(i,pn-1);
    20642064        pn--;
     2065        if(i!=pn){i--;}
    20652066      }
    20662067    }
     
    20862087      //v is ascending ordered, we need descending order
    20872088      v=done_index-1-v;
     2089      number nt=t->get(i,v);
     2090      nDelete(&nt);
    20882091      t->set(i,v,nCopy(p_i->coef));
    20892092      p_i=p_i->next;
     
    27042707
    27052708  assume(c->strat->sl==c->strat->Shdl->idelems()-1);
    2706 
    2707   for (i=1;i<n;i++)//the 1 is wanted, because first element is added to basis
    2708   {
    2709     //     add_to_basis(I->m[i],-1,-1,c);
    2710     si=(sorted_pair_node*) omalloc(sizeof(sorted_pair_node));
    2711     si->i=-1;
    2712     si->j=-1;
    2713     si->expected_length=pLength(I->m[i]);
    2714     si->deg=pTotaldegree(I->m[i]);
    2715     si->lcm_of_lm=I->m[i];
     2709  if(!(F4_mode))
     2710  {
     2711    for (i=1;i<n;i++)//the 1 is wanted, because first element is added to basis
     2712    {
     2713      //     add_to_basis(I->m[i],-1,-1,c);
     2714      si=(sorted_pair_node*) omalloc(sizeof(sorted_pair_node));
     2715      si->i=-1;
     2716      si->j=-1;
     2717      si->expected_length=pLength(I->m[i]);
     2718      si->deg=pTotaldegree(I->m[i]);
     2719      si->lcm_of_lm=I->m[i];
     2720     
     2721      //      c->apairs[n-1-i]=si;
     2722      c->apairs[n-i-1]=si;
     2723      ++(c->pair_top);
     2724    }
     2725  }
     2726  else
     2727  {
     2728     for (i=1;i<n;i++)//the 1 is wanted, because first element is added to basis
     2729       add_to_basis(I->m[i],-1,-1,c);
     2730  }
    27162731   
    2717 //      c->apairs[n-1-i]=si;
    2718     c->apairs[n-i-1]=si;
    2719     ++(c->pair_top);
    2720    }
    2721  
    27222732
    27232733  while(c->pair_top>=0)
  • Singular/tgb.h

    r3cdced r4bec55  
    11#ifndef TGB_H
    22#define TGB_H
    3 
     3//#define OM_CHECK 3
     4//#define OM_TRACK 5
    45#include "mod2.h"
    56#include <omalloc.h>
Note: See TracChangeset for help on using the changeset viewer.