| 407 | } |
| 408 | |
| 409 | IntMinorValue IntMinorProcessor::getNextMinor(const int characteristic, |
| 410 | const ideal& iSB, |
| 411 | const char* algorithm) |
| 412 | { |
| 413 | /* call a helper method which computes the minor (without a cache): */ |
| 414 | if (strcmp(algorithm, "Laplace") == 0) |
| 415 | return getMinorPrivateLaplace(_minorSize, _minor, characteristic, iSB); |
| 416 | else if (strcmp(algorithm, "Bareiss") == 0) |
| 417 | return getMinorPrivateBareiss(_minorSize, _minor, characteristic, iSB); |
| 418 | else assume(false); |
| 419 | |
| 420 | /* The following code is never reached and just there to make the |
| 421 | compiler happy: */ |
| 422 | return IntMinorValue(); |
| 423 | } |
| 424 | |
| 425 | IntMinorValue IntMinorProcessor::getNextMinor(Cache<MinorKey, |
| 426 | IntMinorValue>& c, |
no test coverage detected