| java.lang.Object de.uka.ilkd.key.rule.metaconstruct.arith.Polynomial
Polynomial | public class Polynomial (Code) | | Class for analysing and modifying polynomial expressions over the integers
|
coeffGcd | public BigInteger coeffGcd()(Code) | | the greatest common divisor of the coefficients of the monomialsof this polynomial. The constant part of the polynomial is nottaken into account. If there are no monomials (apart from theconstant term), the result is BigInteger.ZERO |
getParts | public ListOfMonomial getParts()(Code) | | |
valueEq | public boolean valueEq(Polynomial p)(Code) | | true if the value of this willalways be equal to the value of p (i.e., same monomials and same constant part) |
valueLeq | public boolean valueLeq(Polynomial p)(Code) | | true if the value of this willalways be less or equal than the value of p (i.e., same monomials, but the constant part is less or equal) |
valueLess | public boolean valueLess(Polynomial p)(Code) | | true if the value of this willalways be less than the value of p (i.e., same monomials, but the constant part is less or equal) |
|
|