Changeset ff0530 in git
- Timestamp:
- Feb 1, 2024, 4:15:57 PM (3 months ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- 04cc5da7e5ea83aed70148b8e57df1dc0ad7f5ca
- Parents:
- 0cdc1ead04cef54ccfc0304582a3408739ebc372
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/GBEngine/syz.cc
r0cdc1e rff0530 221 221 poly unit1,unit2; 222 222 poly actWith=syz->m[elnum]; 223 syz->m[elnum] = NULL; 223 224 224 225 if (from<0) from = 0; 225 226 if ((till<=0) || (till>IDELEMS(syz))) till = IDELEMS(syz); 226 syz->m[elnum] = NULL;227 227 if (!rField_has_simple_inverse(currRing)) p_Cleardenom(actWith, currRing); 228 228 /*--makes Gauss alg. for the column ModComp--*/ … … 251 251 { 252 252 p = up->m[i]; 253 while ((p!=NULL) && (pGetComp(p)==k)) 254 { 255 /* 256 pp = pNext(p); 257 pNext(p) = NULL; 258 pDelete(&p); 259 p = pp; 260 */ 253 while ((p!=NULL) && ((int)__p_GetComp(p,currRing)==k)) 254 { 261 255 pLmDelete(&p); 262 256 } … … 266 260 while (pNext(p)!=NULL) 267 261 { 268 if ( pGetComp(pNext(p))==k)262 if ((int)__p_GetComp(pNext(p),currRing)==k) 269 263 { 270 /*271 pp = pNext(pNext(p));272 pNext(pNext(p)) = NULL;273 pDelete(&pNext(p));274 pNext(p) = pp;275 */276 264 pLmDelete(&pNext(p)); 277 265 } … … 306 294 if (reddeg0->m[i]!=NULL) 307 295 { 308 j = pGetComp(reddeg0->m[i]);296 j = (int)__p_GetComp(reddeg0->m[i],currRing); 309 297 pDelete(&(res[index]->m[j-1])); 310 298 /*res[index]->m[j-1] = NULL;*/ … … 326 314 { 327 315 p = res[index]->m[k]; 328 while ((p!=NULL) && ((!pLmIsConstantComp(p)) || (pGetComp(p)!=j))) 316 while ((p!=NULL) 317 && ((!pLmIsConstantComp(p)) || ((int)__p_GetComp(p,currRing)!=j))) 329 318 pIter(p); 330 if ((p!=NULL) && (pLmIsConstantComp(p)) && (pGetComp(p)==j)) break; 319 if ((p!=NULL) 320 && (pLmIsConstantComp(p)) 321 && ((int)__p_GetComp(p,currRing)==j)) break; 331 322 k++; 332 323 } 324 #ifndef SING_NDEBUG 333 325 if (k>=IDELEMS(res[index])) 334 326 { 335 327 PrintS("out of range\n"); 336 328 } 329 #endif 337 330 syGaussForOne(res[index],k,j); 338 331 if (res[index+1]!=NULL) … … 843 836 { 844 837 if ((pGetComp(res[i]->m[j])>l) 845 838 // usual resolutions do not the following, but artifulal built may: (tr. #763) 846 839 //|| ((i>1) && (res[i-1]->m[pGetComp(res[i]->m[j])-1]==NULL)) 847 840 ) 848 841 { 849 842 WerrorS("input not a resolution");
Note: See TracChangeset
for help on using the changeset viewer.