Uses of Interface
dev.civl.sarl.IF.number.IntegerNumber
Packages that use IntegerNumber
Package
Description
The ideal module supports reasoning about numerical expressions using "ideal"
mathematical reals and integers.
This package and its subpackages provide the "public interface" to SARL.
The number package supports infinite-precision integer and rational
numbers.
Interfaces for the simplification of symbolic expressions.
-
Uses of IntegerNumber in dev.civl.sarl.ideal.IF
Methods in dev.civl.sarl.ideal.IF that return IntegerNumberModifier and TypeMethodDescriptionIdealFactory.getConcreteExponent(RationalExpression exponent) Given the exponent in a potential power expression, this method computes a concrete integer that can be factored out of that exponent so that the exponent is in canonical form.Monomial.maxDegreeOf(NumberFactory factory, Primitive primitive) Computes the maximum degree to whichprimitiveoccurs in thisMonomial.Monomial.monomialDegree(NumberFactory factory) Returns the degree of the monic where each factor is considered to have degree 1.Polynomial.polynomialDegree(NumberFactory factory) The "polynomial degree" is the maximum monomial degree of the terms comprising this polynomial.Monomial.totalDegree(NumberFactory factory) The degree of this monomial if it were fully expanded to a polynomial in which the variables cannot be expressed as the sum, product, difference, or quotient of expressions.Methods in dev.civl.sarl.ideal.IF with parameters of type IntegerNumberModifier and TypeMethodDescriptionConstant.powerInt(IdealFactory factory, IntegerNumber exponent) Monic.powerInt(IdealFactory factory, IntegerNumber exponent) Monomial.powerInt(IdealFactory factory, IntegerNumber exponent) PrimitivePower.powerInt(IdealFactory factory, IntegerNumber exponent) RationalExpression.powerInt(IdealFactory factory, IntegerNumber exponent) Computes an expression equivalent to raising this expression to theexponentpower. -
Uses of IntegerNumber in dev.civl.sarl.IF
Fields in dev.civl.sarl.IF declared as IntegerNumberModifier and TypeFieldDescriptionstatic IntegerNumberSARLConstants.polyProbThresholdUsed in a heuristic to determine when to use probabilistic methods to determine polynomial zero-ness.Methods in dev.civl.sarl.IF with parameters of type IntegerNumberModifier and TypeMethodDescriptionCoreUniverse.power(NumericExpression base, IntegerNumber exponent) Concrete power operator: eb, where b is a concrete non-negativeIntegerNumber. -
Uses of IntegerNumber in dev.civl.sarl.IF.number
Methods in dev.civl.sarl.IF.number that return IntegerNumberModifier and TypeMethodDescriptionNumberFactory.add(IntegerNumber arg0, IntegerNumber arg1) Adds two integer numbers and returns the result.NumberFactory.ceil(RationalNumber arg0) Returns the least integer greater than or equal to the given rational number.NumberFactory.decrement(IntegerNumber arg) arg - 1NumberFactory.denominator(RationalNumber arg0) Returns the denominator in a representation of the rational number as the quotient of two integers.NumberFactory.divide(IntegerNumber arg0, IntegerNumber arg1) Divides two integer numbers and returns the result.NumberFactory.floor(RationalNumber arg0) Returns the greatest integer less than or equal to the given rational number.NumberFactory.gcd(IntegerNumber arg0, IntegerNumber arg1) Returns the greatest common divisor of two integers.NumberFactory.increment(IntegerNumber arg) add(arg, 1)NumberFactory.infiniteInteger(boolean isPositiveInfinity) Returns an infiniteIntegerNumber, its signum is determined by the given boolean value.NumberFactory.integer(int value) Returns an integer number corresponding to the given Java int.NumberFactory.integer(long value) Returns the IntegerNumber with value specified by the long.Returns the integer number specified by the given string.NumberFactory.integer(BigInteger big) Returns the IntegerNumber with value specified by the BigInteger.NumberFactory.integerValue(RationalNumber arg0) Returns the value of the rational number as an integer number.NumberFactory.lcm(IntegerNumber arg0, IntegerNumber arg1) Returns the least common multiple of the two positive integers.NumberFactory.mod(IntegerNumber arg0, IntegerNumber arg1) Modulo operations.NumberFactory.multiply(IntegerNumber arg0, IntegerNumber arg1) Multiplies two integer numbers and returns the result.NumberFactory.negate(IntegerNumber arg0) Returns the negation of the given integer number, i.e., -x.NumberFactory.negativeInfinityInteger()Return aIntegerNumberrepresenting the negative infinity.NumberFactory.nthRootInt(IntegerNumber number, IntegerNumber n) Calculate the nth root of the given number and n.NumberFactory.numerator(RationalNumber arg0) Returns the numerator in a representation of the rational number as the quotient of two integers.NumberFactory.oneInteger()The integer number zero.NumberFactory.positiveInfinityInteger()Return aIntegerNumberrepresenting the positive infinity.NumberFactory.power(IntegerNumber number, int exp) Calculate the given integer number powering a given exponent and returns result.NumberFactory.power(IntegerNumber number, IntegerNumber exp) Calculate the givenIntegerNumberbase powering a givenIntegerNumberexponent and returns result.NumberFactory.subtract(IntegerNumber arg0, IntegerNumber arg1) Subtracts two integer numbers and returns the result.NumberFactory.zeroInteger()The integer number zero.Methods in dev.civl.sarl.IF.number with parameters of type IntegerNumberModifier and TypeMethodDescriptionNumberFactory.add(IntegerNumber arg0, IntegerNumber arg1) Adds two integer numbers and returns the result.intNumberFactory.compare(IntegerNumber arg0, IntegerNumber arg1) Returns a positive value if arg0 is greater than arg1, 0 if arg0 equals arg1, -1 if arg0 is less than arg1.NumberFactory.decrement(IntegerNumber arg) arg - 1NumberFactory.divide(IntegerNumber arg0, IntegerNumber arg1) Divides two integer numbers and returns the result.NumberFactory.fraction(IntegerNumber numerator, IntegerNumber denominator) Returns the rational number which is the quotient of the two integers.NumberFactory.gcd(IntegerNumber arg0, IntegerNumber arg1) Returns the greatest common divisor of two integers.NumberFactory.increment(IntegerNumber arg) add(arg, 1)NumberFactory.integerToRational(IntegerNumber integer) Casts an integer to a rational number.NumberFactory.lcm(IntegerNumber arg0, IntegerNumber arg1) Returns the least common multiple of the two positive integers.NumberFactory.mod(IntegerNumber arg0, IntegerNumber arg1) Modulo operations.NumberFactory.multiply(IntegerNumber arg0, IntegerNumber arg1) Multiplies two integer numbers and returns the result.NumberFactory.negate(IntegerNumber arg0) Returns the negation of the given integer number, i.e., -x.NumberFactory.nthRootInt(IntegerNumber number, IntegerNumber n) Calculate the nth root of the given number and n.NumberFactory.power(IntegerNumber number, int exp) Calculate the given integer number powering a given exponent and returns result.NumberFactory.power(IntegerNumber number, IntegerNumber exp) Calculate the givenIntegerNumberbase powering a givenIntegerNumberexponent and returns result.NumberFactory.power(Interval interval, IntegerNumber expr) To calculate the power-result of a given non-nulland not emptyIntervalwith a given non-nullnon-negativeIntegerNumber.NumberFactory.power(Number number, IntegerNumber exp) Calculate the givenNumberbase powering a givenIntegerNumberexponent and returns result.NumberFactory.power(RationalNumber number, IntegerNumber exp) Calculate the givenRationalNumberbase powering a givenIntegerNumberexponent and returns result.NumberFactory.subtract(IntegerNumber arg0, IntegerNumber arg1) Subtracts two integer numbers and returns the result. -
Uses of IntegerNumber in dev.civl.sarl.simplify.IF
Methods in dev.civl.sarl.simplify.IF with parameters of type IntegerNumber