Changeset a875c3 in git


Ignore:
Timestamp:
Nov 23, 2011, 4:59:58 PM (12 years ago)
Author:
YueRen <yue.ren.kl@…>
Branches:
(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
Children:
d3bf01540e1d6181e4e04912c9334dac07c29b47
Parents:
58f11d0e41884ac92b8aa12caa481d1e5f0b8c0c
Message:
replaced "rChar(currRing)" with "currRing->cf"
File:
1 edited

Legend:

Unmodified
Added
Removed
  • Singular/walk.cc

    r58f11d0 ra875c3  
    3131
    3232//#define TIME_TEST // print the used time of each subroutine
    33 //#define ENDWALKS //print the size of the last omega-homogenoues Gröbner basis
     33//#define ENDWALKS //print the size of the last omega-homogenoues Grï¿œbner basis
    3434
    3535/* includes */
     
    18151815  int i, nv = currRing->N;
    18161816
    1817   r->cf->ch  = rChar (currRing);
     1817  r->cf  = currRing->cf;
    18181818  r->N   = currRing->N;
    18191819  int nb = rBlocks(currRing) + 1;//31.10.01 (+1)
     
    18861886  int i, nv = currRing->N;
    18871887
    1888   r->cf->ch  = rChar (currRing);
     1888  r->cf  = currRing->cf;
    18891889  r->N   = currRing->N;
    18901890  int nb = rBlocks(currRing) + 1;//31.10.01 (+1)
     
    20352035
    20362036
    2037   r->cf->ch  = rChar (currRing);
     2037  r->cf  = currRing->cf;
    20382038  r->N   = currRing->N;
    20392039  int nb = rBlocks(currRing) + 1;//31.10.01 (+1)
     
    32723272
    32733273/* The main procedur Mfwalk calls the recursive Subroutine
    3274    rec_fractal_call to compute the wanted Gröbner basis.
    3275    At the main procedur we compute the reduced Gröbner basis w.r.t. a "fast"
     3274   rec_fractal_call to compute the wanted Grï¿œbner basis.
     3275   At the main procedur we compute the reduced Grï¿œbner basis w.r.t. a "fast"
    32763276   order, e.g. "dp" and a sequence of weight vectors which are row vectors
    32773277   of a matrix. This matrix defines the given monomial order, e.g. "lp"
     
    35613561
    35623562/* 08.09.02 */
    3563 /******** THE NEW GRÖBNER WALK ALGORITHM **********/
    3564 /* Gröbnerwalk with a recursive "second" alternative GW, REC_GB_Mwalk
     3563/******** THE NEW GRï¿œBNER WALK ALGORITHM **********/
     3564/* Grï¿œbnerwalk with a recursive "second" alternative GW, REC_GB_Mwalk
    35653565   that only computes the last reduced GB */
    35663566ideal Mwalk(ideal Go, intvec* curr_weight, intvec* target_weight)
     
    36203620      tim = clock();
    36213621      /*
    3622         Print("\n// **** Gröbnerwalk took %d steps and ", nwalk);
     3622        Print("\n// **** Grï¿œbnerwalk took %d steps and ", nwalk);
    36233623        PrintS("\n// **** call the rec. Pert. Walk to compute a red GB of:");
    36243624        idElements(Gomega, "G_omega");
     
    51305130
    51315131
    5132 /* compute the reduced Gröbner basis of an ideal <Go> w.r.t. lp */
     5132/* compute the reduced Grï¿œbner basis of an ideal <Go> w.r.t. lp */
    51335133static ideal Mpwalk_MAltwalk1(ideal Go, intvec* curr_weight, int tp_deg)
    51345134{
Note: See TracChangeset for help on using the changeset viewer.