Changeset d681e8 in git for kernel/polys.cc


Ignore:
Timestamp:
May 19, 2007, 3:22:23 PM (16 years ago)
Author:
Oliver Wienand <wienand@…>
Branches:
(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')
Children:
aef8bb403e723cf3c64015379df7cbc448fbb3b3
Parents:
1591a873ae939d12cc28f2fbb1408a9e8fdad9b8
Message:
kInline.cc, kutil.h:
new: k_GetStringLeadTerms

kutil.cc:
lots of KDEBUG messages inside of HAVE_RINGS switches
added ntl xgcd import
new procs:
enterOneStrongPoly
initenterstrongPairs

rmodulon.cc:
nrnLcm small error
Question: Is x == modul Then return 0 faster than return x % modul?
nrnComp missing case corrected
intDiv(0,0) = 0, intDiv(0,1) = 1, intDiv(0, a) = modul DIV a

rmodulo2m.cc:
intDiv(0,0) = 0, intDiv(0,1) = 1, intDiv(0, a) = modul DIV a


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

Legend:

Unmodified
Added
Removed
  • kernel/polys.cc

    r1591a87 rd681e8  
    22*  Computer Algebra System SINGULAR     *
    33****************************************/
    4 /* $Id: polys.cc,v 1.17 2007-05-11 10:48:04 wienand Exp $ */
     4/* $Id: polys.cc,v 1.18 2007-05-19 13:22:23 wienand Exp $ */
    55
    66/*
     
    691691#ifdef HAVE_RINGS  //HACK TODO Oliver
    692692number nGetUnit(number k) {
    693   return (number) nIntDiv(k, nGcd(k, 0, currRing));
     693  number unit = nIntDiv(k, nGcd(k, 0, currRing));
     694  number gcd = nGcd(unit, 0, currRing);
     695  if (!nIsOne(gcd))
     696  {
     697    number tmp = nMult(unit, unit);
     698    number gcd_new = nGcd(tmp, 0, currRing);
     699    while (gcd_new != gcd)
     700    {
     701      gcd = gcd_new;
     702      tmp = nMult(tmp, unit);
     703      gcd_new = nGcd(tmp, 0, currRing);
     704    }
     705    unit = nAdd(unit, nIntDiv(0, gcd_new));
     706  }
     707  return unit;
    694708}
    695709#endif
Note: See TracChangeset for help on using the changeset viewer.