Changeset 58316de in git for kernel/GBEngine/kutil.cc
- Timestamp:
- Nov 24, 2018, 4:44:53 PM (5 years ago)
- Branches:
- (u'spielwiese', '2a584933abf2a2d3082034c7586d38bb6de1a30a')
- Children:
- 081f8d89bef1a35313405d0ccb8d5b71ff52516f
- Parents:
- b95a5fd690d6e706af819dfdf1070a990219bf41
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/GBEngine/kutil.cc
rb95a5f r58316de 12262 12262 12263 12263 #ifdef HAVE_SHIFTBBA 12264 12265 #ifdef KDEBUG 12266 #define CRITERION_DEBUG 12267 #endif 12264 12268 /*2 12265 12269 * put the pair (q,p) into the set B, ecart=ecart(p), q is the shift of some s[i] … … 12267 12271 void enterOnePairShift (poly q, poly p, int ecart, int isFromQ, kStrategy strat, int atR, int ecartq, int qisFromQ, int shiftcount, int ifromS) 12268 12272 { 12273 #ifdef CRITERION_DEBUG 12274 Print("Consider pair (%s, %s)\n", pString(q), pString(p)); 12275 poly lmq = pHead(q); 12276 poly lmp = pHead(p); 12277 Print(" %s\n", pString(lmq)); 12278 Print(" %s\n", pString(lmp)); 12279 pLmDelete(lmq); 12280 pLmDelete(lmp); 12281 #endif 12269 12282 12270 12283 /* Format: q and p are like strat->P.p, so lm in CR, tail in TR */ … … 12304 12317 12305 12318 /* apply the V criterion */ 12306 if (!p IsInV(Lp.lcm))12319 if (!pmIsInV(Lp.lcm)) 12307 12320 { 12308 12321 #ifdef KDEBUG … … 12319 12332 /* + counter for applying the V criterion */ 12320 12333 strat->cv++; 12334 #ifdef CRITERION_DEBUG 12335 PrintS("--- V crit\n"); 12336 #endif 12321 12337 return; 12322 12338 } … … 12343 12359 strat->cp++; 12344 12360 pLmFree(Lp.lcm); 12361 #ifdef CRITERION_DEBUG 12362 PrintS("--- prod crit\n"); 12363 #endif 12345 12364 return; 12346 12365 } … … 12350 12369 { 12351 12370 pLmFree(Lp.lcm); 12371 #ifdef CRITERION_DEBUG 12372 PrintS("--- ecartq > ecart\n"); 12373 #endif 12352 12374 return; 12353 12375 /*the pair is (s[i],t[.]), discard it if the ecart is too big*/ … … 12372 12394 { 12373 12395 pLmFree(Lp.lcm); 12396 #ifdef CRITERION_DEBUG 12397 Print("--- divided by B[%d]\n", j); 12398 #endif 12374 12399 return; 12375 12400 } … … 12381 12406 { 12382 12407 deleteInL(strat->B,&strat->Bl,j,strat); 12408 #ifdef CRITERION_DEBUG 12409 Print("divides B[%d] -> delete B[%d]\n", j, j); 12410 #endif 12383 12411 strat->c3++; 12384 12412 } … … 12410 12438 strat->cp++; 12411 12439 pLmFree(Lp.lcm); 12440 #ifdef CRITERION_DEBUG 12441 PrintS("--- prod crit\n"); 12442 #endif 12412 12443 return; 12413 12444 } … … 12415 12446 { 12416 12447 pLmFree(Lp.lcm); 12448 #ifdef CRITERION_DEBUG 12449 PrintS("--- ecartq > ecart\n"); 12450 #endif 12417 12451 return; 12418 12452 /*the pair is (s[i],t[.]), discard it if the ecart is too big*/ … … 12433 12467 { 12434 12468 pLmFree(Lp.lcm); 12469 #ifdef CRITERION_DEBUG 12470 Print("--- divided by B[%d]\n", j); 12471 #endif 12435 12472 return; 12436 12473 } … … 12441 12478 { 12442 12479 deleteInL(strat->B,&strat->Bl,j,strat); 12480 #ifdef CRITERION_DEBUG 12481 Print("divides B[%d] -> delete B[%d]\n", j, j); 12482 #endif 12443 12483 strat->c3++; 12444 12484 } … … 12453 12493 pNorm(p); 12454 12494 if ((q==NULL) || (p==NULL)) 12495 { 12496 #ifdef CRITERION_DEBUG 12497 PrintS("--- q == NULL || p == NULL\n"); 12498 #endif 12455 12499 return; 12500 } 12456 12501 if ((strat->fromQ!=NULL) && (isFromQ!=0) && (qfromQ!=0)) 12502 { 12457 12503 Lp.p=NULL; 12504 #ifdef CRITERION_DEBUG 12505 PrintS("--- pair from Q\n"); 12506 #endif 12507 } 12458 12508 else 12459 12509 { … … 12513 12563 */ 12514 12564 if (Lp.lcm!=NULL) pLmFree(Lp.lcm); 12565 #ifdef CRITERION_DEBUG 12566 PrintS("--- S-poly = 0\n"); 12567 #endif 12515 12568 } 12516 12569 else … … 12549 12602 l = strat->posInL(strat->B,strat->Bl,&Lp,strat); 12550 12603 enterL(&strat->B,&strat->Bl,&strat->Bmax,Lp,l); 12604 #ifdef CRITERION_DEBUG 12605 PrintS("+++ Entered pair\n"); 12606 #endif 12551 12607 } 12552 12608 }
Note: See TracChangeset
for help on using the changeset viewer.