Changeset 4d13e7 in git for kernel/ideals.cc


Ignore:
Timestamp:
Jan 8, 2007, 5:05:40 PM (16 years ago)
Author:
Hans Schönemann <hannes@…>
Branches:
(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'c18334b998a8adbf0013b8e1ce0824774019443e')
Children:
2e4b40824453f115e0e5d369daa8dcdf4d89fcd8
Parents:
463646cc1d832ef666f2a67b688011c0f1e9b270
Message:
*hannes: format


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

Legend:

Unmodified
Added
Removed
  • kernel/ideals.cc

    r463646 r4d13e7  
    22*  Computer Algebra System SINGULAR     *
    33****************************************/
    4 /* $Id: ideals.cc,v 1.28 2006-12-15 17:16:06 Singular Exp $ */
     4/* $Id: ideals.cc,v 1.29 2007-01-08 16:05:40 Singular Exp $ */
    55/*
    66* ABSTRACT - all basic methods to manipulate ideals
     
    10891089        temp->m[k] = pCopy(first->m[i]);
    10901090      else
    1091         temp->m[k] = prCopyR(first->m[i], orig_ring);
     1091        temp->m[k] = prCopyR(first->m[i], orig_ring);
    10921092      q = pOne();
    10931093      pSetComp(q,i+1+length);
     
    11091109        temp->m[k] = pCopy(second->m[i]);
    11101110      else
    1111         temp->m[k] = prCopyR(second->m[i], orig_ring);
     1111        temp->m[k] = prCopyR(second->m[i], orig_ring);
    11121112      if (slength==0) pShift(&(temp->m[k]),1);
    11131113      k++;
     
    11291129    {
    11301130      if(syz_ring==orig_ring)
    1131         p = pCopy(temp1->m[i]);
     1131        p = pCopy(temp1->m[i]);
    11321132      else
    1133         p = prCopyR(temp1->m[i], syz_ring);
     1133        p = prCopyR(temp1->m[i], syz_ring);
    11341134      while (p!=NULL)
    11351135      {
     
    11391139        pSetComp(p,0);
    11401140        pSetmComp(p);
    1141         /* Warning! multiply only from the left! it's very important for Plural */
     1141        /* Warning! multiply only from the left! it's very important for Plural */
    11421142        result->m[j] = pAdd(result->m[j],pMult(p,pCopy(first->m[k])));
    11431143        p = q;
     
    23972397  {
    23982398    BOOLEAN BAD = FALSE;
    2399     if ( nc_rComplete(origR, &tmpR) ) 
     2399    if ( nc_rComplete(origR, &tmpR) )
    24002400    {
    24012401      Werror("error in nc_rComplete");
    24022402      BAD = TRUE;
    24032403    }
    2404     if (!BAD) 
     2404    if (!BAD)
    24052405    {
    24062406      /* tests the admissibility of the new elim. ordering */
     
    24202420      omFreeSize((ADDRESS)block1,ordersize*sizeof(int));
    24212421      rUnComplete(&tmpR);
    2422       if (w!=NULL)     
     2422      if (w!=NULL)
    24232423      {
    24242424        delete w;
     
    30223022  }
    30233023  if (w->length()+1 < cmax)
    3024   { 
     3024  {
    30253025    // Print("length: %d - %d \n", w->length(),cmax);
    30263026    return FALSE;
     
    30383038        pIter(p);
    30393039        if (p==NULL) break;
    3040         if (d!=pFDeg(p,currRing)) 
     3040        if (d!=pFDeg(p,currRing))
    30413041        {
    3042           //pWrite(q); wrp(p); Print(" -> %d - %d\n",d,pFDeg(p,currRing)); 
    3043           return FALSE; 
     3042          //pWrite(q); wrp(p); Print(" -> %d - %d\n",d,pFDeg(p,currRing));
     3043          return FALSE;
    30443044        }
    30453045      }
Note: See TracChangeset for help on using the changeset viewer.