computes the reduction of an integer i modulo an ideal which captures a std basis */
| 435 | /* computes the reduction of an integer i modulo an ideal |
| 436 | which captures a std basis */ |
| 437 | int getReduction (const int i, const ideal& iSB) |
| 438 | { |
| 439 | if (i == 0) return 0; |
| 440 | poly f = pISet(i); |
| 441 | poly g = kNF(iSB, currRing->qideal, f); |
| 442 | int result = 0; |
| 443 | if (g != NULL) result = n_Int(pGetCoeff(g), currRing->cf); |
| 444 | pDelete(&f); |
| 445 | pDelete(&g); |
| 446 | return result; |
| 447 | } |
| 448 | |
| 449 | IntMinorValue IntMinorProcessor::getMinorPrivateLaplace( |
| 450 | const int k, |
no test coverage detected