Changeset 4d13e7 in git for kernel/ideals.cc
- Timestamp:
- Jan 8, 2007, 5:05:40 PM (16 years ago)
- Branches:
- (u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'c18334b998a8adbf0013b8e1ce0824774019443e')
- Children:
- 2e4b40824453f115e0e5d369daa8dcdf4d89fcd8
- Parents:
- 463646cc1d832ef666f2a67b688011c0f1e9b270
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/ideals.cc
r463646 r4d13e7 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: ideals.cc,v 1.2 8 2006-12-15 17:16:06Singular Exp $ */4 /* $Id: ideals.cc,v 1.29 2007-01-08 16:05:40 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT - all basic methods to manipulate ideals … … 1089 1089 temp->m[k] = pCopy(first->m[i]); 1090 1090 else 1091 1091 temp->m[k] = prCopyR(first->m[i], orig_ring); 1092 1092 q = pOne(); 1093 1093 pSetComp(q,i+1+length); … … 1109 1109 temp->m[k] = pCopy(second->m[i]); 1110 1110 else 1111 1111 temp->m[k] = prCopyR(second->m[i], orig_ring); 1112 1112 if (slength==0) pShift(&(temp->m[k]),1); 1113 1113 k++; … … 1129 1129 { 1130 1130 if(syz_ring==orig_ring) 1131 1131 p = pCopy(temp1->m[i]); 1132 1132 else 1133 1133 p = prCopyR(temp1->m[i], syz_ring); 1134 1134 while (p!=NULL) 1135 1135 { … … 1139 1139 pSetComp(p,0); 1140 1140 pSetmComp(p); 1141 1141 /* Warning! multiply only from the left! it's very important for Plural */ 1142 1142 result->m[j] = pAdd(result->m[j],pMult(p,pCopy(first->m[k]))); 1143 1143 p = q; … … 2397 2397 { 2398 2398 BOOLEAN BAD = FALSE; 2399 if ( nc_rComplete(origR, &tmpR) ) 2399 if ( nc_rComplete(origR, &tmpR) ) 2400 2400 { 2401 2401 Werror("error in nc_rComplete"); 2402 2402 BAD = TRUE; 2403 2403 } 2404 if (!BAD) 2404 if (!BAD) 2405 2405 { 2406 2406 /* tests the admissibility of the new elim. ordering */ … … 2420 2420 omFreeSize((ADDRESS)block1,ordersize*sizeof(int)); 2421 2421 rUnComplete(&tmpR); 2422 if (w!=NULL) 2422 if (w!=NULL) 2423 2423 { 2424 2424 delete w; … … 3022 3022 } 3023 3023 if (w->length()+1 < cmax) 3024 { 3024 { 3025 3025 // Print("length: %d - %d \n", w->length(),cmax); 3026 3026 return FALSE; … … 3038 3038 pIter(p); 3039 3039 if (p==NULL) break; 3040 if (d!=pFDeg(p,currRing)) 3040 if (d!=pFDeg(p,currRing)) 3041 3041 { 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; 3044 3044 } 3045 3045 }
Note: See TracChangeset
for help on using the changeset viewer.