| 522 | } |
| 523 | |
| 524 | int kFindNextDivisibleByInS(const kStrategy strat, int start,int max_ind, LObject* L) |
| 525 | { |
| 526 | unsigned long not_sev = ~L->sev; |
| 527 | poly p = L->GetLmCurrRing(); |
| 528 | int j = start; |
| 529 | |
| 530 | pAssume(~not_sev == p_GetShortExpVector(p, currRing)); |
| 531 | #if 1 |
| 532 | int ende=max_ind; |
| 533 | #else |
| 534 | int ende=strat->sl; |
| 535 | #endif |
| 536 | loop |
| 537 | { |
| 538 | if (j > ende) return -1; |
| 539 | #if defined(PDEBUG) || defined(PDIV_DEBUG) |
| 540 | if (p_LmShortDivisibleBy(strat->S[j], strat->sevS[j], |
| 541 | p, not_sev, currRing)) |
| 542 | #else |
| 543 | if ( !(strat->sevS[j] & not_sev) && |
| 544 | p_LmDivisibleBy(strat->S[j], p, currRing)) |
| 545 | #endif |
| 546 | { |
| 547 | return j; |
| 548 | } |
| 549 | j++; |
| 550 | } |
| 551 | } |
| 552 | |
| 553 | static long ind_fact_2(long arg) |
no test coverage detected