Changeset ceaa04 in git


Ignore:
Timestamp:
Nov 24, 2009, 3:22:44 PM (14 years ago)
Author:
Hans Schönemann <hannes@…>
Branches:
(u'spielwiese', '828514cf6e480e4bafc26df99217bf2a1ed1ef45')
Children:
38f763ebc0e6bb2edf001bab9337f25e3968589e
Parents:
d4f1b95bd0e770f9604f2584ed80d773a7b2977b
Message:
*hannes: code cleanup

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

Legend:

Unmodified
Added
Removed
  • factory/NTLconvert.cc

    rd4f1b95 rceaa04  
    288288    // Compute the canonicalform coefficient by coefficient,
    289289    // bigone summarizes the result.
    290     for (int j=0;j<deg(poly)+1;j++)
     290    for (int j=0;j<=deg(poly);j++)
    291291    {
    292292      if (coeff(poly,j)!=0)
     
    318318    // Compute the canonicalform coefficient by coefficient,
    319319    // bigone summarizes the result.
    320     for (int j=0;j<deg(poly)+1;j++)
     320    for (int j=0;j<=deg(poly);j++)
    321321    {
    322322      if (coeff(poly,j)!=0)
     
    387387    // the only possible coefficients are zero
    388388    // and one yielding the following simplified loop
    389     for (int j=0;j<deg(poly)+1;j++)
     389    for (int j=0;j<=deg(poly);j++)
    390390    {
    391391      if (coeff(poly,j)!=0) bigone+=power(x,j);
     
    519519    polynom=e[i].a;
    520520    exponent=e[i].b;
    521     for (int j=0;j<deg(polynom)+1;j++)
     521    for (int j=0;j<=deg(polynom);j++)
    522522    {
    523523      if (coeff(polynom,j)!=0)
     
    825825    exponent=e[i].b;
    826826
    827     for (int j=0;j<deg(polynom)+1;j++)
     827    for (int j=0;j<=deg(polynom);j++)
    828828    {
    829829      if (IsOne(coeff(polynom,j)))
     
    869869    exponent=e[i].b;
    870870
    871     for (int j=0;j<deg(polynom)+1;j++)
     871    for (int j=0;j<=deg(polynom);j++)
    872872    {
    873873      if (IsOne(coeff(polynom,j)))
     
    959959    exponent=e[i].b;
    960960
    961     for (int j=0;j<deg(polynom)+1;j++)
     961    for (int j=0;j<=deg(polynom);j++)
    962962    {
    963963      if (IsOne(coeff(polynom,j)))
     
    10741074{
    10751075  CanonicalForm bigone= 0;
    1076   for (int j=0;j<deg(f)+1;j++)
     1076  for (int j=0;j<=deg(f);j++)
    10771077  {
    10781078    if (IsOne(coeff(f,j)))
  • factory/cf_factor.cc

    rd4f1b95 rceaa04  
    193193    while(j>0) { t*=tt; j--; }
    194194  }
    195   if ((f-t)!=0) { printf("problem:\n");out_cf("factor:",f," has problems\n");}
     195  if (!(f-t).isZero()) { printf("problem:\n");out_cf("factor:",f," has problems\n");}
    196196}
    197197//#endif
Note: See TracChangeset for help on using the changeset viewer.