Changeset 66a672 in git
 Timestamp:
 Oct 19, 1999, 1:41:40 PM (25 years ago)
 Branches:
 (u'fiekerDuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', 'b52fc4b2495505785981d640dcf7eb3e456778ef')
 Children:
 d2b6cf082728946a490177ca3d6aba074109fe5c
 Parents:
 e771fa766e0f49356f9f2da046e1e17247067dfe
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

Singular/ideals.cc
re771fa r66a672 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: ideals.cc,v 1.6 2 19991018 17:56:20 siebertExp $ */4 /* $Id: ideals.cc,v 1.63 19991019 11:41:40 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT  all basic methods to manipulate ideals … … 1074 1074 h>m[j] = pOne(); 1075 1075 pSetComp(h>m[j],j+1); 1076 pSetmComp(h>m[j]); 1076 1077 } 1077 1078 return h; … … 1120 1121 q = pOne(); 1121 1122 pSetComp(q,i+1+length); 1123 pSetmComp(q); 1122 1124 if (flength==0) pShift(&(temp>m[k]),1); 1123 1125 p = temp>m[k]; 1124 while (pNext(p) ) pIter(p);1126 while (pNext(p)!=NULL) pIter(p); 1125 1127 pNext(p) = q; 1126 1128 k++; … … 1166 1168 k = pGetComp(p)1length; 1167 1169 pSetComp(p,0); 1170 pSetmComp(p); 1168 1171 result>m[j] = pAdd(result>m[j],pMult(pCopy(first>m[k]),p)); 1169 1172 p = q; … … 1640 1643 j = pGetComp(p); 1641 1644 pSetComp(p,(*reord)[j]); 1645 pSetmComp(p); 1642 1646 pIter(p); 1643 1647 } … … 1712 1716 t=pGetComp(p); 1713 1717 pSetComp(p,0); 1718 pSetmComp(p); 1714 1719 MATELEM(*ma,tk,i+2) = pAdd(MATELEM(*ma,tk,i+2),p); 1715 1720 } … … 1951 1956 } 1952 1957 kmax = j*k+1; 1958 pSetSyzComp(kmax1); 1953 1959 p = pOne(); 1954 1960 pSetComp(p,kmax); 1955 pSet SyzComp(kmax1);1961 pSetmComp(p); 1956 1962 q = pAdd(q,p); 1957 1963 h4>m[0] = q; … … 2833 2839 cp = pGetComp(h); 2834 2840 pSetComp(h,0); 2841 pSetmComp(h); 2835 2842 #ifdef TEST 2836 2843 if (cp>mod>rank) … … 2881 2888 { 2882 2889 pSetComp(h,0); 2890 pSetmComp(h); 2883 2891 MATELEM(result,cp,i+1) = pAdd(MATELEM(result,cp,i+1),h); 2884 2892 } … … 3102 3110 q = pOne(); 3103 3111 pSetComp(q,i+1+length); 3112 pSetmComp(q); 3104 3113 if(temp>m[i]!=NULL) 3105 3114 { … … 3431 3440 { 3432 3441 pSetComp(p,(*indexMap)[pGetComp(p)]); 3442 pSetmComp(p); 3433 3443 while ((pNext(p)!=NULL) && ((*toKill)[pGetComp(pNext(p))]==1)) 3434 3444 pDelete1(&pNext(p)); 3435 3445 pIter(p); 3436 3446 } 3437 if (p!=NULL) pSetComp(p,(*indexMap)[pGetComp(p)]); 3447 if (p!=NULL) 3448 { 3449 pSetComp(p,(*indexMap)[pGetComp(p)]); 3450 pSetmComp(p); 3451 } 3438 3452 } 3439 3453 idSkipZeroes(res); … … 3467 3481 int co=pGetComp(h)1; 3468 3482 pSetComp(h,i); 3483 pSetmComp(h); 3469 3484 b>m[co]=pAdd(b>m[co],h); 3470 3485 pIter(p);
Note: See TracChangeset
for help on using the changeset viewer.