| java.lang.Object de.uka.ilkd.key.logic.LexPathOrdering
compare | public static int compare(BigInteger a, BigInteger b)(Code) | | TODO: this should also be used when comparing terms
The reduction ordering on integers that is described in "A
critical-pair/completion algorithm for finitely generated ideals in
rings", with the difference that positive numbers are here considered as
smaller than negative numbers (with the same absolute value)
a negative number, zero, or a positive number, if a is smaller, equal to or greater than b |
divide | public static BigInteger divide(BigInteger a, BigInteger c)(Code) | | the result of dividing a by c ,such that the remainder becomes minimal in the reduction orderingLexPathOrdering.compare on integers |
|
|