Changeset 2dc9911 in git


Ignore:
Timestamp:
May 11, 2007, 1:40:28 PM (17 years ago)
Author:
Oliver Wienand <wienand@…>
Branches:
(u'fieker-DuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', '38dfc5131670d387a89455159ed1e071997eec94')
Children:
c4002e9d130952e0a59c8e7fb57356ef52846f3b
Parents:
a5d7c1678c0189cdbfc0cdf82adb206d80d8bcbb
Message:
*** empty log message ***


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

Legend:

Unmodified
Added
Removed
  • kernel/ringgb.cc

    ra5d7c1 r2dc9911  
    22*  Computer Algebra System SINGULAR     *
    33****************************************/
    4 /* $Id: ringgb.cc,v 1.13 2007-05-11 10:48:05 wienand Exp $ */
     4/* $Id: ringgb.cc,v 1.14 2007-05-11 11:40:28 wienand Exp $ */
    55/*
    66* ABSTRACT: ringgb interface
     
    161161
    162162poly plain_spoly(poly f, poly g) {
    163   number cf = pGetCoeff(f), cg = pGetCoeff(g);
     163  number cf = nCopy(pGetCoeff(f)), cg = nCopy(pGetCoeff(g));
    164164  int ct = ksCheckCoeff(&cf, &cg); // gcd and zero divisors
    165165  poly fm, gm;
     
    167167  pSetCoeff0(fm, cg);
    168168  pSetCoeff0(gm, cf);  // and now, m1 * LT(p1) == m2 * LT(p2)
    169   poly sp = pSub(pMult_mm(f, fm), pMult_mm(g, gm));
     169  poly sp = pSub(ppMult_mm(f, fm), ppMult_mm(g, gm));
    170170  pDelete(&fm);
    171171  pDelete(&gm);
     
    180180  int c = 1;
    181181  while (h != NULL && i >= 0) {
    182     Print("%d-step NF - h:", c);
    183     wrp(h);
    184     PrintS(" ");
    185     PrintS("G->m[i]:");
    186     wrp(G->m[i]);
    187     PrintLn();
     182//    Print("%d-step NF - h:", c);
     183//    wrp(h);
     184//    PrintS(" ");
     185//    PrintS("G->m[i]:");
     186//    wrp(G->m[i]);
     187//    PrintLn();
    188188    h = plain_spoly(h, G->m[i]);
    189     PrintS("=> h=");
    190     wrp(h);
    191     PrintLn();
     189//    PrintS("=> h=");
     190//    wrp(h);
     191//    PrintLn();
    192192    i = findRingSolver(h, G, r);
    193193    c++;
     
    200200  int i = 0;
    201201  int j = 0;
     202  Print("I");
    202203  for (i = 0; i < IDELEMS(I); i++) {
    203204    if (ringNF(I->m[i], GI, currRing) != NULL) {
     
    209210      return(0);
    210211    }
    211   }
    212   Print("I");
     212    Print("-");
     213  }
     214  Print("G");
    213215  for (i = 0; i < IDELEMS(GI); i++) {
    214     Print("-");
    215216    for (j = i + 1; j < IDELEMS(GI); j++) {
    216217      f = pCopy(GI->m[i]);
     
    230231      }
    231232      pDelete(&h);
    232     }
    233   }
     233      Print("-");
     234    }
     235  }
     236//  Print("Fine.");
     237//  PrintLn();
    234238  return(1);
    235239}
Note: See TracChangeset for help on using the changeset viewer.