- abs() - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is the absolute value
of this BigDecimal
, and whose scale is
this.scale()
.
- abs(MathContext) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is the absolute value
of this BigDecimal
, with rounding according to the
context settings.
- abs() - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is the absolute value of this
BigInteger.
- abs(BigInteger) - Static method in class cc.redberry.rings.bigint.BigIntegerUtil
-
- abs(I) - Method in class cc.redberry.rings.ImageRing
-
- abs(BigInteger) - Method in class cc.redberry.rings.Integers
-
- abs() - Method in class cc.redberry.rings.Rational
-
Returns the absolute value of this
Rational
.
- abs(E) - Method in interface cc.redberry.rings.Ring
-
Returns the abs value of element (no copy)
- accumulator() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial.PolynomialCollector
-
- accumulator() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial.PolynomialCollector
-
- aCoFactorMod() - Method in class cc.redberry.rings.poly.univar.HenselLifting.bLinearLift
-
- aCoFactorMod() - Method in interface cc.redberry.rings.poly.univar.HenselLifting.LiftableQuintet
-
Returns first co-factor lifted
- aCoFactorMod() - Method in class cc.redberry.rings.poly.univar.HenselLifting.lLinearLift
-
- add(E, E) - Method in class cc.redberry.rings.AQuotientRing
-
- add(BigDecimal) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is (this +
augend)
, and whose scale is max(this.scale(),
augend.scale())
.
- add(BigDecimal, MathContext) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is (this + augend)
,
with rounding according to the context settings.
- add(BigInteger) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is (this + val)
.
- add(I, I) - Method in class cc.redberry.rings.ImageRing
-
- add(I...) - Method in class cc.redberry.rings.ImageRing
-
- add(BigInteger, BigInteger) - Method in class cc.redberry.rings.Integers
-
- add(BigInteger, BigInteger) - Method in class cc.redberry.rings.IntegersZp
-
- add(long, long) - Method in class cc.redberry.rings.IntegersZp64
-
Add mod operation
- add(Poly, Poly) - Method in class cc.redberry.rings.poly.FiniteField
-
- add(Poly) - Method in interface cc.redberry.rings.poly.IPolynomial
-
Adds oth
to this
.
- add(Poly...) - Method in interface cc.redberry.rings.poly.IPolynomial
-
Adds oth
to this
.
- add(Poly) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
- add(Term) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Adds monomial
to this polynomial
- add(Iterable<Term>) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Adds monomials to this polynomial
- add(Term...) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Adds monomials to this polynomial
- add(Term) - Method in class cc.redberry.rings.poly.multivar.MonomialSet
-
Add monomial to this set
- add(E) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Adds oth
to this polynomial
- add(long) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Adds oth
to this polynomial and returns it
- add(E) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Add constant to this.
- add(UnivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- add(E) - Method in class cc.redberry.rings.Rational
-
Add other
to this
- add(long) - Method in class cc.redberry.rings.Rational
-
Add other
to this
- add(Rational<E>) - Method in class cc.redberry.rings.Rational
-
Add other
to this
- add(Rational<E>, Rational<E>) - Method in class cc.redberry.rings.Rationals
-
- add(E, E) - Method in interface cc.redberry.rings.Ring
-
Add two elements
- add(E...) - Method in interface cc.redberry.rings.Ring
-
Total of the array of elements
- add(Poly) - Method in class cc.redberry.rings.util.ListWrapper
-
- add(int, Poly) - Method in class cc.redberry.rings.util.ListWrapper
-
- addAll(FactorDecomposition<E>) - Method in class cc.redberry.rings.FactorDecomposition
-
add all factors from other
- addAll(FactorDecomposition<Poly>) - Method in class cc.redberry.rings.poly.PolynomialFactorDecomposition
-
- addAll(int[], int...) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- addAll(long[], long...) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- addAll(int[]...) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- addAll(T[], T...) - Static method in class cc.redberry.rings.util.ArraysUtil
-
This code is taken from Apache Commons Lang ArrayUtils.
- addAll(Collection<? extends Poly>) - Method in class cc.redberry.rings.util.ListWrapper
-
- addAll(int, Collection<? extends Poly>) - Method in class cc.redberry.rings.util.ListWrapper
-
- addFactor(E, int) - Method in class cc.redberry.rings.FactorDecomposition
-
add another factor
- addFactor(Poly, int) - Method in class cc.redberry.rings.poly.PolynomialFactorDecomposition
-
- addMonomial(E, int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Adds coefficient*x^exponent
to this
- addMul(UnivariatePolynomial<E>, E) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Adds oth * factor
to this
- addMutable(Poly, Poly) - Method in class cc.redberry.rings.poly.FiniteField
-
- addMutable(E, E) - Method in interface cc.redberry.rings.Ring
-
Adds two elements and destroys the initial content of a
.
- addUnit(E) - Method in class cc.redberry.rings.FactorDecomposition
-
add another unit factor
- addUnit(E, int) - Method in class cc.redberry.rings.FactorDecomposition
-
add another unit factor
- addUnit(Poly) - Method in class cc.redberry.rings.poly.PolynomialFactorDecomposition
-
- advance() - Method in class cc.redberry.rings.poly.multivar.PairedIterator
-
- aFactorMod() - Method in class cc.redberry.rings.poly.univar.HenselLifting.bLinearLift
-
- aFactorMod() - Method in interface cc.redberry.rings.poly.univar.HenselLifting.LiftableQuintet
-
Returns first factor lifted
- aFactorMod() - Method in class cc.redberry.rings.poly.univar.HenselLifting.lLinearLift
-
- ALEX - Static variable in class cc.redberry.rings.poly.multivar.MonomialOrder
-
Antilexicographic monomial order.
- AMonomial<Term extends AMonomial<Term>> - Class in cc.redberry.rings.poly.multivar
-
Abstract monomial (degree vector + coefficient).
- AMonomial(int[], int) - Constructor for class cc.redberry.rings.poly.multivar.AMonomial
-
- AMonomial(int[]) - Constructor for class cc.redberry.rings.poly.multivar.AMonomial
-
- AMonomial(DegreeVector) - Constructor for class cc.redberry.rings.poly.multivar.AMonomial
-
- AMultivariatePolynomial<Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> - Class in cc.redberry.rings.poly.multivar
-
Parent class for multivariate polynomials.
- AMultivariatePolynomial.PolynomialCollector<Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> - Class in cc.redberry.rings.poly.multivar
-
Collector which collects stream of element to a UnivariatePolynomial
- and(BigInteger) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is (this & val)
.
- andNot(BigInteger) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is (this & ~val)
.
- apply(Function<E, E>) - Method in class cc.redberry.rings.FactorDecomposition
-
- applyExponents(Ring<E>) - Method in class cc.redberry.rings.FactorDecomposition
-
Raise all factors to its corresponding exponents
- AQuotientRing<E> - Class in cc.redberry.rings
-
Parent class for quotient rings
- AQuotientRing(Ring<E>) - Constructor for class cc.redberry.rings.AQuotientRing
-
- ARing<E> - Class in cc.redberry.rings
-
Abstract ring which holds perfect power decomposition of its cardinality.
- ARing() - Constructor for class cc.redberry.rings.ARing
-
- arrayOf(int, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- arrayOf(long, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- arrayOf(char, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- arrayOf(T, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- ArraysUtil - Class in cc.redberry.rings.util
-
This class contains additional methods for manipulating arrays (such as sorting and searching).
- ascendingIterator() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
- ascendingIterator() - Method in class cc.redberry.rings.poly.multivar.MonomialSet
-
- asGenericRing() - Method in class cc.redberry.rings.IntegersZp64
-
Converts this to a generic ring over big integers
- asMachineRing() - Method in class cc.redberry.rings.IntegersZp
-
- asMultivariate(IUnivariatePolynomial, int, int, Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Converts univariate polynomial to multivariate.
- asMultivariate(UnivariatePolynomial<Poly>, int, boolean) - Static method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
- asMultivariate(UnivariatePolynomial<Poly>, int) - Static method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Convert univariate polynomial over multivariate polynomials to a normal multivariate poly
- asMultivariate(UnivariatePolynomial<E>, int, int, Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Converts univariate polynomial to multivariate.
- asMultivariate(UnivariatePolynomialZp64, int, int, Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Converts univariate polynomial to multivariate.
- asNormalMultivariate(MultivariatePolynomial<UnivariatePolynomial<E>>, int) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Converts multivariate polynomial over univariate polynomial ring (R[variable][other_variables]) to a multivariate
polynomial over coefficient ring (R[variables])
- asNormalMultivariate(MultivariatePolynomial<MultivariatePolynomial<E>>) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Converts multivariate polynomial over multivariate polynomial ring to a multivariate polynomial over coefficient
ring
- asNormalMultivariate(MultivariatePolynomial<MultivariatePolynomial<E>>, int[], int[]) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Converts multivariate polynomial over multivariate polynomial ring to a multivariate polynomial over coefficient
ring
- asNormalMultivariate(MultivariatePolynomial<UnivariatePolynomialZp64>, int) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Converts multivariate polynomial over univariate polynomial ring (Zp[variable][other_variables]) to a
multivariate polynomial over coefficient ring (Zp[all_variables])
- asNormalMultivariate(MultivariatePolynomial<MultivariatePolynomialZp64>) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Converts multivariate polynomial over multivariate polynomial ring to a multivariate polynomial over coefficient
ring
- asNormalMultivariate(MultivariatePolynomial<MultivariatePolynomialZp64>, int[], int[]) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Converts multivariate polynomial over multivariate polynomial ring to a multivariate polynomial over coefficient
ring
- asOverMultivariate(int...) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Converts this to a multivariate polynomial with coefficients being multivariate polynomials polynomials over
variables
that is polynomial in R[variables][other_variables]
- asOverMultivariate(int...) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- asOverMultivariate(int...) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- asOverMultivariateEliminate(int...) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Converts this to a multivariate polynomial with coefficients being multivariate polynomials polynomials over
variables
that is polynomial in R[variables][other_variables]
- asOverMultivariateEliminate(int[], Comparator<DegreeVector>) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Converts this to a multivariate polynomial with coefficients being multivariate polynomials polynomials over
variables
that is polynomial in R[variables][other_variables]
- asOverMultivariateEliminate(int[], Comparator<DegreeVector>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- asOverMultivariateEliminate(int[], Comparator<DegreeVector>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- asOverRationals(Ring<Rational<E>>, UnivariatePolynomial<E>) - Static method in class cc.redberry.rings.poly.Util
-
- asOverRationals(Ring<Rational<E>>, MultivariatePolynomial<E>) - Static method in class cc.redberry.rings.poly.Util
-
- asOverUnivariate(int) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Converts this to a multivariate polynomial with coefficients being univariate polynomials over variable
- asOverUnivariate(int) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- asOverUnivariate(int) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- asOverUnivariateEliminate(int) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Converts this to a multivariate polynomial with coefficients being univariate polynomials over variable
,
the resulting polynomial have (nVariable - 1) multivariate variables (specified variable
is eliminated)
- asOverUnivariateEliminate(int) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- asOverUnivariateEliminate(int) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- asOverZ64(UnivariatePolynomial<BigInteger>) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Converts poly over BigIntegers to machine-sized polynomial in Z
- asOverZp64(MultivariatePolynomial<BigInteger>) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Converts multivariate polynomial over BigIntegers to multivariate polynomial over machine modular integers
- asOverZp64(UnivariatePolynomial<BigInteger>) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Converts Zp[x] poly over BigIntegers to machine-sized polynomial in Zp
- asPolyZ(MultivariatePolynomial<BigInteger>, boolean) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Returns Z[X] polynomial formed from the coefficients of the poly.
- asPolyZ() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Returns polynomial over Z formed from the coefficients of this
- asPolyZ(boolean) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
Returns Z[x] polynomial formed from the coefficients of this.
- asPolyZSymmetric(MultivariatePolynomial<BigInteger>) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Converts Zp[x] polynomial to Z[x] polynomial formed from the coefficients of this represented in symmetric
modular form (-modulus/2 <= cfx <= modulus/2
).
- asPolyZSymmetric() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Returns polynomial over Z formed from the coefficients of this represented in symmetric modular form (-modulus/2 <= cfx <= modulus/2
).
- asPolyZSymmetric(UnivariatePolynomial<BigInteger>) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Converts Zp[x] polynomial to Z[x] polynomial formed from the coefficients of this represented in symmetric
modular form (-modulus/2 <= cfx <= modulus/2
).
- asPolyZSymmetric() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
Returns Z[x] polynomial formed from the coefficients of this represented in symmetric modular form (-modulus/2 <= cfx <= modulus/2
).
- assertSameCoefficientRingWith(Poly) - Method in interface cc.redberry.rings.poly.IPolynomial
-
Checks whether oth
and this
have the same coefficient ring, if not exception will be thrown
- asUnivariate() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Converts this to univariate polynomial or throws exception if conversion is impossible (more than one variable
have non zero exponents)
- asUnivariate(int) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Converts this polynomial to a univariate polynomial over specified variable with the multivariate coefficient
ring.
- asUnivariate(Poly, int) - Static method in class cc.redberry.rings.poly.multivar.MultivariateConversions
-
Given poly in R[x1,x2,...,xN] converts to poly in R[other_variables][variable]
- asUnivariate(IPolynomialRing<Poly>, int) - Static method in class cc.redberry.rings.poly.multivar.MultivariateConversions
-
Given poly in R[x1,x2,...,xN] converts to poly in R[other_variables][variable]
- asUnivariate() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- asUnivariate() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- asUnivariateEliminate(int) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Converts this polynomial to a univariate polynomial over specified variable with the multivariate coefficient
ring.
- asZp64() - Method in class cc.redberry.rings.IntegersZp
-
Returns machine integer ring or null if modulus is larger than long
- aTerm - Variable in class cc.redberry.rings.poly.multivar.PairedIterator
-
- b_MAX_SUPPORTED_MODULUS - Static variable in class cc.redberry.rings.poly.MachineArithmetic
-
Max supported modulus
- base - Variable in class cc.redberry.rings.poly.univar.HenselLifting.bQuadraticLift
-
Initial Z[x] poly
- base - Variable in class cc.redberry.rings.poly.univar.HenselLifting.lQuadraticLift
-
Initial Z[x] poly
- baseRing - Variable in class cc.redberry.rings.AQuotientRing
-
the base ring
- bCoFactorMod() - Method in class cc.redberry.rings.poly.univar.HenselLifting.bLinearLift
-
- bCoFactorMod() - Method in interface cc.redberry.rings.poly.univar.HenselLifting.LiftableQuintet
-
Returns second co-factor lifted
- bCoFactorMod() - Method in class cc.redberry.rings.poly.univar.HenselLifting.lLinearLift
-
- bFactorMod() - Method in class cc.redberry.rings.poly.univar.HenselLifting.bLinearLift
-
- bFactorMod() - Method in interface cc.redberry.rings.poly.univar.HenselLifting.LiftableQuintet
-
Returns second factor lifted
- bFactorMod() - Method in class cc.redberry.rings.poly.univar.HenselLifting.lLinearLift
-
- BigDecimal - Class in cc.redberry.rings.bigint
-
Immutable, arbitrary-precision signed decimal numbers.
- BigDecimal(char[], int, int) - Constructor for class cc.redberry.rings.bigint.BigDecimal
-
Translates a character array representation of a
BigDecimal
into a
BigDecimal
, accepting the
same sequence of characters as the
BigDecimal.BigDecimal(String)
constructor, while allowing a sub-array to be specified.
- BigDecimal(char[], int, int, MathContext) - Constructor for class cc.redberry.rings.bigint.BigDecimal
-
Translates a character array representation of a
BigDecimal
into a
BigDecimal
, accepting the
same sequence of characters as the
BigDecimal.BigDecimal(String)
constructor, while allowing a sub-array to be specified and
with rounding according to the context settings.
- BigDecimal(char[]) - Constructor for class cc.redberry.rings.bigint.BigDecimal
-
Translates a character array representation of a
BigDecimal
into a
BigDecimal
, accepting the
same sequence of characters as the
BigDecimal.BigDecimal(String)
constructor.
- BigDecimal(char[], MathContext) - Constructor for class cc.redberry.rings.bigint.BigDecimal
-
Translates a character array representation of a
BigDecimal
into a
BigDecimal
, accepting the
same sequence of characters as the
BigDecimal.BigDecimal(String)
constructor and with rounding according to the context
settings.
- BigDecimal(String) - Constructor for class cc.redberry.rings.bigint.BigDecimal
-
Translates the string representation of a BigDecimal
into a BigDecimal
.
- BigDecimal(String, MathContext) - Constructor for class cc.redberry.rings.bigint.BigDecimal
-
Translates the string representation of a
BigDecimal
into a
BigDecimal
, accepting the same strings as the
BigDecimal.BigDecimal(String)
constructor, with rounding
according to the context settings.
- BigDecimal(double) - Constructor for class cc.redberry.rings.bigint.BigDecimal
-
Translates a double
into a BigDecimal
which
is the exact decimal representation of the double
's
binary floating-point value.
- BigDecimal(double, MathContext) - Constructor for class cc.redberry.rings.bigint.BigDecimal
-
Translates a double
into a BigDecimal
, with
rounding according to the context settings.
- BigDecimal(BigInteger) - Constructor for class cc.redberry.rings.bigint.BigDecimal
-
Translates a BigInteger
into a BigDecimal
.
- BigDecimal(BigInteger, MathContext) - Constructor for class cc.redberry.rings.bigint.BigDecimal
-
Translates a BigInteger
into a BigDecimal
rounding according to the context settings.
- BigDecimal(BigInteger, int) - Constructor for class cc.redberry.rings.bigint.BigDecimal
-
Translates a BigInteger
unscaled value and an
int
scale into a BigDecimal
.
- BigDecimal(BigInteger, int, MathContext) - Constructor for class cc.redberry.rings.bigint.BigDecimal
-
Translates a BigInteger
unscaled value and an
int
scale into a BigDecimal
, with rounding
according to the context settings.
- BigDecimal(int) - Constructor for class cc.redberry.rings.bigint.BigDecimal
-
Translates an int
into a BigDecimal
.
- BigDecimal(int, MathContext) - Constructor for class cc.redberry.rings.bigint.BigDecimal
-
Translates an int
into a BigDecimal
, with
rounding according to the context settings.
- BigDecimal(long) - Constructor for class cc.redberry.rings.bigint.BigDecimal
-
Translates a long
into a BigDecimal
.
- BigDecimal(long, MathContext) - Constructor for class cc.redberry.rings.bigint.BigDecimal
-
Translates a long
into a BigDecimal
, with
rounding according to the context settings.
- BigInteger - Class in cc.redberry.rings.bigint
-
Immutable arbitrary-precision integers.
- BigInteger(BigInteger) - Constructor for class cc.redberry.rings.bigint.BigInteger
-
- BigInteger(byte[]) - Constructor for class cc.redberry.rings.bigint.BigInteger
-
Translates a byte array containing the two's-complement binary
representation of a BigInteger into a BigInteger.
- BigInteger(int, byte[]) - Constructor for class cc.redberry.rings.bigint.BigInteger
-
Translates the sign-magnitude representation of a BigInteger into a
BigInteger.
- BigInteger(String, int) - Constructor for class cc.redberry.rings.bigint.BigInteger
-
Translates the String representation of a BigInteger in the
specified radix into a BigInteger.
- BigInteger(String) - Constructor for class cc.redberry.rings.bigint.BigInteger
-
Translates the decimal String representation of a BigInteger into a
BigInteger.
- BigInteger(int, Random) - Constructor for class cc.redberry.rings.bigint.BigInteger
-
Constructs a randomly generated BigInteger, uniformly distributed over
the range 0 to (2numBits
- 1), inclusive.
- BigInteger(int, RandomGenerator) - Constructor for class cc.redberry.rings.bigint.BigInteger
-
Constructs a randomly generated BigInteger, uniformly distributed over
the range 0 to (2numBits
- 1), inclusive.
- BigInteger(int, int, Random) - Constructor for class cc.redberry.rings.bigint.BigInteger
-
Constructs a randomly generated positive BigInteger that is probably
prime, with the specified bitLength.
- BigIntegerUtil - Class in cc.redberry.rings.bigint
-
- BigPrimes - Class in cc.redberry.rings.primes
-
Prime factorization of BigIntegers
- bijection(T[], T[], Comparator<? super T>) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- bijection(T[], T[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Creates a bijective mapping between two arrays and returns the resulting bijection as array.
- binarySearch1(int[], int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- binarySearch1(int[], int, int, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- binomial(int, int) - Static method in class cc.redberry.rings.bigint.BigIntegerUtil
-
Binomial coefficient
- bitCount() - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns the number of bits in the two's complement representation
of this BigInteger that differ from its sign bit.
- bitLength() - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns the number of bits in the minimal two's-complement
representation of this BigInteger, excluding a sign bit.
- bivariateLiftNoLCCorrection0(Poly, Poly[], HenselLifting.IEvaluation<Term, Poly>, int) - Static method in class cc.redberry.rings.poly.multivar.HenselLifting
-
Fast bivariate Hensel lifting which uses dense representation for bivariate polynomials
- boundedTrialDivision(int, int, TIntArrayList) - Static method in class cc.redberry.rings.primes.SmallPrimes
-
Extract factors in the range PRIME_LAST+2
to maxFactors
.
- bQuadraticLift(BigInteger, UnivariatePolynomial<BigInteger>, UnivariatePolynomial<BigInteger>, UnivariatePolynomial<BigInteger>, UnivariatePolynomial<BigInteger>, UnivariatePolynomial<BigInteger>) - Constructor for class cc.redberry.rings.poly.univar.HenselLifting.bQuadraticLift
-
- BrownGCD(MultivariatePolynomial<E>, MultivariatePolynomial<E>) - Static method in class cc.redberry.rings.poly.multivar.MultivariateGCD
-
Calculates GCD of two multivariate polynomials over Zp using Brown's algorithm with dense interpolation.
- BrownGCD(MultivariatePolynomialZp64, MultivariatePolynomialZp64) - Static method in class cc.redberry.rings.poly.multivar.MultivariateGCD
-
Calculates GCD of two multivariate polynomials over Zp using Brown's algorithm with dense interpolation.
- bTerm - Variable in class cc.redberry.rings.poly.multivar.PairedIterator
-
- BuchbergerGB(List<Poly>, Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
Computes minimized and reduced Groebner basis of a given ideal via Buchberger algorithm.
- BuchbergerGB(List<Poly>, Comparator<DegreeVector>, Comparator<GroebnerBasis.SyzygyPair>) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
Computes minimized and reduced Groebner basis of a given ideal via Buchberger algorithm.
- byte2int(byte[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- byte2short(byte[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- byteValueExact() - Method in class cc.redberry.rings.bigint.BigDecimal
-
Converts this BigDecimal
to a byte
, checking
for lost information.
- byteValueExact() - Method in class cc.redberry.rings.bigint.BigInteger
-
Converts this BigInteger
to a byte
, checking
for lost information.
- canConvertToZp64(IPolynomial) - Static method in class cc.redberry.rings.poly.Util
-
Test whether poly is over Zp with modulus less then 2^63
- canonical() - Method in class cc.redberry.rings.FactorDecomposition
-
Sort factors.
- canonical() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Makes this poly monic if coefficient ring is field, otherwise makes this primitive
- canonical() - Method in class cc.redberry.rings.poly.PolynomialFactorDecomposition
-
- CantorZassenhaus(Poly, int) - Static method in class cc.redberry.rings.poly.univar.EqualDegreeFactorization
-
Plain Cantor-Zassenhaus algorithm implementation
- cardinality() - Method in class cc.redberry.rings.AQuotientRing
-
- cardinality() - Method in class cc.redberry.rings.ImageRing
-
- cardinality() - Method in class cc.redberry.rings.Integers
-
- cardinality() - Method in class cc.redberry.rings.IntegersZp
-
- cardinality() - Method in class cc.redberry.rings.poly.FiniteField
-
- cardinality() - Method in class cc.redberry.rings.Rationals
-
- cardinality() - Method in interface cc.redberry.rings.Ring
-
Returns the number of elements in this ring (cardinality) or null if ring is infinite
- cc() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Returns the constant coefficient of this polynomial.
- cc() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Returns the constant coefficient of this polynomial.
- cc() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Returns the constant coefficient
- cc.redberry.rings - package cc.redberry.rings
-
- cc.redberry.rings.bigint - package cc.redberry.rings.bigint
-
Provides classes for performing arbitrary-precision integer
arithmetic (BigInteger
) and arbitrary-precision decimal
arithmetic (BigDecimal
).
- cc.redberry.rings.linear - package cc.redberry.rings.linear
-
- cc.redberry.rings.poly - package cc.redberry.rings.poly
-
- cc.redberry.rings.poly.multivar - package cc.redberry.rings.poly.multivar
-
- cc.redberry.rings.poly.univar - package cc.redberry.rings.poly.univar
-
- cc.redberry.rings.primes - package cc.redberry.rings.primes
-
- cc.redberry.rings.util - package cc.redberry.rings.util
-
- ccAsPoly() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Returns the constant coefficient as a constant poly
- ccAsPoly() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- ccAsPoly() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- ccAsPoly() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- changeOrder(Comparator<DegreeVector>) - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Set the monomial order used for Groebner basis of this ideal
- characteristic() - Method in class cc.redberry.rings.AQuotientRing
-
- characteristic() - Method in class cc.redberry.rings.ImageRing
-
- characteristic() - Method in class cc.redberry.rings.Integers
-
- characteristic() - Method in class cc.redberry.rings.IntegersZp
-
- characteristic() - Method in class cc.redberry.rings.poly.FiniteField
-
- characteristic() - Method in class cc.redberry.rings.Rationals
-
- characteristic() - Method in interface cc.redberry.rings.Ring
-
Returns characteristic of this ring
- characteristics() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial.PolynomialCollector
-
- characteristics() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial.PolynomialCollector
-
- ChineseRemainders - Class in cc.redberry.rings
-
- ChineseRemainders(long, long, long, long) - Static method in class cc.redberry.rings.ChineseRemainders
-
Runs Chinese Remainders algorithm
- ChineseRemainders(BigInteger, BigInteger, BigInteger, BigInteger) - Static method in class cc.redberry.rings.ChineseRemainders
-
Runs Chinese Remainders algorithm
- ChineseRemainders(Ring<E>, E, E, E, E) - Static method in class cc.redberry.rings.ChineseRemainders
-
Runs Chinese Remainders algorithm
- ChineseRemainders(ChineseRemainders.ChineseRemaindersMagic, long, long) - Static method in class cc.redberry.rings.ChineseRemainders
-
Runs Chinese Remainders algorithm
- ChineseRemainders(long[], long[]) - Static method in class cc.redberry.rings.ChineseRemainders
-
Runs Chinese Remainders algorithm
- ChineseRemainders(BigInteger[], BigInteger[]) - Static method in class cc.redberry.rings.ChineseRemainders
-
Runs Chinese Remainders algorithm
- ChineseRemainders(Ring<E>, E[], E[]) - Static method in class cc.redberry.rings.ChineseRemainders
-
Runs Chinese Remainders algorithm
- ChineseRemainders.ChineseRemaindersMagic - Class in cc.redberry.rings
-
- clear() - Method in class cc.redberry.rings.util.ListWrapper
-
- clearBit(int) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is equivalent to this BigInteger
with the designated bit cleared.
- clone() - Method in class cc.redberry.rings.FactorDecomposition
-
- clone() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Deep copy of this
- clone() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
- clone() - Method in class cc.redberry.rings.poly.multivar.MonomialSet
-
- clone() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- clone() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial.PrecomputedPowersHolder
-
- clone() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- clone() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64.lPrecomputedPowersHolder
-
- clone() - Method in class cc.redberry.rings.poly.PolynomialFactorDecomposition
-
- clone() - Method in interface cc.redberry.rings.poly.univar.IUnivariatePolynomial
-
- clone() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- clone() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- clone() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- coefficient - Variable in class cc.redberry.rings.poly.multivar.Monomial
-
the coefficient
- coefficient - Variable in class cc.redberry.rings.poly.multivar.MonomialZp64
-
the coefficient
- coefficientOf(int, int) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns a coefficient before variable^exponent
as a multivariate polynomial
- coefficientOf(int[], int[]) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns a coefficient before variables^exponents
as a multivariate polynomial
- coefficientRingCardinality() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Returns cardinality of the coefficient ring of this poly
- coefficientRingCardinality() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- coefficientRingCardinality() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- coefficientRingCardinality() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- coefficientRingCardinality() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- coefficientRingCardinality() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- coefficientRingCharacteristic() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Returns characteristic of the coefficient ring of this poly
- coefficientRingCharacteristic() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- coefficientRingCharacteristic() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- coefficientRingCharacteristic() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- coefficientRingCharacteristic() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- coefficientRingCharacteristic() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- coefficientRingPerfectPowerBase() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Returns base
so that coefficientRingCardinality() == base^exponent
or null if cardinality is not
finite
- coefficientRingPerfectPowerBase() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- coefficientRingPerfectPowerBase() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- coefficientRingPerfectPowerBase() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- coefficientRingPerfectPowerBase() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- coefficientRingPerfectPowerBase() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- coefficientRingPerfectPowerExponent() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Returns exponent
so that coefficientRingCardinality() == base^exponent
or null if cardinality is
not finite
- coefficientRingPerfectPowerExponent() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- coefficientRingPerfectPowerExponent() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- coefficientRingPerfectPowerExponent() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- coefficientRingPerfectPowerExponent() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- coefficientRingPerfectPowerExponent() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- coefficientRingToString() - Method in interface cc.redberry.rings.poly.IPolynomial
-
String representation of the coefficient ring of this
- coefficientRingToString() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- coefficientRingToString() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- coefficientRingToString() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- coefficientRingToString() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- coefficientRingToString() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- coefficients() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Returns iterable over polynomial coefficients
- coefficients() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Returns array of polynomial coefficients
- coefficientsArray() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Returns array of polynomial coefficients
- collection() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
- collection() - Method in class cc.redberry.rings.poly.multivar.MonomialSet
-
- combiner() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial.PolynomialCollector
-
- combiner() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial.PolynomialCollector
-
- commutativeHashCode(T[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Returns commutative hash code of the data
- commutativeHashCode(T[], int, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Returns commutative hash code of the data
- commutativeHashCode(int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Returns commutative hash code of the data
- commutativeHashCode(int[], int, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Returns commutative hash code of the data
- COMPARATOR - Static variable in class cc.redberry.rings.util.ArraysUtil
-
Lexicographic order
- COMPARATOR_GENERIC - Static variable in class cc.redberry.rings.util.ArraysUtil
-
Lexicographic order
- COMPARATOR_LONG - Static variable in class cc.redberry.rings.util.ArraysUtil
-
Lexicographic order
- compare(E, E) - Method in class cc.redberry.rings.AQuotientRing
-
- compare(I, I) - Method in class cc.redberry.rings.ImageRing
-
- compare(Poly, Poly) - Method in class cc.redberry.rings.poly.FiniteField
-
- compare(DegreeVector, DegreeVector) - Method in class cc.redberry.rings.poly.multivar.MonomialOrder.GrevLexWithPermutation
-
- compare(Rational<E>, Rational<E>) - Method in class cc.redberry.rings.Rationals
-
- compare(int, int) - Method in interface cc.redberry.rings.util.IntComparator
-
- compareTo(BigDecimal) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Compares this BigDecimal
with the specified
BigDecimal
.
- compareTo(BigInteger) - Method in class cc.redberry.rings.bigint.BigInteger
-
Compares this BigInteger with the specified BigInteger.
- compareTo(MultivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- compareTo(MultivariatePolynomialZp64) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- compareTo(UnivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- compareTo(Rational<E>) - Method in class cc.redberry.rings.Rational
-
- composition(Poly) - Method in interface cc.redberry.rings.poly.univar.IUnivariatePolynomial
-
Calculates the composition of this(oth) (new instance, so the content of this is not changed))
- composition(T, T, T, UnivariateDivision.InverseModMonomial<T>) - Static method in class cc.redberry.rings.poly.univar.ModularComposition
-
Returns modular composition poly(point) mod polyModulus
.
- composition(T, T, T) - Static method in class cc.redberry.rings.poly.univar.ModularComposition
-
Returns modular composition poly(point) mod polyModulus
.
- composition(UnivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- compositionBrentKung(T, ArrayList<T>, T, UnivariateDivision.InverseModMonomial<T>, int) - Static method in class cc.redberry.rings.poly.univar.ModularComposition
-
Returns modular composition poly(point) mod polyModulus
calculated using Brent & Kung algorithm for
modular composition.
- compositionBrentKung(T, T, T, UnivariateDivision.InverseModMonomial<T>) - Static method in class cc.redberry.rings.poly.univar.ModularComposition
-
Returns modular composition poly(point) mod polyModulus
calculated using Brent & Kung algorithm for
modular composition.
- compositionHorner(UnivariatePolynomialZp64, UnivariatePolynomialZp64, UnivariatePolynomialZp64, UnivariateDivision.InverseModMonomial<UnivariatePolynomialZp64>) - Static method in class cc.redberry.rings.poly.univar.ModularComposition
-
Returns modular composition poly(point) mod polyModulus
calculated with plain Horner scheme.
- compress(Serializable) - Static method in class cc.redberry.rings.util.ZipUtil
-
Compress object to a string
- constant(Ring<E>, E) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Creates constant polynomial over specified ring
- constant(long) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
Returns constant with specified value
- constant(long, long) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
Creates constant polynomial with specified value
- constant(IntegersZp64, long) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
Creates constant polynomial with specified value
- contains(Poly) - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Tests whether specified poly is an element of this ideal
- contains(Ideal<Term, Poly>) - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Whether this ideal contains the specified one
- contains(Object) - Method in class cc.redberry.rings.util.ListWrapper
-
- containsAll(Collection<?>) - Method in class cc.redberry.rings.util.ListWrapper
-
- containsProduct(Ideal<Term, Poly>, Ideal<Term, Poly>) - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Whether this ideal contains the product of two specified ideals
- content(int) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Gives the content of this considered as R[variable][other_variables]
- content() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Returns the content of this polynomial.
- content() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Returns the content of this polynomial.
- content() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Returns the content of the poly
- contentAsPoly() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Returns the content of this (gcd of coefficients) as a constant poly
- contentAsPoly() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- contentAsPoly() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- contentAsPoly() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- contentExcept(int) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Gives the content of this considered as R[other_variables][variable]
- contentUnivariate(int) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Gives the content of this considered as R[variable][other_variables]
- contentUnivariate(int) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- contentUnivariate(int) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- ConvertBasis(List<Poly>, Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
Converts basis into a basis for desired monomial order
- coprimeQ(Poly...) - Static method in class cc.redberry.rings.poly.PolynomialMethods
-
Returns whether specified polynomials are coprime.
- coprimeQ(Iterable<Poly>) - Static method in class cc.redberry.rings.poly.PolynomialMethods
-
Returns whether specified polynomials are coprime.
- copy(E) - Method in class cc.redberry.rings.AQuotientRing
-
- copy(I) - Method in class cc.redberry.rings.ImageRing
-
- copy(Poly) - Method in class cc.redberry.rings.poly.FiniteField
-
- copy() - Method in interface cc.redberry.rings.poly.IPolynomial
-
- copy(Rational<E>) - Method in class cc.redberry.rings.Rationals
-
- copy(E) - Method in interface cc.redberry.rings.Ring
-
Makes a deep copy of the specified element (for immutable instances the same reference returned).
- create(Term...) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Creates multivariate polynomial over the same ring as this from the list of monomials
- create(Iterable<Term>) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Creates multivariate polynomial over the same ring as this from the list of monomials
- create(Term) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Creates multivariate polynomial over the same ring as this with the single monomial
- create(DegreeVector) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Creates multivariate polynomial over the same ring as this with the single monomial
- create(List<Poly>) - Static method in class cc.redberry.rings.poly.multivar.Ideal
-
Creates ideal given by a list of generators.
- create(Poly...) - Static method in class cc.redberry.rings.poly.multivar.Ideal
-
Creates ideal given by a list of generators.
- create(List<Poly>, Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.Ideal
-
Creates ideal given by a list of generators.
- create(int[]) - Method in interface cc.redberry.rings.poly.multivar.IMonomialAlgebra
-
creates term with specified exponents and unit coefficient
- create(DegreeVector) - Method in interface cc.redberry.rings.poly.multivar.IMonomialAlgebra
-
creates term with specified exponents and unit coefficient
- create(int[]) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebra
-
- create(DegreeVector) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebra
-
- create(int[]) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebraZp64
-
- create(DegreeVector) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebraZp64
-
- create(int, Ring<E>, Comparator<DegreeVector>, Iterable<Monomial<E>>) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Creates multivariate polynomial from a list of monomial terms
- create(int, Ring<E>, Comparator<DegreeVector>, Monomial<E>...) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Creates multivariate polynomial from a list of monomial terms
- create(int, IntegersZp64, Comparator<DegreeVector>, MonomialSet<MonomialZp64>) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Creates multivariate polynomial from a set of monomials
- create(int, IntegersZp64, Comparator<DegreeVector>, Iterable<MonomialZp64>) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Creates multivariate polynomial from a list of monomial terms
- create(int, IntegersZp64, Comparator<DegreeVector>, MonomialZp64...) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Creates multivariate polynomial from a list of monomial terms
- create(DegreeVector) - Method in class cc.redberry.rings.poly.MultivariateRing
-
Creates multivariate polynomial over the same ring as this with the single monomial
- create(Ring<E>, E...) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Creates new univariate polynomial over specified ring with the specified coefficients.
- create(Ring<BigInteger>, long...) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Creates univariate polynomial over specified ring (with integer elements) with the specified coefficients
- create(long...) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Creates new univariate Z[x] polynomial
- create(long...) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
Creates Z[x] polynomial from the specified coefficients
- create(long, long[]) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
Creates poly with specified coefficients represented as signed integers reducing them modulo modulus
- create(IntegersZp64, long[]) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
Creates poly with specified coefficients represented as signed integers reducing them modulo modulus
- createArray(int) - Method in class cc.redberry.rings.poly.FiniteField
-
- createArray(int) - Method in interface cc.redberry.rings.poly.IPolynomial
-
overcome Java generics...
- createArray(Poly, Poly) - Method in interface cc.redberry.rings.poly.IPolynomial
-
overcome Java generics...
- createArray(Poly, Poly, Poly) - Method in interface cc.redberry.rings.poly.IPolynomial
-
overcome Java generics...
- createArray(int) - Method in interface cc.redberry.rings.poly.multivar.IMonomialAlgebra
-
creates generic array of specified length
- createArray(int) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebra
-
- createArray(int) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebraZp64
-
- createArray(int) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- createArray(int) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- createArray(int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- createArray(UnivariatePolynomial<E>, UnivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- createArray(int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- createArray(int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- createArray(UnivariatePolynomialZp64, UnivariatePolynomialZp64) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- createArray(int) - Method in class cc.redberry.rings.Rationals
-
- createArray(int) - Method in interface cc.redberry.rings.Ring
-
Creates generic array of ring elements of specified length
- createArray(E, E) - Method in interface cc.redberry.rings.Ring
-
Creates generic array of {a, b}
- createArray(E, E, E) - Method in interface cc.redberry.rings.Ring
-
Creates generic array of {a, b, c}
- createArray(E) - Method in interface cc.redberry.rings.Ring
-
Creates generic array with single element
- createArray2d(int) - Method in class cc.redberry.rings.poly.FiniteField
-
- createArray2d(int, int) - Method in class cc.redberry.rings.poly.FiniteField
-
- createArray2d(int) - Method in interface cc.redberry.rings.poly.IPolynomial
-
overcome Java generics...
- createArray2d(int, int) - Method in interface cc.redberry.rings.poly.IPolynomial
-
overcome Java generics...
- createArray2d(int) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- createArray2d(int, int) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- createArray2d(int) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- createArray2d(int, int) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- createArray2d(int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- createArray2d(int, int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- createArray2d(int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- createArray2d(int, int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- createArray2d(int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- createArray2d(int, int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- createArray2d(int) - Method in class cc.redberry.rings.Rationals
-
- createArray2d(int, int) - Method in class cc.redberry.rings.Rationals
-
- createArray2d(int) - Method in interface cc.redberry.rings.Ring
-
Creates 2d array of ring elements of specified length
- createArray2d(int, int) - Method in interface cc.redberry.rings.Ring
-
Creates 2d array of ring elements of specified shape
- createConstant(long) - Method in interface cc.redberry.rings.poly.IPolynomial
-
Creates constant polynomial with specified value
- createConstant(E) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Creates constant polynomial with specified value
- createConstant(long) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Creates constant polynomial with specified value
- createConstant(E) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Creates constant polynomial with specified value (over the same ring)
- createFromArray(E[]) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Creates new poly with the specified coefficients (over the same ring)
- createFromArray(long[]) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- createFromArray(long[]) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- createLinear(int, E, E) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Creates linear polynomial of the form cc + lc * variable
- createLinear(int, long, long) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Creates linear polynomial of the form cc + lc * variable
- createLinear(E, E) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Creates linear polynomial of form cc + x * lc
(over the same ring)
- createLinearLift(BigInteger, UnivariatePolynomialZ64, UnivariatePolynomialZp64, UnivariatePolynomialZp64) - Static method in class cc.redberry.rings.poly.univar.HenselLifting
-
Creates linear Hensel lift.
- createLinearLift(BigInteger, UnivariatePolynomial<BigInteger>, UnivariatePolynomialZp64, UnivariatePolynomialZp64) - Static method in class cc.redberry.rings.poly.univar.HenselLifting
-
Creates linear Hensel lift.
- createLinearLift(long, UnivariatePolynomialZ64, UnivariatePolynomialZp64, UnivariatePolynomialZp64) - Static method in class cc.redberry.rings.poly.univar.HenselLifting
-
Creates linear Hensel lift.
- createLinearLift(long, UnivariatePolynomial<BigInteger>, UnivariatePolynomialZp64, UnivariatePolynomialZp64) - Static method in class cc.redberry.rings.poly.univar.HenselLifting
-
Creates linear Hensel lift.
- createMagic(long, long) - Static method in class cc.redberry.rings.ChineseRemainders
-
Magic for fast repeated Chinese Remainders
- createMonomial(int, int) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Creates monomial over the same ring as this of the form variable ^ degree
- createMonomial(int) - Method in interface cc.redberry.rings.poly.univar.IUnivariatePolynomial
-
Creates new monomial x^degree
(with the same coefficient ring)
- createMonomial(int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- createMonomial(E, int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Creates monomial coefficient * x^degree
(over the same ring)
- createMonomial(long, int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- createMonomial(long, int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- createMonomialMod(long, T, UnivariateDivision.InverseModMonomial<T>) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialArithmetic
-
Creates x^exponent mod polyModulus
.
- createMonomialMod(BigInteger, T, UnivariateDivision.InverseModMonomial<T>) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialArithmetic
-
Creates x^exponent mod polyModulus
.
- createOne() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Returns the new instance of unit polynomial (with the same coefficient ring)
- createOne() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- createOne() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- createOne() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- createQuadraticLift(long, UnivariatePolynomialZ64, UnivariatePolynomialZp64, UnivariatePolynomialZp64) - Static method in class cc.redberry.rings.poly.univar.HenselLifting
-
Creates quadratic Hensel lift.
- createQuadraticLift(BigInteger, UnivariatePolynomial<BigInteger>, UnivariatePolynomial<BigInteger>, UnivariatePolynomial<BigInteger>) - Static method in class cc.redberry.rings.poly.univar.HenselLifting
-
Creates quadratic Hensel lift.
- createQuadraticLift(BigInteger, UnivariatePolynomial<BigInteger>, UnivariatePolynomialZp64, UnivariatePolynomialZp64) - Static method in class cc.redberry.rings.poly.univar.HenselLifting
-
Creates quadratic Hensel lift.
- createSieve(int) - Static method in class cc.redberry.rings.primes.SieveOfAtkin
-
- createSieve(BigInteger) - Static method in class cc.redberry.rings.primes.SieveOfAtkin
-
- createUnsafe(Ring<E>, E[]) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
skips ring.setToValueOf(data)
- createUnsafe(long, long[]) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
data is not reduced modulo modulus
- createUnsafe(IntegersZp64, long[]) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
data is not reduced modulo modulus
- createZero() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Returns the new instance of zero polynomial (with the same coefficient ring)
- createZero() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- createZero() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- createZero() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- createZeroesArray(int) - Method in interface cc.redberry.rings.Ring
-
Creates array filled with zero elements
- createZeroesArray2d(int, int) - Method in interface cc.redberry.rings.Ring
-
Creates 2d array of ring elements of specified shape filled with zero elements
- cyclic(int) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasisData
-
- DECIMAL128 - Static variable in class cc.redberry.rings.bigint.MathContext
-
A
MathContext
object with a precision setting
matching the IEEE 754R Decimal128 format, 34 digits, and a
rounding mode of
HALF_EVEN
, the
IEEE 754R default.
- DECIMAL32 - Static variable in class cc.redberry.rings.bigint.MathContext
-
A
MathContext
object with a precision setting
matching the IEEE 754R Decimal32 format, 7 digits, and a
rounding mode of
HALF_EVEN
, the
IEEE 754R default.
- DECIMAL64 - Static variable in class cc.redberry.rings.bigint.MathContext
-
A
MathContext
object with a precision setting
matching the IEEE 754R Decimal64 format, 16 digits, and a
rounding mode of
HALF_EVEN
, the
IEEE 754R default.
- decrement() - Method in class cc.redberry.rings.bigint.BigInteger
-
- decrement(I) - Method in class cc.redberry.rings.ImageRing
-
- decrement() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Subtracts 1 from this
- decrement() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- decrement() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- decrement() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- decrement(E) - Method in interface cc.redberry.rings.Ring
-
Returns element - 1
- deepClone(int[][]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- deepClone(Object[][]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- DEFAULT - Static variable in class cc.redberry.rings.poly.multivar.MonomialOrder
-
Default monomial order (GREVLEX)
- DEFAULT - Static variable in interface cc.redberry.rings.util.IntComparator
-
- defaultSelectionStrategy(Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
Default selection strategy (with or without sugar)
- defaultVars(int) - Static method in interface cc.redberry.rings.WithVariables
-
Sequence of strings "a", "b", "c" etc.
- degree() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Returns the degree of this polynomial
- degree() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns the total degree of this polynomial, that is the maximal total degree among all terms
- degree(int) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns the degree of this polynomial with respect to specified variable
- degree() - Method in class cc.redberry.rings.poly.multivar.GroebnerBasis.HilbertSeries
-
The degree of ideal
- degree() - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Returns the affine degree of this ideal
- degree() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- degreeMax() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns the maximal degree of variables in this polynomial
- degrees() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns an array of degrees of all variables, so that is i-th element of the result is the polynomial degree with
respect to i-th variable
- degrees(int) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns the array of exponents in which variable
occurs in this polynomial
- degrees() - Method in class cc.redberry.rings.poly.multivar.MonomialSet
-
- degreesRef() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
returns reference (content must not be modified)
- degreeSum() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
- DegreeVector - Class in cc.redberry.rings.poly.multivar
-
Degree vector.
- DegreeVector(int[], int) - Constructor for class cc.redberry.rings.poly.multivar.DegreeVector
-
- DegreeVector(int[]) - Constructor for class cc.redberry.rings.poly.multivar.DegreeVector
-
- denominator - Variable in class cc.redberry.rings.Rational
-
The denominator.
- denominatorExponent - Variable in class cc.redberry.rings.poly.multivar.GroebnerBasis.HilbertSeries
-
Denominator exponent of reduced HPS(t) (that is ideal Krull dimension)
- derivative(int) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Gives partial derivative with respect to specified variable (new instance created)
- derivative(int, int) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Gives partial derivative of specified order
with respect to specified variable (new instance created)
- derivative() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Gives the derivative vector
- derivative(int, int) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- derivative(int, int) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- derivative() - Method in interface cc.redberry.rings.poly.univar.IUnivariatePolynomial
-
Returns the formal derivative of this poly (new instance, so the content of this is not changed)
- derivative() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- derivative() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- derivative() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- descendingIterator() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
- descendingIterator() - Method in class cc.redberry.rings.poly.multivar.MonomialSet
-
- dimension() - Method in class cc.redberry.rings.poly.multivar.GroebnerBasis.HilbertSeries
-
The dimension of ideal
- dimension() - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Returns the affine dimension of this ideal
- DiophantineEquations - Class in cc.redberry.rings.poly.univar
-
- DiophantineEquations.DiophantineSolver<Poly extends IUnivariatePolynomial<Poly>> - Class in cc.redberry.rings.poly.univar
-
Solves a1 * x1 + a2 * x2 + ...
- DiophantineSolver(Poly[]) - Constructor for class cc.redberry.rings.poly.univar.DiophantineEquations.DiophantineSolver
-
- DistinctDegreeFactorization - Class in cc.redberry.rings.poly.univar
-
Distinct-degree factorization of univariate polynomials over finite fields.
- DistinctDegreeFactorization(UnivariatePolynomialZp64) - Static method in class cc.redberry.rings.poly.univar.DistinctDegreeFactorization
-
Performs distinct-degree factorization for square-free polynomial poly
.
- DistinctDegreeFactorization(Poly) - Static method in class cc.redberry.rings.poly.univar.DistinctDegreeFactorization
-
Performs distinct-degree factorization for square-free polynomial poly
.
- DistinctDegreeFactorizationPlain(UnivariatePolynomialZp64) - Static method in class cc.redberry.rings.poly.univar.DistinctDegreeFactorization
-
Performs distinct-degree factorization for square-free polynomial poly
using plain incremental exponents
algorithm.
- DistinctDegreeFactorizationPrecomputedExponents(UnivariatePolynomialZp64) - Static method in class cc.redberry.rings.poly.univar.DistinctDegreeFactorization
-
Performs distinct-degree factorization for square-free polynomial poly
using plain incremental exponents
algorithm with precomputed exponents.
- DistinctDegreeFactorizationShoup(Poly) - Static method in class cc.redberry.rings.poly.univar.DistinctDegreeFactorization
-
Performs distinct-degree factorization for square-free polynomial poly
using Victor Shoup's baby step /
giant step algorithm.
- divide(BigDecimal, int, int) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is (this /
divisor)
, and whose scale is as specified.
- divide(BigDecimal, int, RoundingMode) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is (this /
divisor)
, and whose scale is as specified.
- divide(BigDecimal, int) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is (this /
divisor)
, and whose scale is this.scale()
.
- divide(BigDecimal, RoundingMode) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is (this /
divisor)
, and whose scale is this.scale()
.
- divide(BigDecimal) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is (this /
divisor)
, and whose preferred scale is (this.scale() -
divisor.scale())
; if the exact quotient cannot be
represented (because it has a non-terminating decimal
expansion) an ArithmeticException
is thrown.
- divide(BigDecimal, MathContext) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is (this /
divisor)
, with rounding according to the context settings.
- divide(BigInteger) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is (this / val)
.
- divide(BigInteger, int) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is (this / val)
,
using multiple threads if the numbers are sufficiently large.
- divide(BigInteger, BigInteger) - Method in class cc.redberry.rings.IntegersZp
-
- divide(long, long) - Method in class cc.redberry.rings.IntegersZp64
-
Subtract mod operation
- divide(long) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Divides this polynomial by a factor
- divide(long) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
Divide by specified value
- divide(E) - Method in class cc.redberry.rings.Rational
-
Divide this by other
- divide(long) - Method in class cc.redberry.rings.Rational
-
Divide this by other
- divide(Rational) - Method in class cc.redberry.rings.Rational
-
Divide this by other
- divideAndRemainder(E, E) - Method in class cc.redberry.rings.AQuotientRing
-
- divideAndRemainder(BigDecimal) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a two-element BigDecimal
array containing the
result of divideToIntegralValue
followed by the result of
remainder
on the two operands.
- divideAndRemainder(BigDecimal, MathContext) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a two-element BigDecimal
array containing the
result of divideToIntegralValue
followed by the result of
remainder
on the two operands calculated with rounding
according to the context settings.
- divideAndRemainder(BigInteger) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns an array of two BigIntegers containing (this / val)
followed by (this % val)
.
- divideAndRemainder(BigInteger, int) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns an array of two BigIntegers containing (this / val)
followed by (this % val)
.
Uses a specified number of threads if the inputs are sufficiently large.
- divideAndRemainder(I, I) - Method in class cc.redberry.rings.ImageRing
-
- divideAndRemainder(BigInteger, BigInteger) - Method in class cc.redberry.rings.Integers
-
- divideAndRemainder(BigInteger, BigInteger) - Method in class cc.redberry.rings.IntegersZp
-
- divideAndRemainder(Poly, Poly) - Method in class cc.redberry.rings.poly.FiniteField
-
- divideAndRemainder(Poly, Poly...) - Static method in class cc.redberry.rings.poly.multivar.MultivariateDivision
-
Performs multivariate division with remainder.
- divideAndRemainder(Poly, Poly) - Static method in class cc.redberry.rings.poly.multivar.MultivariateDivision
-
Performs multivariate division with remainder.
- divideAndRemainder(Poly, Poly) - Method in class cc.redberry.rings.poly.MultivariateRing
-
- divideAndRemainder(Poly, Poly) - Static method in class cc.redberry.rings.poly.PolynomialMethods
-
Returns quotient and remainder of a and b.
- divideAndRemainder(UnivariatePolynomialZ64, UnivariatePolynomialZ64, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Returns {quotient, remainder}
or null
if the division is not possible.
- divideAndRemainder(UnivariatePolynomialZp64, UnivariatePolynomialZp64, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Returns quotient and remainder.
- divideAndRemainder(UnivariatePolynomial<E>, UnivariatePolynomial<E>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Returns quotient and remainder.
- divideAndRemainder(Poly, Poly, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Returns {quotient, remainder}
of dividend
and divider
or null
if the division is
not possible.
- divideAndRemainder(Poly, Poly) - Method in class cc.redberry.rings.poly.UnivariateRing
-
- divideAndRemainder(Rational<E>, Rational<E>) - Method in class cc.redberry.rings.Rationals
-
- divideAndRemainder(E, E) - Method in interface cc.redberry.rings.Ring
-
Returns quotient and remainder of dividend / divider
- divideAndRemainderClassic(UnivariatePolynomialZp64, UnivariatePolynomialZp64, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Classical algorithm for division with remainder.
- divideAndRemainderClassic(UnivariatePolynomial<E>, UnivariatePolynomial<E>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Classical algorithm for division with remainder.
- divideAndRemainderFast(UnivariatePolynomialZp64, UnivariatePolynomialZp64, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Fast algorithm for division with remainder using Newton's iteration.
- divideAndRemainderFast(UnivariatePolynomialZp64, UnivariatePolynomialZp64, UnivariateDivision.InverseModMonomial<UnivariatePolynomialZp64>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Fast algorithm for division with remainder using Newton's iteration.
- divideAndRemainderFast(UnivariatePolynomial<E>, UnivariatePolynomial<E>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Fast algorithm for division with remainder using Newton's iteration.
- divideAndRemainderFast(UnivariatePolynomial<E>, UnivariatePolynomial<E>, UnivariateDivision.InverseModMonomial<UnivariatePolynomial<E>>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Fast algorithm for division with remainder using Newton's iteration.
- divideAndRemainderFast(Poly, Poly, UnivariateDivision.InverseModMonomial<Poly>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Returns {quotient, remainder}
of dividend
and divider
- divideAndRemainderFast0(Poly, Poly, UnivariateDivision.InverseModMonomial<Poly>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
fast division implementation
- divideAndRemainderParallel(BigInteger) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns an array of two BigIntegers containing (this / val)
followed by (this % val)
.
Uses multiple threads if the numbers are sufficiently large.
- divideByLC(Poly) - Method in interface cc.redberry.rings.poly.IPolynomial
-
Divides this polynomial by the leading coefficient of other
or returns null
(causing loss of
internal data) if some of the elements can't be exactly divided by the other.lc()
.
- divideByLC(MultivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- divideByLC(MultivariatePolynomialZp64) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- divideByLC(UnivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- divideByLC(UnivariatePolynomialZ64) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- divideByLC(UnivariatePolynomialZp64) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- divideDegreeVectorOrNull(DegreeVector) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Divides this polynomial by a monomial
or returns null
(causing loss of internal data) if some of
the elements can't be exactly divided by the monomial
.
- divideExact(BigInteger) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is (this / val)
.
- divideExact(Term, Term) - Method in interface cc.redberry.rings.poly.multivar.IMonomialAlgebra
-
Gives quotient dividend / divider
or throws ArithmeticException
if exact division is not
possible
- divideExact(DegreeVector, Term) - Method in interface cc.redberry.rings.poly.multivar.IMonomialAlgebra
-
Gives quotient dividend / divider
or throws ArithmeticException
if exact division is not
possible
- divideExact(Poly, Poly) - Static method in class cc.redberry.rings.poly.multivar.MultivariateDivision
-
Divides dividend
by divider
or throws exception if exact division is not possible
- divideExact(E) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Divides this polynomial by a factor
or throws exception if exact division is not possible
- divideExact(Poly, Poly) - Static method in class cc.redberry.rings.poly.PolynomialMethods
-
Returns the quotient of a and b or throws ArithmeticException
if exact division is not possible
- divideExact(Poly, Poly, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Divides dividend
by divider
or throws ArithmeticException
if exact division is not
possible
- divideExact(E) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Divides this polynomial by a factor
or throws exception if exact division is not possible
- divideExact(E, E) - Method in interface cc.redberry.rings.Ring
-
Divides dividend
by divider
or throws ArithmeticException
if exact division is not
possible
- divideOrNull(DegreeVector) - Method in class cc.redberry.rings.poly.multivar.AMonomial
-
Gives quotient this / oth
or null if exact division is not possible (e.g.
- divideOrNull(int[]) - Method in class cc.redberry.rings.poly.multivar.AMonomial
-
Gives quotient this / oth
or null if exact division is not possible (e.g.
- divideOrNull(Term) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Divides this polynomial by a monomial
or returns null
(causing loss of internal data) if some of
the elements can't be exactly divided by the monomial
.
- divideOrNull(Term, Term) - Method in interface cc.redberry.rings.poly.multivar.IMonomialAlgebra
-
Gives quotient dividend / divider
or null if exact division is not possible
- divideOrNull(Monomial<E>, Monomial<E>) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebra
-
- divideOrNull(MonomialZp64, MonomialZp64) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebraZp64
-
- divideOrNull(Poly, Poly) - Static method in class cc.redberry.rings.poly.multivar.MultivariateDivision
-
Divides dividend
by divider
or returns null if exact division is not possible
- divideOrNull(E) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Divides this polynomial by a factor
or returns null
(causing loss of internal data) if some of
the elements can't be exactly divided by the factor
.
- divideOrNull(Monomial<E>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- divideOrNull(MonomialZp64) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- divideOrNull(Poly, Poly) - Static method in class cc.redberry.rings.poly.PolynomialMethods
-
Returns the quotient of a and b or throws ArithmeticException
if exact division is not possible
- divideOrNull(Poly, Poly, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Divides dividend
by divider
or returns null
if exact division is not possible
- divideOrNull(E) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Divides this polynomial by a factor
or returns null
(causing loss of internal data) if some of
the elements can't be exactly divided by the factor
.
- divideOrNull(long) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
Divides this polynomial by a factor
or returns null
(causing loss of internal data) if some of
the elements can't be exactly divided by the factor
.
- divideOrNull(E, E) - Method in interface cc.redberry.rings.Ring
-
Divides dividend
by divider
or returns null
if exact division is not possible
- divideOverRationals(Ring<Rational<E>>, UnivariatePolynomial<E>, E) - Static method in class cc.redberry.rings.poly.Util
-
- divideOverRationals(Ring<Rational<E>>, MultivariatePolynomial<E>, E) - Static method in class cc.redberry.rings.poly.Util
-
- divideParallel(BigInteger) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is (this / val)
,
using multiple threads if the numbers are sufficiently large.
- dividesQ(Poly, Poly) - Static method in class cc.redberry.rings.poly.multivar.MultivariateDivision
-
Tests whether divisor
is a divisor of poly
- divideToIntegralValue(BigDecimal) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is the integer part
of the quotient (this / divisor)
rounded down.
- divideToIntegralValue(BigDecimal, MathContext) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is the integer part
of (this / divisor)
.
- doMinimize(int, int) - Method in interface cc.redberry.rings.poly.multivar.GroebnerBasis.MinimizationStrategy
-
true means "yes, do minimization and reduction", false means "just keep all generators as is"
- doubleValue() - Method in class cc.redberry.rings.bigint.BigDecimal
-
Converts this BigDecimal
to a double
.
- doubleValue() - Method in class cc.redberry.rings.bigint.BigInteger
-
Converts this BigInteger to a double
.
- dropCoefficientOf(int[], int[]) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns a coefficient before variables^exponents
as a multivariate polynomial and drops all such terms
from this
- dropSelect(int[]) - Method in class cc.redberry.rings.poly.multivar.AMonomial
-
Picks only specified exponents
- dropSelectVariables(int...) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Makes a copy of this with all variables except specified ones replaced with the units
- dropUnit() - Method in class cc.redberry.rings.FactorDecomposition
-
Drops constant factor from this (new instance returned)
- dropVariable(int) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Makes a copy of this with the specified variable dropped
- dropVariables(int[]) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Makes a copy of this with the specified variable replaced with the unit
- dv() - Method in class cc.redberry.rings.poly.multivar.AMonomial
-
Drop the coefficient
- dvDivideExact(DegreeVector) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Gives quotient this / oth
or throws ArithmeticException
if exact division is not possible (e.g.
- dvDivideExact(int[]) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Gives quotient this / oth
or throws ArithmeticException
if exact division is not possible (e.g.
- dvDivideOrNull(int, int) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Divides this by variable^exponent
- dvDivideOrNull(DegreeVector) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Gives quotient this / oth
or null if exact division is not possible (e.g.
- dvDivideOrNull(int[]) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Gives quotient this / oth
or null if exact division is not possible (e.g.
- dvDivisibleBy(int[]) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Tests whether this can be divided by oth
degree vector
- dvDivisibleBy(DegreeVector) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Tests whether this can be divided by oth
degree vector
- dvDropSelect(int[]) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Picks only specified exponents
- dvEquals(DegreeVector) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
- dvInsert(int) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Inserts new variable
- dvJoinNewVariable() - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Joins new variable (with zero exponent) to degree vector
- dvJoinNewVariables(int) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Joins new variables (with zero exponents) to degree vector
- dvJoinNewVariables(int, int[]) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
internal API
- dvMultiply(DegreeVector) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Multiplies this by oth
- dvMultiply(int[]) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Multiplies this by oth
- dvMultiply(int, int) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Multiplies this by variable^exponent
- dvRange(int, int) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Selects range from this
- dvSelect(int) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Sets exponents of all variables except the specified variable to zero
- dvSelect(int[]) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Set's exponents of all variables except specified variables to zero
- dvSet(int, int) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Set's exponent of specified variable to specified value
- dvSetNVariables(int) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Sets the number of variables
- dvSetZero(int) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Set exponent of specified var
to zero
- dvSetZero(int[]) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Set exponents of specified variables to zero
- dvToString(String[]) - Method in class cc.redberry.rings.poly.multivar.AMonomial
-
- dvToString() - Method in class cc.redberry.rings.poly.multivar.AMonomial
-
- dvWithout(int) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Drops specified variable (number of variables will be reduced)
- dvWithout(int[]) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Drops specified variables (number of variables will be reduced)
- ecart() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns degreeSum - lt().totalDegree
- EEZGCD(Poly, Poly) - Static method in class cc.redberry.rings.poly.multivar.MultivariateGCD
-
Calculates GCD of two multivariate polynomials over Zp using enhanced EZ algorithm
- ElementParser<E> - Interface in cc.redberry.rings
-
- eliminate(int, E) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Substitutes value
for variable
and eliminates variable
from the list of variables so that
the resulting polynomial has result.nVariables = this.nVariables - 1
.
- eliminate(int, long) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Substitutes value
for variable
and eliminates variable
from the list of variables so that
the resulting polynomial has result.nVariables = this.nVariables - 1
.
- eliminate(int[], E[]) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Returns a copy of this with values
substituted for variables
- eliminate(int, long) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Substitutes value
for variable
and eliminates variable
from the list of variables so that
the resulting polynomial has result.nVariables = this.nVariables - 1
.
- eliminate(int[], long[]) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Returns a copy of this with values
substituted for variables
- empty(Ring<E>) - Static method in class cc.redberry.rings.FactorDecomposition
-
Empty factorization
- empty(Poly) - Static method in class cc.redberry.rings.poly.multivar.Ideal
-
Creates empty ideal
- empty(Poly, Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.Ideal
-
Creates empty ideal
- empty(Poly) - Static method in class cc.redberry.rings.poly.PolynomialFactorDecomposition
-
Empty factorization
- ensureInternalCapacity(int) - Method in interface cc.redberry.rings.poly.univar.IUnivariatePolynomial
-
ensures that internal storage has enough size to store desiredCapacity
elements
- ensureInternalCapacity(int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- ensureOverField(IPolynomial...) - Static method in class cc.redberry.rings.poly.Util
-
- ensureOverFiniteField(IPolynomial...) - Static method in class cc.redberry.rings.poly.Util
-
- ensureOverZ(IPolynomial...) - Static method in class cc.redberry.rings.poly.Util
-
- EqualDegreeFactorization - Class in cc.redberry.rings.poly.univar
-
Equal-degree factorization of univariate polynomials over finite fields.
- equals(Object) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Compares this BigDecimal
with the specified
Object
for equality.
- equals(Object) - Method in class cc.redberry.rings.bigint.BigInteger
-
Compares this BigInteger with the specified Object for equality.
- equals(Object) - Method in class cc.redberry.rings.bigint.MathContext
-
Compares this MathContext
with the specified
Object
for equality.
- equals(Object) - Method in class cc.redberry.rings.FactorDecomposition
-
- equals(Object) - Method in class cc.redberry.rings.ImageRing
-
- equals(Object) - Method in class cc.redberry.rings.IntegersZp
-
- equals(Object) - Method in class cc.redberry.rings.IntegersZp64
-
- equals(Object) - Method in class cc.redberry.rings.poly.FiniteField
-
- equals(Object) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
- equals(Object) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
- equals(Object) - Method in class cc.redberry.rings.poly.multivar.GroebnerBasis.HilbertSeries
-
- equals(Object) - Method in class cc.redberry.rings.poly.multivar.Ideal
-
- equals(Object) - Method in class cc.redberry.rings.poly.multivar.Monomial
-
- equals(Object) - Method in class cc.redberry.rings.poly.multivar.MonomialZp64
-
- equals(Object) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- equals(Object) - Method in class cc.redberry.rings.Rational
-
- equals(Object) - Method in class cc.redberry.rings.Rationals
-
- equals(Object) - Method in class cc.redberry.rings.util.ListWrapper
-
- EuclidGCD(T, T) - Static method in class cc.redberry.rings.poly.univar.UnivariateGCD
-
Returns the GCD calculated with Euclidean algorithm.
- EuclidRemainders(T, T) - Static method in class cc.redberry.rings.poly.univar.UnivariateGCD
-
Returns the remainder sequence produced by Euclidean algorithm.
- evaluate(int, E) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Returns a copy of this with value
substituted for variable
.
- evaluate(E...) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Evaluates this polynomial at specified points
- evaluate(int[], E[]) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Returns a copy of this with values
substituted for variables
.
- evaluate(int, E...) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Evaluates this polynomial at specified points
- evaluate(int, long) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Returns a copy of this with value
substituted for variable
.
- evaluate(E[]) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial.HornerForm
-
Substitute given values for evaluation variables (for example, if this is in R[x1,x2,x3,x4] and evaluation
variables are x2 and x4, the result will be a poly in R[x1,x3]).
- evaluate(int, long) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Returns a copy of this with value
substituted for variable
- evaluate(int[], long[]) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Returns a copy of this with values
substituted for variables
- evaluate(long...) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Evaluates this polynomial at specified points
- evaluate(int, long...) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Evaluates this polynomial at specified points
- evaluate(long[]) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64.HornerFormZp64
-
Substitute given values for evaluation variables (for example, if this is in R[x1,x2,x3,x4] and evaluation
variables are x2 and x4, the result will be a poly in R[x1,x3]).
- evaluate(long) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Evaluates this poly at a given point
(via Horner method).
- evaluate(E) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Evaluates this poly at a given point
(via Horner method).
- evaluateAtRandom(int, RandomGenerator) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Evaluates poly
at random point
- evaluateAtRandom(int, RandomGenerator) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- evaluateAtRandom(int, RandomGenerator) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- evaluateAtRandomPreservingSkeleton(int, RandomGenerator) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Evaluates poly
at random point chosen in such way that the skeleton of evaluated version is the same as
of the original poly
with respect to all except variable
variables
- evaluateAtRandomPreservingSkeleton(int, RandomGenerator) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- evaluateAtRandomPreservingSkeleton(int, RandomGenerator) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- evaluateAtRational(long, long) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
Evaluates this poly at a given rational point num/den
- evaluateAtZero(int) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Substitutes 0
for variable
(new instance created).
- evaluateAtZero(int[]) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Substitutes 0
for all specified variables
(new instance created).
- evaluateDenseRecursiveForm(UnivariatePolynomial, int, E[]) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Evaluates polynomial given in a dense recursive form at a given points
- evaluateDenseRecursiveForm(IUnivariatePolynomial, long[]) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Evaluates polynomial given in a dense recursive form at a given points
- evaluateSparseRecursiveForm(AMultivariatePolynomial, int, E[]) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Evaluates polynomial given in a sparse recursive form at a given points
- evaluateSparseRecursiveForm(AMultivariatePolynomial, long[]) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Evaluates polynomial given in a sparse recursive form at a given points
- exponents - Variable in class cc.redberry.rings.FactorDecomposition
-
exponents
- exponents - Variable in class cc.redberry.rings.poly.multivar.DegreeVector
-
exponents
- exponents() - Method in interface cc.redberry.rings.poly.univar.IUnivariatePolynomial
-
Returns a set of exponents of non-zero terms
- ExtendedEuclidGCD(T, T) - Static method in class cc.redberry.rings.poly.univar.UnivariateGCD
-
Runs extended Euclidean algorithm to compute [gcd(a,b), s, t]
such that s * a + t * b = gcd(a,
b)
.
- extendedGCD(I, I) - Method in class cc.redberry.rings.ImageRing
-
- extendedGCD(Poly, Poly) - Method in class cc.redberry.rings.poly.UnivariateRing
-
- extendedGCD(E, E) - Method in interface cc.redberry.rings.Ring
-
Returns array of [gcd(a,b), s, t]
such that s * a + t * b = gcd(a, b)
- ExtendedHalfGCD(T, T) - Static method in class cc.redberry.rings.poly.univar.UnivariateGCD
-
Runs extended Half-GCD algorithm to compute [gcd(a,b), s, t]
such that s * a + t * b = gcd(a, b)
.
- EZGCD(MultivariatePolynomialZp64, MultivariatePolynomialZp64) - Static method in class cc.redberry.rings.poly.multivar.MultivariateGCD
-
Calculates GCD of two multivariate polynomials over Zp using EZ algorithm
- F4GB(List<Poly>, Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
Computes minimized and reduced Groebner basis of a given ideal via Faugère's F4 F4 algorithm.
- factor(I) - Method in class cc.redberry.rings.ImageRing
-
- factor(BigInteger) - Method in class cc.redberry.rings.Integers
-
- factor(BigInteger) - Method in class cc.redberry.rings.IntegersZp
-
- factor(Poly) - Method in class cc.redberry.rings.poly.FiniteField
-
- Factor(Poly) - Static method in class cc.redberry.rings.poly.multivar.MultivariateFactorization
-
Factors multivariate polynomial
- factor(Poly) - Method in class cc.redberry.rings.poly.MultivariateRing
-
- Factor(Poly) - Static method in class cc.redberry.rings.poly.PolynomialMethods
-
Factor polynomial.
- Factor(Poly) - Static method in class cc.redberry.rings.poly.univar.UnivariateFactorization
-
Factors univariate poly
.
- factor(Poly) - Method in class cc.redberry.rings.poly.UnivariateRing
-
- factor(E) - Method in interface cc.redberry.rings.Ring
-
Factor specified element
- FactorDecomposition<E> - Class in cc.redberry.rings
-
Factor decomposition of element.
- FactorDecomposition(Ring<E>, E, List<E>, TIntArrayList) - Constructor for class cc.redberry.rings.FactorDecomposition
-
- factorial(int) - Static method in class cc.redberry.rings.bigint.BigIntegerUtil
-
Factorial of a number
- factorial(long) - Method in class cc.redberry.rings.ImageRing
-
- factorial(int) - Method in class cc.redberry.rings.IntegersZp64
-
Gives value!
- factorial(long) - Method in interface cc.redberry.rings.Ring
-
Gives a product of {@code valueOf(1) * valueOf(2) * ....
- FactorInGF(Poly) - Static method in class cc.redberry.rings.poly.multivar.MultivariateFactorization
-
Factors multivariate polynomial over finite field
- FactorInGF(Poly) - Static method in class cc.redberry.rings.poly.univar.UnivariateFactorization
-
Factors polynomial over finite field
- FactorInQ(MultivariatePolynomial<Rational<E>>) - Static method in class cc.redberry.rings.poly.multivar.MultivariateFactorization
-
Factors multivariate polynomial over Q
- FactorInQ(UnivariatePolynomial<Rational<E>>) - Static method in class cc.redberry.rings.poly.univar.UnivariateFactorization
-
Factors polynomial over Q
- FactorInZ(MultivariatePolynomial<BigInteger>) - Static method in class cc.redberry.rings.poly.multivar.MultivariateFactorization
-
Factors multivariate polynomial over Z
- FactorInZ(Poly) - Static method in class cc.redberry.rings.poly.univar.UnivariateFactorization
-
Factors polynomial in Z[x].
- factors - Variable in class cc.redberry.rings.FactorDecomposition
-
factors
- factorSquareFree(I) - Method in class cc.redberry.rings.ImageRing
-
- factorSquareFree(BigInteger) - Method in class cc.redberry.rings.Integers
-
- factorSquareFree(BigInteger) - Method in class cc.redberry.rings.IntegersZp
-
- factorSquareFree(Poly) - Method in class cc.redberry.rings.poly.MultivariateRing
-
- FactorSquareFree(Poly) - Static method in class cc.redberry.rings.poly.PolynomialMethods
-
Square-free factorization of polynomial.
- factorSquareFree(Poly) - Method in class cc.redberry.rings.poly.UnivariateRing
-
- factorSquareFree(E) - Method in interface cc.redberry.rings.Ring
-
Square-free factorization of specified element
- FactorSquareFreeInGF(T) - Static method in class cc.redberry.rings.poly.univar.UnivariateFactorization
-
Factors square-free polynomial over finite field
- FactorSquareFreeInZ(PolyZ) - Static method in class cc.redberry.rings.poly.univar.UnivariateFactorization
-
- factory() - Method in class cc.redberry.rings.poly.FiniteField
-
- factory() - Method in interface cc.redberry.rings.poly.IPolynomialRing
-
Factory polynomial
- factory() - Method in class cc.redberry.rings.poly.QuotientRing
-
- factory() - Method in class cc.redberry.rings.poly.UnivariateQuotientRing
-
- fastDiv - Variable in class cc.redberry.rings.poly.UnivariateQuotientRing
-
- fastDivisionPreConditioning(Poly) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Prepares rev(divider)^(-1) mod x^i
for fast division.
- fastDivisionPreConditioningWithLCCorrection(Poly) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Prepares rev(divider)^(-1) mod x^i
for fast division.
- fermat(BigInteger, long) - Static method in class cc.redberry.rings.primes.BigPrimes
-
Fermat's factoring algorithm works like trial division, but walks in the opposite direction.
- finisher() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial.PolynomialCollector
-
- finisher() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial.PolynomialCollector
-
- FiniteField<Poly extends IUnivariatePolynomial<Poly>> - Class in cc.redberry.rings.poly
-
Galois field.
- FiniteField(Poly) - Constructor for class cc.redberry.rings.poly.FiniteField
-
Constructs finite field from the specified irreducible polynomial.
- finiteFieldIrreducibleQ(Poly) - Static method in class cc.redberry.rings.poly.univar.IrreduciblePolynomials
-
Tests whether poly
is irreducible over the finite field
- first() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
- first() - Method in class cc.redberry.rings.poly.multivar.MonomialSet
-
First monomial in this set
- firstIndexOf(int, int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- firstIndexOf(Object, Object[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- firstNonZeroCoefficientPosition() - Method in interface cc.redberry.rings.poly.univar.IUnivariatePolynomial
-
Returns position of the first non-zero coefficient, that is common monomial exponent (e.g.
- firstNonZeroCoefficientPosition() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- fits31bitWord(long) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
Returns true if val
fits into 32-bit machine word (unsigned) and false otherwise
- fits32bitWord(long) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
Returns true if val
fits into 32-bit machine word (unsigned) and false otherwise
- FIVE - Static variable in class cc.redberry.rings.bigint.BigInteger
-
The BigInteger constant five.
- flatten(int[][]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- flipBit(int) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is equivalent to this BigInteger
with the designated bit flipped.
- floatValue() - Method in class cc.redberry.rings.bigint.BigDecimal
-
Converts this BigDecimal
to a float
.
- floatValue() - Method in class cc.redberry.rings.bigint.BigInteger
-
Converts this BigInteger to a float
.
- forEach(Consumer<? super Poly>) - Method in class cc.redberry.rings.util.ListWrapper
-
- FOUR - Static variable in class cc.redberry.rings.bigint.BigInteger
-
The BigInteger constant four.
- Frac(Ring<E>) - Static method in class cc.redberry.rings.Rings
-
Ring of rational functions over specified ring
- fromDenseRecursiveForm(UnivariatePolynomial, int, Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Converts poly from a recursive univariate representation.
- fromDenseRecursiveForm(IUnivariatePolynomial, Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Converts poly from a recursive univariate representation.
- fromDenseRecursiveForm(IUnivariatePolynomial, int, Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Converts poly from a recursive univariate representation.
- fromSparseRecursiveForm(AMultivariatePolynomial, int, Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Converts poly from a recursive univariate representation.
- fromSparseRecursiveForm(AMultivariatePolynomial, Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Converts poly from a sparse recursive univariate representation.
- fromSparseRecursiveForm(AMultivariatePolynomial, int, Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Converts poly from a recursive univariate representation.
- fromUnivariate(UnivariatePolynomial<Poly>, int) - Static method in class cc.redberry.rings.poly.multivar.MultivariateConversions
-
Given poly in R[variables][other_variables] converts it to poly in R[x1,x2,...,xN]
- fromUnivariate(IPolynomialRing<UnivariatePolynomial<Poly>>, int) - Static method in class cc.redberry.rings.poly.multivar.MultivariateConversions
-
Given poly in R[variables][other_variables] converts it to poly in R[x1,x2,...,xN]
- gcd(BigInteger) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is the greatest common divisor of
abs(this)
and abs(val)
.
- gcd(BigInteger, BigInteger) - Static method in class cc.redberry.rings.bigint.BigIntegerUtil
-
- gcd(BigInteger[], int, int) - Static method in class cc.redberry.rings.bigint.BigIntegerUtil
-
Returns the greatest common an array of longs
- gcd(I, I) - Method in class cc.redberry.rings.ImageRing
-
- gcd(I...) - Method in class cc.redberry.rings.ImageRing
-
- gcd(Iterable<I>) - Method in class cc.redberry.rings.ImageRing
-
- gcd(BigInteger, BigInteger) - Method in class cc.redberry.rings.Integers
-
- gcd(Poly, Poly) - Method in class cc.redberry.rings.poly.FiniteField
-
- gcd(long, long) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
Returns the greatest common divisor of two longs.
- gcd(int, int) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
Computes the greatest common divisor of the absolute value of two numbers, using a modified version of the
"binary gcd" method.
- gcd(long[], int, int) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
Returns the greatest common an array of longs
- gcd(long...) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
Returns the greatest common an array of longs
- gcd(int[], int, int) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
Returns the greatest common an array of integers
- gcd(int...) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
Returns the greatest common an array of integers
- gcd(Poly, Poly) - Method in class cc.redberry.rings.poly.MultivariateRing
-
- gcd(Poly[]) - Method in class cc.redberry.rings.poly.MultivariateRing
-
- gcd(Iterable<Poly>) - Method in class cc.redberry.rings.poly.MultivariateRing
-
- gcd() - Method in class cc.redberry.rings.poly.univar.UnivariateGCD.PolynomialRemainders
-
- gcd(Poly, Poly) - Method in class cc.redberry.rings.poly.UnivariateRing
-
- gcd(Rational<E>, Rational<E>) - Method in class cc.redberry.rings.Rationals
-
- gcd(E, E) - Method in interface cc.redberry.rings.Ring
-
Returns the greatest common divisor of two elements
- gcd(E...) - Method in interface cc.redberry.rings.Ring
-
Returns greatest common divisor of specified elements
- gcd(Iterable<E>) - Method in interface cc.redberry.rings.Ring
-
Returns greatest common divisor of specified elements
- gcdExtended(long, long) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
Runs extended Euclidean algorithm to compute [gcd(a,b), x, y]
such that x * a + y * b = gcd(a,
b)
- get(int) - Method in class cc.redberry.rings.FactorDecomposition
-
Returns i-th factor
- get(int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Returns i-th coefficient of this poly
- get(int) - Method in class cc.redberry.rings.util.ListWrapper
-
- getAsPoly(int) - Method in interface cc.redberry.rings.poly.univar.IUnivariatePolynomial
-
Returns i-th coefficient of this as a constant polynomial
- getAsPoly(int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- getBasisGenerator(int) - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Returns i-th element of Groebner basis
- getDataReferenceUnsafe() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
internal API
- getExponent(int) - Method in class cc.redberry.rings.FactorDecomposition
-
Exponent of i-th factor
- getGroebnerBasis() - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Groebner basis of this ideal
- getHornerForm(int[]) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Gives data structure for fast Horner-like sparse evaluation of this multivariate polynomial
- getHornerForm(int[]) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Gives data structure for fast Horner-like sparse evaluation of this multivariate polynomial
- getInterpolatingPolynomial() - Method in class cc.redberry.rings.poly.multivar.MultivariateInterpolation.Interpolation
-
Returns resulting interpolating polynomial
- getInterpolatingPolynomial() - Method in class cc.redberry.rings.poly.multivar.MultivariateInterpolation.InterpolationZp64
-
Returns resulting interpolating polynomial
- getInterpolatingPolynomial() - Method in class cc.redberry.rings.poly.univar.UnivariateInterpolation.Interpolation
-
Returns resulting interpolating polynomial
- getInterpolatingPolynomial() - Method in class cc.redberry.rings.poly.univar.UnivariateInterpolation.InterpolationZp64
-
Returns resulting interpolating polynomial
- getInverse(int) - Method in class cc.redberry.rings.poly.univar.UnivariateDivision.InverseModMonomial
-
Returns poly^(-1) mod x^xDegree
.
- getIrreducible() - Method in class cc.redberry.rings.poly.FiniteField
-
Returns the irreducible polynomial that generates this finite field
- getLimit() - Method in class cc.redberry.rings.primes.SieveOfAtkin
-
- getLimitAsBigInteger() - Method in class cc.redberry.rings.primes.SieveOfAtkin
-
- getLowestSetBit() - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns the index of the rightmost (lowest-order) one bit in this
BigInteger (the number of zero bits to the right of the rightmost
one bit).
- getMonomialOrder() - Method in class cc.redberry.rings.poly.multivar.Ideal
-
The monomial order used for Groebner basis
- getNegativeOne() - Method in class cc.redberry.rings.Integers
-
- getNegativeOne() - Method in class cc.redberry.rings.Rationals
-
- getNegativeOne() - Method in interface cc.redberry.rings.Ring
-
Returns negative unit element of this ring (minus one)
- getOne() - Method in class cc.redberry.rings.AQuotientRing
-
- getOne() - Method in class cc.redberry.rings.ImageRing
-
- getOne() - Method in class cc.redberry.rings.poly.FiniteField
-
- getOne() - Method in class cc.redberry.rings.Rationals
-
- getOne() - Method in interface cc.redberry.rings.Ring
-
Returns unit element of this ring (one)
- getOriginalGenerators() - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Returns the list of original generators
- getPoints() - Method in class cc.redberry.rings.poly.multivar.MultivariateInterpolation.Interpolation
-
Returns the list of evaluation points used in interpolation
- getPoints() - Method in class cc.redberry.rings.poly.multivar.MultivariateInterpolation.InterpolationZp64
-
Returns the list of evaluation points used in interpolation
- getPoints() - Method in class cc.redberry.rings.poly.univar.UnivariateInterpolation.Interpolation
-
Returns the list of evaluation points used in interpolation
- getPoints() - Method in class cc.redberry.rings.poly.univar.UnivariateInterpolation.InterpolationZp64
-
Returns the list of evaluation points used in interpolation
- getPrecision() - Method in class cc.redberry.rings.bigint.MathContext
-
Returns the precision
setting.
- getRange(int, int) - Method in interface cc.redberry.rings.poly.univar.IUnivariatePolynomial
-
Creates polynomial formed from the coefficients of this starting from from
(inclusive) to to
(exclusive)
- getRange(int, int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- getRange(int, int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- getRange(int, int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- getRoundingMode() - Method in class cc.redberry.rings.bigint.MathContext
-
Returns the roundingMode setting.
- getSkeleton() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns skeleton of this poly
- getSkeleton(int...) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns skeleton of this poly with respect to specified variables
- getSkeletonExcept(int...) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns skeleton of this poly with respect to all except specified variables
- getSortedDistinct(int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sort array & return array with removed repetitive values.
- getSortedDistinct(BigInteger[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sort array & return array with removed repetitive values.
- getSortedDistinct(long[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sort array & return array with removed repetitive values.
- getUnitTerm(int) - Method in interface cc.redberry.rings.poly.multivar.IMonomialAlgebra
-
creates a unit term
- getUnitTerm(int) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebra
-
- getUnitTerm(int) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebraZp64
-
- getValues() - Method in class cc.redberry.rings.poly.multivar.MultivariateInterpolation.Interpolation
-
Returns the list of polynomial values at interpolation points
- getValues() - Method in class cc.redberry.rings.poly.multivar.MultivariateInterpolation.InterpolationZp64
-
Returns the list of polynomial values at interpolation points
- getValues() - Method in class cc.redberry.rings.poly.univar.UnivariateInterpolation.Interpolation
-
Returns the list of polynomial values at interpolation points
- getValues() - Method in class cc.redberry.rings.poly.univar.UnivariateInterpolation.InterpolationZp64
-
Returns the list of polynomial values at interpolation points
- getVariable() - Method in class cc.redberry.rings.poly.multivar.MultivariateInterpolation.Interpolation
-
Returns variable used in the interpolation
- getVariable() - Method in class cc.redberry.rings.poly.multivar.MultivariateInterpolation.InterpolationZp64
-
Returns variable used in the interpolation
- getZero() - Method in class cc.redberry.rings.AQuotientRing
-
- getZero() - Method in class cc.redberry.rings.ImageRing
-
- getZero() - Method in class cc.redberry.rings.poly.FiniteField
-
- getZero() - Method in class cc.redberry.rings.Rationals
-
- getZero() - Method in interface cc.redberry.rings.Ring
-
Returns zero element of this ring
- getZeroTerm(int) - Method in interface cc.redberry.rings.poly.multivar.IMonomialAlgebra
-
creates a zero term
- getZeroTerm(int) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebra
-
- getZeroTerm(int) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebraZp64
-
- GF(long, int) - Static method in class cc.redberry.rings.Rings
-
Galois field with the cardinality prime ^ exponent
(with prime < 2^63).
- GF(BigInteger, int) - Static method in class cc.redberry.rings.Rings
-
Galois field with the cardinality prime ^ exponent
for arbitrary large prime
- GF(Poly) - Static method in class cc.redberry.rings.Rings
-
Galois field with the specified irreducible generator.
- GF17p5 - Static variable in class cc.redberry.rings.poly.FiniteField
-
GF(17^5)
- GF27 - Static variable in class cc.redberry.rings.poly.FiniteField
-
GF(3^3)
- GREVLEX - Static variable in class cc.redberry.rings.poly.multivar.MonomialOrder
-
Graded reverse lexicographic monomial order
- GRLEX - Static variable in class cc.redberry.rings.poly.multivar.MonomialOrder
-
Graded lexicographic monomial order.
- GroebnerBasis - Class in cc.redberry.rings.poly.multivar
-
Groebner bases.
- GroebnerBasis(List<Poly>, Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
Computes Groebner basis (minimized and reduced) of a given ideal represented by a list of generators.
- GroebnerBasis.HilbertSeries - Class in cc.redberry.rings.poly.multivar
-
Hilbert-Poincare series HPS(t) = P(t) / (1 - t)^m
- GroebnerBasis.MinimizationStrategy - Interface in cc.redberry.rings.poly.multivar
-
Strategy used to reduce and minimize basis in the intermediate steps of Buchberger algorithm
- GroebnerBasis.SyzygyPair<Term extends AMonomial<Term>,Poly extends cc.redberry.rings.poly.multivar.MonomialSetView<Term>> - Class in cc.redberry.rings.poly.multivar
-
Abstract critical pair: used with different Poly type for Buchberger and F4 algorithms
- GroebnerBasisData - Class in cc.redberry.rings.poly.multivar
-
Collection of special ideals
- GroebnerBasisData() - Constructor for class cc.redberry.rings.poly.multivar.GroebnerBasisData
-
- GroebnerBasisInGF(List<Poly>, Comparator<DegreeVector>, GroebnerBasis.HilbertSeries) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
Computes Groebner basis (minimized and reduced) of a given ideal over finite filed represented by a list of
generators.
- GroebnerBasisInQ(List<MultivariatePolynomial<Rational<BigInteger>>>, Comparator<DegreeVector>, GroebnerBasis.HilbertSeries, boolean) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
Computes Groebner basis (minimized and reduced) of a given ideal over Q represented by a list of generators.
- GroebnerBasisInZ(List<MultivariatePolynomial<BigInteger>>, Comparator<DegreeVector>, GroebnerBasis.HilbertSeries, boolean) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
Computes Groebner basis (minimized and reduced) of a given ideal over Z represented by a list of generators.
- GroebnerBasisWithOptimizedGradedOrder(List<Poly>) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
computes Groebner basis in GREVLEX with shuffled variables
- GroebnerBasisWithOptimizedGradedOrder(List<Poly>, GroebnerBasis.GroebnerAlgorithm<Term, Poly>) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
computes Groebner basis in GREVLEX with shuffled variables
- Ideal<Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> - Class in cc.redberry.rings.poly.multivar
-
Ideal represented by its Groebner basis.
- ideal - Variable in class cc.redberry.rings.poly.QuotientRing
-
the ideal
- image(F) - Method in class cc.redberry.rings.ImageRing
-
- image(F[]) - Method in class cc.redberry.rings.ImageRing
-
- imageFunc - Variable in class cc.redberry.rings.ImageRing
-
- ImageRing<F,I> - Class in cc.redberry.rings
-
- ImageRing(Ring<F>, Function<I, F>, Function<F, I>) - Constructor for class cc.redberry.rings.ImageRing
-
- IMonomialAlgebra<Term extends AMonomial<Term>> - Interface in cc.redberry.rings.poly.multivar
-
Algebraic operations (multiplication, division) and utility methods for monomials.
- IMonomialAlgebra.MonomialAlgebra<E> - Class in cc.redberry.rings.poly.multivar
-
Generic term algebra
- IMonomialAlgebra.MonomialAlgebraZp64 - Class in cc.redberry.rings.poly.multivar
-
Term algebra for terms over Zp
- increment() - Method in class cc.redberry.rings.bigint.BigInteger
-
- increment(I) - Method in class cc.redberry.rings.ImageRing
-
- increment() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Adds 1 to this
- increment() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- increment() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- increment() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- increment(E) - Method in interface cc.redberry.rings.Ring
-
Returns element + 1
- indexOf(Object) - Method in class cc.redberry.rings.util.ListWrapper
-
- indexOfMax(int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- initialDenominatorExponent - Variable in class cc.redberry.rings.poly.multivar.GroebnerBasis.HilbertSeries
-
Initial denominator exponent (numerator and denominator may have nontrivial GCD)
- initialDomain - Variable in class cc.redberry.rings.poly.univar.HenselLifting.bLinearLift
-
The initial modulus (less than 64-bit)
- initialModulus - Variable in class cc.redberry.rings.poly.univar.HenselLifting.lLinearLift
-
The initial modulus
- initialNumerator - Variable in class cc.redberry.rings.poly.multivar.GroebnerBasis.HilbertSeries
-
Initial numerator (numerator and denominator may have nontrivial GCD)
- insert(int) - Method in class cc.redberry.rings.poly.multivar.AMonomial
-
Inserts new variable (with zero exponent)
- insert(int[], int, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- insert(long[], int, long) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- insert(T[], int, T) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- insertionSort(int[], int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified array of ints into ascending order using insertion sort algorithm and simultaneously permutes
the coSort
ints array in the same way as the target array.
- insertionSort(int[], int, int, int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified array of ints into ascending order using insertion sort algorithm and simultaneously permutes
the coSort
ints array in the same way as the target array.
- insertionSort(int[], long[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified array of ints into ascending order using insertion sort algorithm and simultaneously permutes
the coSort
longs array in the same way as the specified target array.
- insertionSort(int[], int, int, long[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified array of ints into ascending order using insertion sort algorithm and simultaneously permutes
the coSort
ints array in the same way as the target array.
- insertionSort(T[], Object[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified target array of objects into ascending order, according to the natural ordering of its
elements using insertion sort algorithm and simultaneously permutes the coSort
objects array in the same
way then specified target array.
- insertionSort(T[], int, int, Object[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified target array of objects into ascending order, according to the natural ordering of its
elements using insertion sort algorithm and simultaneously permutes the coSort
objects array in the same
way then specified target array.
- insertionSort(T[], int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified target array of objects into ascending order, according to the natural ordering of its
elements using insertion sort algorithm and simultaneously permutes the coSort
objects array in the same
way then specified target array.
- insertionSort(T[], int, int, int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified target array of objects into ascending order, according to the natural ordering of its
elements using insertion sort algorithm and simultaneously permutes the coSort
objects array in the same
way then specified target array.
- insertVariable(int) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Makes a copy of this by inserting new variable (the indexes will be shifted)
- int2byte(int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- int2short(int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- INT_MAX_VALUE - Static variable in class cc.redberry.rings.bigint.BigInteger
-
The BigInteger constant Int.MAX_VALUE.
- IntComparator - Interface in cc.redberry.rings.util
-
- Integers - Class in cc.redberry.rings
-
The ring of integers (Z).
- Integers - Static variable in class cc.redberry.rings.Integers
-
The ring of integers (Z)
- IntegersZp - Class in cc.redberry.rings
-
Ring of integers modulo some modulus
.
- IntegersZp(BigInteger) - Constructor for class cc.redberry.rings.IntegersZp
-
Creates Zp ring for specified modulus.
- IntegersZp(long) - Constructor for class cc.redberry.rings.IntegersZp
-
Creates Zp ring for specified modulus.
- IntegersZp64 - Class in cc.redberry.rings
-
Zp ring over machine numbers which provides fast modular arithmetic.
- IntegersZp64(long, FastDivision.Magic, FastDivision.Magic, boolean) - Constructor for class cc.redberry.rings.IntegersZp64
-
- IntegersZp64(long) - Constructor for class cc.redberry.rings.IntegersZp64
-
Creates the ring.
- integralPart() - Method in class cc.redberry.rings.poly.multivar.GroebnerBasis.HilbertSeries
-
Integral part I(t) of HPS(t): HPS(t) = I(t) + Q(t)/(1-t)^m
- interpolateLagrange(long, long[], long[]) - Static method in class cc.redberry.rings.poly.univar.UnivariateInterpolation
-
Constructs an interpolating polynomial which values at points[i]
are exactly values[i]
.
- interpolateLagrange(Ring<E>, E[], E[]) - Static method in class cc.redberry.rings.poly.univar.UnivariateInterpolation
-
Constructs an interpolating polynomial which values at points[i]
are exactly values[i]
.
- interpolateNewton(int, E[], MultivariatePolynomial<E>[]) - Static method in class cc.redberry.rings.poly.multivar.MultivariateInterpolation
-
Constructs an interpolating polynomial which values at points[i]
are exactly values[i]
.
- interpolateNewton(long, long[], long[]) - Static method in class cc.redberry.rings.poly.univar.UnivariateInterpolation
-
Constructs an interpolating polynomial which values at points[i]
are exactly values[i]
.
- interpolateNewton(IntegersZp64, long[], long[]) - Static method in class cc.redberry.rings.poly.univar.UnivariateInterpolation
-
Constructs an interpolating polynomial which values at points[i]
are exactly values[i]
.
- interpolateNewton(Ring<E>, E[], E[]) - Static method in class cc.redberry.rings.poly.univar.UnivariateInterpolation
-
Constructs an interpolating polynomial which values at points[i]
are exactly values[i]
.
- Interpolation(int, E, MultivariatePolynomial<E>) - Constructor for class cc.redberry.rings.poly.multivar.MultivariateInterpolation.Interpolation
-
Start new interpolation with interpolation[variable = point] = value
- Interpolation(int, MultivariatePolynomial<E>) - Constructor for class cc.redberry.rings.poly.multivar.MultivariateInterpolation.Interpolation
-
Start new interpolation
- Interpolation(int, IPolynomialRing<MultivariatePolynomial<E>>) - Constructor for class cc.redberry.rings.poly.multivar.MultivariateInterpolation.Interpolation
-
Start new interpolation
- Interpolation(Ring<E>) - Constructor for class cc.redberry.rings.poly.univar.UnivariateInterpolation.Interpolation
-
Start new interpolation with interpolation[point] = value
- InterpolationZp64(int, long, MultivariatePolynomialZp64) - Constructor for class cc.redberry.rings.poly.multivar.MultivariateInterpolation.InterpolationZp64
-
Start new interpolation with interpolation[variable = point] = value
- InterpolationZp64(int, MultivariatePolynomialZp64) - Constructor for class cc.redberry.rings.poly.multivar.MultivariateInterpolation.InterpolationZp64
-
Start new interpolation
- InterpolationZp64(int, IPolynomialRing<MultivariatePolynomialZp64>) - Constructor for class cc.redberry.rings.poly.multivar.MultivariateInterpolation.InterpolationZp64
-
Start new interpolation
- InterpolationZp64(IntegersZp64) - Constructor for class cc.redberry.rings.poly.univar.UnivariateInterpolation.InterpolationZp64
-
Start new interpolation with interpolation[point] = value
- intersection(Ideal<Term, Poly>) - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Returns the intersection of this and oth
- intSetDifference(int[], int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Return the set difference B - A for int sets A and B.
Sets A and B must be represented as two sorted int
arrays.
Repetitive values in A or B not allowed.
- intSetUnion(int[], int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Return the union B + A for integer sets A and B.
Sets A and B must be represented as two sorted integer
arrays.
Repetitive values in A or B not allowed.
- intValue() - Method in class cc.redberry.rings.bigint.BigDecimal
-
Converts this BigDecimal
to an int
.
- intValue() - Method in class cc.redberry.rings.bigint.BigInteger
-
Converts this BigInteger to an int
.
- intValueExact() - Method in class cc.redberry.rings.bigint.BigDecimal
-
Converts this BigDecimal
to an int
, checking
for lost information.
- intValueExact() - Method in class cc.redberry.rings.bigint.BigInteger
-
Converts this BigInteger
to an int
, checking
for lost information.
- inverse(I) - Method in class cc.redberry.rings.ImageRing
-
- inverse(I[]) - Method in class cc.redberry.rings.ImageRing
-
- inverseFunc - Variable in class cc.redberry.rings.ImageRing
-
- IPolynomial<Poly extends IPolynomial<Poly>> - Interface in cc.redberry.rings.poly
-
Parent interface for all polynomials.
- IPolynomialRing<Poly extends IPolynomial<Poly>> - Interface in cc.redberry.rings.poly
-
Polynomial ring.
- IrreduciblePolynomials - Class in cc.redberry.rings.poly.univar
-
Irreducibility tests and generators for random irreducible polynomials.
- irreducibleQ(Poly) - Static method in class cc.redberry.rings.poly.PolynomialMethods
-
Returns whether specified polynomial is irreducible
- irreducibleQ(Poly) - Static method in class cc.redberry.rings.poly.univar.IrreduciblePolynomials
-
Tests whether poly
is irreducible
- isConstant() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Returns true
if this polynomial has only constant term
- isConstant(Term) - Method in interface cc.redberry.rings.poly.multivar.IMonomialAlgebra
-
Whether term is constant
- isConstant() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- isConstant() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- isConstant() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- isEffectiveUnivariate() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns whether this poly is effectively univariate (not more than one variable is non-unit)
- isEmpty() - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Whether this ideal is empty
- isEmpty() - Method in class cc.redberry.rings.util.ListWrapper
-
- isEuclideanRing() - Method in class cc.redberry.rings.AQuotientRing
-
- isEuclideanRing() - Method in class cc.redberry.rings.ImageRing
-
- isEuclideanRing() - Method in class cc.redberry.rings.Integers
-
- isEuclideanRing() - Method in class cc.redberry.rings.IntegersZp
-
- isEuclideanRing() - Method in class cc.redberry.rings.poly.FiniteField
-
- isEuclideanRing() - Method in class cc.redberry.rings.Rationals
-
- isEuclideanRing() - Method in interface cc.redberry.rings.Ring
-
Returns whether this ring is a Euclidean ring
- isField() - Method in class cc.redberry.rings.AQuotientRing
-
- isField() - Method in class cc.redberry.rings.ImageRing
-
- isField() - Method in class cc.redberry.rings.Integers
-
- isField() - Method in class cc.redberry.rings.IntegersZp
-
- isField() - Method in class cc.redberry.rings.poly.FiniteField
-
- isField() - Method in class cc.redberry.rings.Rationals
-
- isField() - Method in interface cc.redberry.rings.Ring
-
Returns whether this ring is a field
- isFinite() - Method in interface cc.redberry.rings.Ring
-
Returns whether this ring is finite
- isFiniteField() - Method in interface cc.redberry.rings.Ring
-
Returns whether this ring is a finite field
- isGradedOrder(Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.MonomialOrder
-
whether monomial order is graded
- isGroebnerBasis(List<Poly>, List<Poly>, Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
Check whether specified generators form Groebner basis of given ideal
- isHomogeneous() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns whether all terms have the same total degree
- isHomogeneous() - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Whether this ideal is homogeneous
- isHomogeneousIdeal(List<? extends AMultivariatePolynomial>) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
Check whether ideal is homogeneous
- isInt() - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns whether this BigInteger
is less then standard java int
.
- isIntegral() - Method in class cc.redberry.rings.Rational
-
Tests whether the denominator is one
- isLong() - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns whether this BigInteger
is less then standard java long
.
- isMinusOne() - Method in class cc.redberry.rings.bigint.BigInteger
-
- isMinusOne(BigInteger) - Method in class cc.redberry.rings.Integers
-
- isMinusOne(E) - Method in interface cc.redberry.rings.Ring
-
Tests whether specified element is minus one
- isMonic() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Returns true
if this polynomial is monic
- isMonic() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- isMonic() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- isMonic() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- isMonomial() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Returns true
if this polynomial has only one monomial term
- isMonomial() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
- isMonomial() - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Whether this ideal is monomial
- isMonomial() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- isMonomialIdeal(List<? extends AMultivariatePolynomial>) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
Check whether all specified generators are monomials
- isOne(E) - Method in class cc.redberry.rings.AQuotientRing
-
- isOne() - Method in class cc.redberry.rings.bigint.BigInteger
-
- isOne(I) - Method in class cc.redberry.rings.ImageRing
-
- isOne(Poly) - Method in class cc.redberry.rings.poly.FiniteField
-
- isOne() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Returns true
if this is one
- isOne(Term) - Method in interface cc.redberry.rings.poly.multivar.IMonomialAlgebra
-
Whether term is one
- isOne(Monomial<E>) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebra
-
- isOne(MonomialZp64) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebraZp64
-
- isOne() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- isOne() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- isOne() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- isOne() - Method in class cc.redberry.rings.Rational
-
Whether this is one
- isOne(Rational) - Method in class cc.redberry.rings.Rationals
-
- isOne(E) - Method in interface cc.redberry.rings.Ring
-
Tests whether specified element is one (exactly)
- isOverField() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Returns whether the coefficient ring of this polynomial is a field
- isOverField() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- isOverField() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- isOverField() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- isOverField() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- isOverField() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- isOverFiniteField() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Returns whether the coefficient ring of this polynomial is a finite field
- isOverFiniteField() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- isOverFiniteField() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- isOverFiniteField() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- isOverFiniteField() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- isOverFiniteField() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- isOverflowAdd(long, long) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
Tests whether the addition of x + y
will cause long overflow
- isOverflowMultiply(long, long) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
Tests whether the multiplication of x*y
will cause long overflow
- isOverPerfectPower() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Returns whether the coefficientRingCardinality()
is a perfect power
- isOverPerfectPower() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- isOverPerfectPower() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- isOverPerfectPower() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- isOverPerfectPower() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- isOverPerfectPower() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- isOverQ(T) - Static method in class cc.redberry.rings.poly.Util
-
Whether coefficient domain is Q
- isOverRationals(T) - Static method in class cc.redberry.rings.poly.Util
-
Whether coefficient domain is rationals
- isOverZ() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Returns whether the coefficient ring of this polynomial is Z
- isOverZ() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- isOverZ() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- isOverZ() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- isOverZ() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- isOverZ() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- isPerfectPower() - Method in class cc.redberry.rings.AQuotientRing
-
- isPerfectPower() - Method in class cc.redberry.rings.ARing
-
- isPerfectPower() - Method in class cc.redberry.rings.ImageRing
-
- isPerfectPower() - Method in class cc.redberry.rings.IntegersZp64
-
Returns whether the modulus is a perfect power
- isPerfectPower() - Method in class cc.redberry.rings.Rationals
-
- isPerfectPower() - Method in interface cc.redberry.rings.Ring
-
Returns whether the cardinality is a perfect power (p^k with k > 1)
- isPrime(long) - Static method in class cc.redberry.rings.primes.BigPrimes
-
Strong primality test.
- isPrime(BigInteger) - Static method in class cc.redberry.rings.primes.BigPrimes
-
Strong primality test.
- isPrime(int) - Method in class cc.redberry.rings.primes.SieveOfAtkin
-
- isPrime(int) - Static method in class cc.redberry.rings.primes.SmallPrimes
-
Primality test: tells if the argument is a (provable) prime or not.
- isPrincipal() - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Whether this ideal is principal
- isProbablePrime(int) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns true
if this BigInteger is probably prime,
false
if it's definitely composite.
- isProper() - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Whether this is a proper ideal
- isPureDegreeVector(Term) - Method in interface cc.redberry.rings.poly.multivar.IMonomialAlgebra
-
Whether term has unit coefficient
- isPureDegreeVector(Monomial<E>) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebra
-
- isPureDegreeVector(MonomialZp64) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebraZp64
-
- isSquareFree(Poly) - Static method in class cc.redberry.rings.poly.multivar.MultivariateSquareFreeFactorization
-
Tests whether the given poly
is square free.
- isSquareFree(T) - Static method in class cc.redberry.rings.poly.univar.UnivariateSquareFreeFactorization
-
Returns true
if poly
is square-free and false
otherwise
- isTrivial() - Method in class cc.redberry.rings.FactorDecomposition
-
Whether this is a trivial factorization (contains only one factor)
- isTrivial() - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Whether this ideal is the whole ring (basis consists of pne constant polynomial)
- isUnit(E) - Method in class cc.redberry.rings.AQuotientRing
-
- isUnit(E) - Method in class cc.redberry.rings.FactorDecomposition
-
- isUnit(I) - Method in class cc.redberry.rings.ImageRing
-
- isUnit(BigInteger) - Method in class cc.redberry.rings.Integers
-
- isUnit(BigInteger) - Method in class cc.redberry.rings.IntegersZp
-
- isUnit(Poly) - Method in class cc.redberry.rings.poly.FiniteField
-
- isUnit(Term) - Method in interface cc.redberry.rings.poly.multivar.IMonomialAlgebra
-
Whether term is unit
- isUnit(Monomial<E>) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebra
-
- isUnit(MonomialZp64) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebraZp64
-
- isUnit(Poly) - Method in class cc.redberry.rings.poly.PolynomialFactorDecomposition
-
- isUnit(Rational) - Method in class cc.redberry.rings.Rationals
-
- isUnit(E) - Method in interface cc.redberry.rings.Ring
-
Tests whether specified element is a ring unit
- isUnitCC() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Returns true if constant term is equal to one
- isUnitCC() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- isUnitCC() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- isUnitCC() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- isUnitOrZero(E) - Method in interface cc.redberry.rings.Ring
-
Tests whether specified element is a ring unit or zero
- isZero(E) - Method in class cc.redberry.rings.AQuotientRing
-
- isZero() - Method in class cc.redberry.rings.bigint.BigInteger
-
- isZero(I) - Method in class cc.redberry.rings.ImageRing
-
- isZero(Poly) - Method in class cc.redberry.rings.poly.FiniteField
-
- isZero() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Returns true
if this is zero
- isZero() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
- isZero(Term) - Method in interface cc.redberry.rings.poly.multivar.IMonomialAlgebra
-
Whether term is zero
- isZero(Monomial<E>) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebra
-
- isZero(MonomialZp64) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebraZp64
-
- isZero() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- isZero() - Method in class cc.redberry.rings.Rational
-
Whether this is zero
- isZero(Rational) - Method in class cc.redberry.rings.Rationals
-
- isZero(E) - Method in interface cc.redberry.rings.Ring
-
Tests whether specified element is zero
- isZeroAt(int) - Method in interface cc.redberry.rings.poly.univar.IUnivariatePolynomial
-
Returns whether i-th coefficient of this is zero
- isZeroAt(int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- isZeroVector() - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Returns whether all exponents are zero
- iterableWithUnit() - Method in class cc.redberry.rings.FactorDecomposition
-
Iterator over all factors including a unit one
- iterator() - Method in class cc.redberry.rings.AQuotientRing
-
- iterator() - Method in class cc.redberry.rings.FactorDecomposition
-
- iterator() - Method in class cc.redberry.rings.ImageRing
-
- iterator() - Method in class cc.redberry.rings.Integers
-
- iterator() - Method in class cc.redberry.rings.IntegersZp
-
- iterator() - Method in class cc.redberry.rings.poly.FiniteField
-
Returns iterator over all field elements
- iterator() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
- iterator() - Method in class cc.redberry.rings.poly.multivar.MonomialSet
-
- iterator() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- iterator() - Method in class cc.redberry.rings.Rationals
-
- iterator() - Method in interface cc.redberry.rings.Ring
-
Returns iterator over ring elements (for finite rings, otherwise throws exception)
- iterator() - Method in class cc.redberry.rings.util.ListWrapper
-
- IUnivariatePolynomial<Poly extends IUnivariatePolynomial<Poly>> - Interface in cc.redberry.rings.poly.univar
-
Parent interface for univariate polynomials.
- last() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
- last() - Method in class cc.redberry.rings.poly.multivar.MonomialSet
-
Last monomial in this set
- lastIndexOf(Object) - Method in class cc.redberry.rings.util.ListWrapper
-
- lastPrime() - Method in class cc.redberry.rings.primes.SieveOfAtkin
-
Returns the last prime in this sieve
- lc(int) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns the leading coefficient of this viewed as R[other_variables][variable]
- lc() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Returns the leading coefficient of this polynomial that is coefficient of the largest term according to the
ordering.
- lc(Comparator<DegreeVector>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Returns the leading coefficient of this polynomial with respect to specified ordering
- lc() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Returns the leading coefficient of this polynomial that is coefficient of the largest term according to the
ordering.
- lc(Comparator<DegreeVector>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Returns the leading coefficient of this polynomial with respect to specified ordering
- lc() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Returns the leading coefficient
- lcAsPoly() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Returns the leading coefficient as a constant poly
- lcAsPoly(Comparator<DegreeVector>) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns the leading coefficient with respect to specified ordering as a constant poly
- lcAsPoly() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- lcAsPoly(Comparator<DegreeVector>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- lcAsPoly() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- lcAsPoly(Comparator<DegreeVector>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- lcAsPoly() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- lcm(I, I) - Method in class cc.redberry.rings.ImageRing
-
- lcm(long, long) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
Returns the least common multiple of two longs
- lcm(int, int) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
Returns the least common multiple of two integers
- lcm(E, E) - Method in interface cc.redberry.rings.Ring
-
Returns the least common multiple of two elements
- lcm(E...) - Method in interface cc.redberry.rings.Ring
-
Returns the least common multiple of two elements
- lcm(Iterable<E>) - Method in interface cc.redberry.rings.Ring
-
Returns the least common multiple of two elements
- leadTermsSet(List<? extends AMultivariatePolynomial>) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
List of lead terms of generators
- LEX - Static variable in class cc.redberry.rings.poly.multivar.MonomialOrder
-
Lexicographic monomial order.
- lift() - Method in class cc.redberry.rings.poly.univar.HenselLifting.bLinearLift
-
- lift() - Method in interface cc.redberry.rings.poly.univar.HenselLifting.LiftableQuintet
-
Performs single lift step.
- lift(int) - Method in interface cc.redberry.rings.poly.univar.HenselLifting.LiftableQuintet
-
Lifts nIterations
times.
- lift() - Method in class cc.redberry.rings.poly.univar.HenselLifting.lLinearLift
-
- liftFactorization(long, long, UnivariatePolynomialZ64, List<UnivariatePolynomialZp64>, boolean) - Static method in class cc.redberry.rings.poly.univar.HenselLifting
-
Lifts modular factorization until modulus
will overcome desiredBound
.
- liftFactorization(long, long, int, UnivariatePolynomialZ64, List<UnivariatePolynomialZp64>, boolean) - Static method in class cc.redberry.rings.poly.univar.HenselLifting
-
Lifts modular factorization nIterations
times using whether linear or quadratic lifting.
- liftFactorization(BigInteger, BigInteger, UnivariatePolynomial<BigInteger>, List<UnivariatePolynomialZp64>, boolean) - Static method in class cc.redberry.rings.poly.univar.HenselLifting
-
Lifts modular factorization until modulus
will overcome desiredBound
.
- liftFactorization(BigInteger, BigInteger, UnivariatePolynomial<BigInteger>, List<UnivariatePolynomialZp64>) - Static method in class cc.redberry.rings.poly.univar.HenselLifting
-
Lifts modular factorization until modulus
will overcome desiredBound
.
- liftFactorizationQuadratic(BigInteger, BigInteger, UnivariatePolynomial<BigInteger>, List<UnivariatePolynomial<BigInteger>>) - Static method in class cc.redberry.rings.poly.univar.HenselLifting
-
Lifts modular factorization until modulus
will overcome desiredBound
.
- liftLast() - Method in class cc.redberry.rings.poly.univar.HenselLifting.bLinearLift
-
- liftLast() - Method in interface cc.redberry.rings.poly.univar.HenselLifting.LiftableQuintet
-
Performs single lift step but don't lift co-factors (xgcd coefficients).
- liftLast() - Method in class cc.redberry.rings.poly.univar.HenselLifting.lLinearLift
-
- liftWithCoFactors(int) - Method in interface cc.redberry.rings.poly.univar.HenselLifting.LiftableQuintet
-
Lifts nIterations
times.
- linear(long, long, long) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
Creates linear polynomial of form cc + x * lc
- LinearSolver - Class in cc.redberry.rings.linear
-
Solver for quadratic linear system
- LinearSolver.SystemInfo - Enum in cc.redberry.rings.linear
-
Info about linear system
- list - Variable in class cc.redberry.rings.util.ListWrapper
-
Inner list
- listIterator() - Method in class cc.redberry.rings.util.ListWrapper
-
- listIterator(int) - Method in class cc.redberry.rings.util.ListWrapper
-
- ListWrapper<Poly> - Class in cc.redberry.rings.util
-
A simple list wrapper
- ListWrapper(List<Poly>) - Constructor for class cc.redberry.rings.util.ListWrapper
-
- LONG_MAX_VALUE - Static variable in class cc.redberry.rings.bigint.BigInteger
-
The BigInteger constant Long.MAX_VALUE.
- longValue() - Method in class cc.redberry.rings.bigint.BigDecimal
-
Converts this BigDecimal
to a long
.
- longValue() - Method in class cc.redberry.rings.bigint.BigInteger
-
Converts this BigInteger to a long
.
- longValueExact() - Method in class cc.redberry.rings.bigint.BigDecimal
-
Converts this BigDecimal
to a long
, checking
for lost information.
- longValueExact() - Method in class cc.redberry.rings.bigint.BigInteger
-
Converts this BigInteger
to a long
, checking
for lost information.
- lPrecomputedPowers(long, IntegersZp64) - Constructor for class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64.lPrecomputedPowers
-
- lPrecomputedPowers(int, long, IntegersZp64) - Constructor for class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64.lPrecomputedPowers
-
- lPrecomputedPowersHolder(IntegersZp64, MultivariatePolynomialZp64.lPrecomputedPowers[]) - Constructor for class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64.lPrecomputedPowersHolder
-
- lQuadraticLift(long, UnivariatePolynomialZ64, UnivariatePolynomialZp64, UnivariatePolynomialZp64, UnivariatePolynomialZp64, UnivariatePolynomialZp64) - Constructor for class cc.redberry.rings.poly.univar.HenselLifting.lQuadraticLift
-
- lt(Comparator<DegreeVector>) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns the leading term in this polynomial according to specified ordering
- lt() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns the leading term in this polynomial according to ordering
- ltAsPoly() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns the leading term in this polynomial according to ordering
- ltIdeal() - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Ideal of leading terms
- LucasPrimalityTest(BigInteger, int, RandomGenerator) - Static method in class cc.redberry.rings.primes.BigPrimes
-
- MachineArithmetic - Class in cc.redberry.rings.poly
-
Helper methods for arithmetic with machine numbers.
- magic - Variable in class cc.redberry.rings.IntegersZp64
-
magic
- magic32MulMod - Variable in class cc.redberry.rings.IntegersZp64
-
magic
- map(Ring<O>, Function<E, O>) - Method in class cc.redberry.rings.Rational
-
Maps rational to a new ring
- mapCoefficients(Ring<T>, Function<E, T>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Maps coefficients of this using specified mapping function
- mapCoefficients(IntegersZp64, ToLongFunction<E>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Maps coefficients of this using specified mapping function
- mapCoefficients(Ring<T>, LongFunction<T>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Maps coefficients of this using specified mapping function
- mapCoefficients(Ring<T>, Function<E, T>) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Applies transformation function to this and returns the result.
- mapCoefficients(IntegersZp64, ToLongFunction<E>) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Applies transformation function to this and returns the result.
- mapTerms(Ring<T>, Function<Monomial<E>, Monomial<T>>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Maps terms of this using specified mapping function
- mapTerms(Ring<T>, Function<MonomialZp64, Monomial<T>>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Maps terms of this using specified mapping function
- mapTo(Ring<R>, Function<E, R>) - Method in class cc.redberry.rings.FactorDecomposition
-
- mapTo(Function<Poly, OthPoly>) - Method in class cc.redberry.rings.poly.PolynomialFactorDecomposition
-
- MathContext - Class in cc.redberry.rings.bigint
-
Immutable objects which encapsulate the context settings which
describe certain rules for numerical operators, such as those
implemented by the
BigDecimal
class.
- MathContext(int) - Constructor for class cc.redberry.rings.bigint.MathContext
-
Constructs a new
MathContext
with the specified
precision and the
HALF_UP
rounding
mode.
- MathContext(int, RoundingMode) - Constructor for class cc.redberry.rings.bigint.MathContext
-
Constructs a new MathContext
with a specified
precision and rounding mode.
- MathContext(String) - Constructor for class cc.redberry.rings.bigint.MathContext
-
Constructs a new MathContext
from a string.
- max(BigDecimal) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns the maximum of this BigDecimal
and val
.
- max(BigInteger) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns the maximum of this BigInteger and val
.
- max(BigInteger, BigInteger) - Static method in class cc.redberry.rings.bigint.BigIntegerUtil
-
- max(E, E) - Method in interface cc.redberry.rings.Ring
-
Returns the max value (no copy)
- max(int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- max(long[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- max(int[], int, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- max(int[], int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- MAX_DEGREE_OF_RANDOM_POLY - Static variable in class cc.redberry.rings.poly.UnivariateRing
-
- MAX_KATSURA - Static variable in class cc.redberry.rings.poly.multivar.GroebnerBasisData
-
- MAX_SUPPORTED_MODULUS - Static variable in class cc.redberry.rings.poly.MachineArithmetic
-
Max supported modulus which fits into machine word
- MAX_SUPPORTED_MODULUS_BITS - Static variable in class cc.redberry.rings.poly.MachineArithmetic
-
Max supported modulus bits which fits into machine word
- maxAbsCoefficient() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Returns max abs coefficient of the poly
- merge(MultivariatePolynomial<Poly>, int...) - Static method in class cc.redberry.rings.poly.multivar.MultivariateConversions
-
Given poly in R[variables][other_variables] converts it to poly in R[x1,x2,...,xN]
- merge(IPolynomialRing<MultivariatePolynomial<Poly>>, int...) - Static method in class cc.redberry.rings.poly.multivar.MultivariateConversions
-
Given poly in R[x1,x2,...,xN] converts to poly in R[variables][other_variables]
- mignotteBound(UnivariatePolynomial<BigInteger>) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Returns Mignotte's bound (sqrt(n+1) * 2^n max |this|) of the poly
- mignotteBound() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
Returns Mignotte's bound (sqrt(n+1) * 2^n max |this|)
- millerRabinPrimeTest(int) - Static method in class cc.redberry.rings.primes.SmallPrimes
-
Miller-Rabin probabilistic primality test for int type, used in such a way that a result is always guaranteed.
- min(BigDecimal) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns the minimum of this BigDecimal
and
val
.
- min(BigInteger) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns the minimum of this BigInteger and val
.
- min(E, E) - Method in interface cc.redberry.rings.Ring
-
Returns the min value (no copy)
- min(int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- min(long[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- min(int[], int, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- min(int[], int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- MIN_DEGREE_OF_RANDOM_POLY - Static variable in class cc.redberry.rings.poly.UnivariateRing
-
- MIN_KATSURA - Static variable in class cc.redberry.rings.poly.multivar.GroebnerBasisData
-
- minimizeGroebnerBases(List<Poly>) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
Minimizes Groebner basis.
- mkPrecomputedPowers(int, E) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- mkPrecomputedPowers(int[], E[]) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- mkPrecomputedPowers(int, Ring<E>, int[], E[]) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- mkPrecomputedPowers(E[]) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- mkPrecomputedPowers(int, long) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- mkPrecomputedPowers(int[], long[]) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- mkPrecomputedPowers(int, IntegersZp64, int[], long[]) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- mkPrecomputedPowers(long[]) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- mod(E) - Method in class cc.redberry.rings.AQuotientRing
-
modulo operation
- mod(BigInteger) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is (this mod m
).
- mod(long, long) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
- mod(Poly) - Method in class cc.redberry.rings.poly.QuotientRing
-
- mod(Poly) - Method in class cc.redberry.rings.poly.UnivariateQuotientRing
-
- modInverse(BigInteger) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is (this
-1 mod m)
.
- modInverse(long, long) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
Returns a solution of congruence num * x = 1 mod modulus
- modPow(BigInteger, BigInteger) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is
(thisexponent mod m).
- ModularComposition - Class in cc.redberry.rings.poly.univar
-
Univariate polynomial modular composition.
- ModularExtendedGCD(UnivariatePolynomial<Rational<BigInteger>>, UnivariatePolynomial<Rational<BigInteger>>) - Static method in class cc.redberry.rings.poly.univar.UnivariateGCD
-
Modular GCD algorithm for polynomials over Z.
- ModularGB(List<MultivariatePolynomial<BigInteger>>, Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
Modular Groebner basis algorithm.
- ModularGB(List<MultivariatePolynomial<BigInteger>>, Comparator<DegreeVector>, GroebnerBasis.HilbertSeries) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
Modular Groebner basis algorithm.
- ModularGB(List<MultivariatePolynomial<BigInteger>>, Comparator<DegreeVector>, GroebnerBasis.HilbertSeries, boolean) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
Modular Groebner basis algorithm.
- ModularGB(List<MultivariatePolynomial<BigInteger>>, Comparator<DegreeVector>, GroebnerBasis.GroebnerAlgorithm, GroebnerBasis.GroebnerAlgorithm, BigInteger, GroebnerBasis.HilbertSeries, boolean) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
Modular Groebner basis algorithm.
- ModularGCD(UnivariatePolynomialZ64, UnivariatePolynomialZ64) - Static method in class cc.redberry.rings.poly.univar.UnivariateGCD
-
Modular GCD algorithm for polynomials over Z.
- ModularGCD(UnivariatePolynomial<BigInteger>, UnivariatePolynomial<BigInteger>) - Static method in class cc.redberry.rings.poly.univar.UnivariateGCD
-
Modular GCD algorithm for polynomials over Z.
- ModularGCDInZ(MultivariatePolynomial<BigInteger>, MultivariatePolynomial<BigInteger>, BiFunction<MultivariatePolynomialZp64, MultivariatePolynomialZp64, MultivariatePolynomialZp64>) - Static method in class cc.redberry.rings.poly.multivar.MultivariateGCD
-
Modular GCD algorithm for polynomials over Z.
- modulus - Variable in class cc.redberry.rings.IntegersZp
-
The modulus.
- modulus(BigInteger) - Method in class cc.redberry.rings.IntegersZp
-
Returns val mod this.modulus
- modulus - Variable in class cc.redberry.rings.IntegersZp64
-
the modulus
- modulus(long) - Method in class cc.redberry.rings.IntegersZp64
-
Returns val % this.modulus
- modulus(BigInteger) - Method in class cc.redberry.rings.IntegersZp64
-
Returns val % this.modulus
- modulus(long[]) - Method in class cc.redberry.rings.IntegersZp64
-
Inplace sets elements of data
to data % this.modulus
- modulus - Variable in class cc.redberry.rings.poly.univar.HenselLifting.lLinearLift
-
The modulus
- modulus - Variable in class cc.redberry.rings.poly.univar.HenselLifting.lQuadraticLift
-
The modulus
- modulus(long, boolean) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
Reduces this polynomial modulo modulus
and returns the result.
- modulus(long) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
Reduces (copied) polynomial modulo modulus
and returns the result.
- modulus(IntegersZp64, boolean) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
Reduces this polynomial modulo modulus
and returns the result.
- modulus(IntegersZp64) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
Reduces (copied) polynomial modulo modulus
and returns the result.
- modulus() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
Returns the modulus
- modulus - Variable in class cc.redberry.rings.poly.UnivariateQuotientRing
-
- modulusFits32 - Variable in class cc.redberry.rings.IntegersZp64
-
whether modulus less then 2^32 (if so, faster mulmod available)
- monic() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Sets this
to its monic part (that is this
divided by its leading coefficient), or returns null
(causing loss of internal data) if some of the elements can't be exactly divided by the lc()
.
- monic(Comparator<DegreeVector>) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Make this poly monic considering leading term with respect to given ordering
- monic() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Makes this polynomial monic if possible, if not -- destroys this and returns null
- monic(Comparator<DegreeVector>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- monic(E) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Sets this
to its monic part multiplied by the factor
modulo modulus
(that is monic(modulus).multiply(factor)
).
- monic(Comparator<DegreeVector>, E) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Sets this
to its monic part (with respect to given ordering) multiplied by the given factor;
- monic() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Makes this polynomial monic
- monic(Comparator<DegreeVector>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- monic(long) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Sets this
to its monic part (with respect to given ordering) multiplied by the given factor;
- monic(Comparator<DegreeVector>, long) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Sets this
to its monic part (with respect to given ordering) multiplied by the given factor;
- monic() - Method in class cc.redberry.rings.poly.PolynomialFactorDecomposition
-
- monic() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- monic(E) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Sets this
to its monic part multiplied by the factor
.
- monic() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- monic(long) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- monic() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- monic(long) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
Sets this
to its monic part multiplied by the factor
(that is monic(modulus).multiply(factor)
).
- monicExact() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Sets this
to its monic part (that is this
divided by its leading coefficient), or throws ArithmeticException
if some of the elements can't be exactly divided by the l.c.
- monicExtendedEuclid(Poly, Poly) - Static method in class cc.redberry.rings.poly.univar.DiophantineEquations
-
runs xgcd for coprime polynomials ensuring that gcd is 1 (not another constant)
- monicWithLC(Poly) - Method in interface cc.redberry.rings.poly.IPolynomial
-
Sets this
to its monic part multiplied by the leading coefficient of other
;
- monicWithLC(Comparator<DegreeVector>, Poly) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Sets this
to its monic part multiplied by the leading coefficient of other
with respect to given
ordering
- monicWithLC(MultivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- monicWithLC(Comparator<DegreeVector>, MultivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- monicWithLC(MultivariatePolynomialZp64) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- monicWithLC(Comparator<DegreeVector>, MultivariatePolynomialZp64) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- monicWithLC(UnivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- Monomial<E> - Class in cc.redberry.rings.poly.multivar
-
Monomial with coefficient from generic ring
- Monomial(DegreeVector, E) - Constructor for class cc.redberry.rings.poly.multivar.Monomial
-
- Monomial(int[], int, E) - Constructor for class cc.redberry.rings.poly.multivar.Monomial
-
- Monomial(int[], E) - Constructor for class cc.redberry.rings.poly.multivar.Monomial
-
- Monomial(int, E) - Constructor for class cc.redberry.rings.poly.multivar.Monomial
-
- monomial(long, int) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
Creates monomial coefficient * x^exponent
- monomial(long, long, int) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
Creates monomial coefficient * x^exponent
- monomialAlgebra - Variable in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Monomial algebra
- MonomialAlgebra(Ring<E>) - Constructor for class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebra
-
- MonomialAlgebraZp64(IntegersZp64) - Constructor for class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebraZp64
-
- monomialContent() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns the monomial content of this polynomial
- MonomialOrder - Class in cc.redberry.rings.poly.multivar
-
Common monomial orderings.
- MonomialOrder.GrevLexWithPermutation - Class in cc.redberry.rings.poly.multivar
-
- MonomialSet<Term extends AMonomial<Term>> - Class in cc.redberry.rings.poly.multivar
-
Sorted set of monomials -- basic underlying data structure of multivariate polynomials.
- MonomialSet(Comparator<? super DegreeVector>) - Constructor for class cc.redberry.rings.poly.multivar.MonomialSet
-
- MonomialSet(SortedMap<DegreeVector, ? extends Term>) - Constructor for class cc.redberry.rings.poly.multivar.MonomialSet
-
Constructs a new monomial set containing the same mappings and using the same ordering as the specified sorted
map.
- MonomialZp64 - Class in cc.redberry.rings.poly.multivar
-
Monomial with coefficient from Zp with p < 2^64
- MonomialZp64(DegreeVector, long) - Constructor for class cc.redberry.rings.poly.multivar.MonomialZp64
-
- MonomialZp64(int[], int, long) - Constructor for class cc.redberry.rings.poly.multivar.MonomialZp64
-
- MonomialZp64(int[], long) - Constructor for class cc.redberry.rings.poly.multivar.MonomialZp64
-
- MonomialZp64(int, long) - Constructor for class cc.redberry.rings.poly.multivar.MonomialZp64
-
- movePointLeft(int) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
which is equivalent to this one
with the decimal point moved n
places to the left.
- movePointRight(int) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
which is equivalent to this one
with the decimal point moved n
places to the right.
- multidegree() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns the multidegree of this polynomial i.e.
- multiply(E, E) - Method in class cc.redberry.rings.AQuotientRing
-
- multiply(BigDecimal) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is (this ×
multiplicand), and whose scale is (this.scale() +
multiplicand.scale())
.
- multiply(BigDecimal, MathContext) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is (this ×
multiplicand), with rounding according to the context settings.
- multiply(BigInteger) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is (this * val)
.
- multiply(BigInteger, int) - Method in class cc.redberry.rings.bigint.BigInteger
-
Multiplies this
number by another using a specified number of
threads if the inputs are sufficiently large.
- multiply() - Method in class cc.redberry.rings.FactorDecomposition
-
Multiply factors
- multiply(I, I) - Method in class cc.redberry.rings.ImageRing
-
- multiply(I...) - Method in class cc.redberry.rings.ImageRing
-
- multiply(BigInteger, BigInteger) - Method in class cc.redberry.rings.Integers
-
- multiply(BigInteger, BigInteger) - Method in class cc.redberry.rings.IntegersZp
-
- multiply(long, long) - Method in class cc.redberry.rings.IntegersZp64
-
Multiply mod operation
- multiply(Poly, Poly) - Method in class cc.redberry.rings.poly.FiniteField
-
- multiply(Poly) - Method in interface cc.redberry.rings.poly.IPolynomial
-
Multiplies this by oth
- multiply(Poly...) - Method in interface cc.redberry.rings.poly.IPolynomial
-
Multiplies this by oth
- multiply(Iterable<Poly>) - Method in interface cc.redberry.rings.poly.IPolynomial
-
Multiplies this by oth
- multiply(long) - Method in interface cc.redberry.rings.poly.IPolynomial
-
Multiplies this by factor
- multiply(DegreeVector) - Method in class cc.redberry.rings.poly.multivar.AMonomial
-
Multiplies this by oth
- multiply(int[]) - Method in class cc.redberry.rings.poly.multivar.AMonomial
-
Multiplies this by oth
- multiply(Term) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Multiplies this
by the monomial
- multiply(Ideal<Term, Poly>) - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Returns the product of this and oth
- multiply(Poly) - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Returns the product of this and oth
- multiply(Monomial<E>, Monomial<E>) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebra
-
- multiply(MonomialZp64, MonomialZp64) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebraZp64
-
- multiply(Term, Term) - Method in interface cc.redberry.rings.poly.multivar.IMonomialAlgebra
-
Multiplies two terms
- multiply(E) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Multiplies this
by the factor
- multiply(Monomial<E>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- multiply(long) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- multiply(MultivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- multiply(long) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- multiply(MonomialZp64) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- multiply(MultivariatePolynomialZp64) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- multiply(E) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Multiplies this
by the factor
- multiply(long) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- multiply(UnivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- multiply(UnivariatePolynomialZ64) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- multiply(UnivariatePolynomialZp64) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- multiply(E) - Method in class cc.redberry.rings.Rational
-
Multiply this by other
- multiply(long) - Method in class cc.redberry.rings.Rational
-
Multiply this by other
- multiply(Rational<E>) - Method in class cc.redberry.rings.Rational
-
Multiply this by other
- multiply(Rational<E>, Rational<E>) - Method in class cc.redberry.rings.Rationals
-
- multiply(E, E) - Method in interface cc.redberry.rings.Ring
-
Multiplies two elements
- multiply(E, long) - Method in interface cc.redberry.rings.Ring
-
Multiplies two elements
- multiply(E...) - Method in interface cc.redberry.rings.Ring
-
Multiplies the array of elements
- multiply(Iterable<E>) - Method in interface cc.redberry.rings.Ring
-
Multiplies the array of elements
- multiply(int[], int, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- multiplyByBigInteger(BigInteger) - Method in interface cc.redberry.rings.poly.IPolynomial
-
Multiplies this by factor
- multiplyByBigInteger(BigInteger) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- multiplyByBigInteger(BigInteger) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- multiplyByBigInteger(BigInteger) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- multiplyByBigInteger(BigInteger) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- multiplyByBigInteger(BigInteger) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- multiplyByDegreeVector(DegreeVector) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Multiplies this
by the degree vector
- multiplyByLC(Poly) - Method in interface cc.redberry.rings.poly.IPolynomial
-
Multiply this by the leading coefficient of other
- multiplyByLC(MultivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- multiplyByLC(MultivariatePolynomialZp64) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- multiplyByLC(UnivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- multiplyByMonomial(int, int) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Multiplies this by variable^exponent
- multiplyIgnoreExponents() - Method in class cc.redberry.rings.FactorDecomposition
-
Multiply with no account for exponents
- multiplyMutable(Poly, Poly) - Method in class cc.redberry.rings.poly.FiniteField
-
- multiplyMutable(E, E) - Method in interface cc.redberry.rings.Ring
-
Multiplies two elements and destroys the initial content of a
- multiplyParallel(BigInteger) - Method in class cc.redberry.rings.bigint.BigInteger
-
Multiplies this
number by another using multiple threads if the
numbers are sufficiently large.
- multiplyToDouble(int[], int, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- multiplyToDouble(int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- MultivariateConversions - Class in cc.redberry.rings.poly.multivar
-
- MultivariateDivision - Class in cc.redberry.rings.poly.multivar
-
Division with remainder of multivariate polynomials (multivariate reduction).
- MultivariateFactorization - Class in cc.redberry.rings.poly.multivar
-
Factorization of multivariate polynomials.
- MultivariateGCD - Class in cc.redberry.rings.poly.multivar
-
Multivariate polynomial GCD
- MultivariateInterpolation - Class in cc.redberry.rings.poly.multivar
-
Multivariate interpolation
- MultivariateInterpolation.Interpolation<E> - Class in cc.redberry.rings.poly.multivar
-
Updatable Newton interpolation
- MultivariateInterpolation.InterpolationZp64 - Class in cc.redberry.rings.poly.multivar
-
Updatable Newton interpolation
- multivariateLiftAutomaticLC(Poly, Poly[], HenselLifting.IEvaluation<Term, Poly>) - Static method in class cc.redberry.rings.poly.multivar.HenselLifting
-
Multivariate lift with automatic leading coefficient correction
- multivariateLiftAutomaticLC(Poly, Poly[], HenselLifting.IEvaluation<Term, Poly>, int) - Static method in class cc.redberry.rings.poly.multivar.HenselLifting
-
Multivariate lift with automatic leading coefficient correction
- MultivariatePolynomial<E> - Class in cc.redberry.rings.poly.multivar
-
- MultivariatePolynomial.HornerForm<E> - Class in cc.redberry.rings.poly.multivar
-
A representation of multivariate polynomial specifically optimized for fast evaluation of given variables
- MultivariatePolynomial.PrecomputedPowersHolder<E> - Class in cc.redberry.rings.poly.multivar
-
holds an array of precomputed powers
- MultivariatePolynomialZp64 - Class in cc.redberry.rings.poly.multivar
-
- MultivariatePolynomialZp64.HornerFormZp64 - Class in cc.redberry.rings.poly.multivar
-
A representation of multivariate polynomial specifically optimized for fast evaluation of given variables
- MultivariatePolynomialZp64.lPrecomputedPowers - Class in cc.redberry.rings.poly.multivar
-
cached powers used to save some time
- MultivariatePolynomialZp64.lPrecomputedPowersHolder - Class in cc.redberry.rings.poly.multivar
-
holds an array of precomputed powers
- MultivariateRing<Poly extends AMultivariatePolynomial<?,Poly>> - Class in cc.redberry.rings.poly
-
Ring of multivariate polynomials.
- MultivariateRing(Poly) - Constructor for class cc.redberry.rings.poly.MultivariateRing
-
Creates ring of multivariate polynomials which support operations over multivariate polynomials of the type and
number of variables same as of provided factory
polynomial
- MultivariateRing(int, Ring<E>, Comparator<DegreeVector>) - Static method in class cc.redberry.rings.Rings
-
Ring of multivariate polynomials with specified number of variables over specified coefficient ring
- MultivariateRing(int, Ring<E>) - Static method in class cc.redberry.rings.Rings
-
Ring of multivariate polynomials with specified number of variables over specified coefficient ring
- MultivariateRing(Poly) - Static method in class cc.redberry.rings.Rings
-
Ring of multivariate polynomials with specified factory
- MultivariateRingGF(int, FiniteField<uPoly>) - Static method in class cc.redberry.rings.Rings
-
Ring of multivariate polynomials over Galois Field (GF[x1, x2, ...])
- MultivariateRingQ(int) - Static method in class cc.redberry.rings.Rings
-
Ring of multivariate polynomials over rationals (Q[x1, x2, ...])
- MultivariateRingZ(int) - Static method in class cc.redberry.rings.Rings
-
Ring of multivariate polynomials over integers (Z[x1, x2, ...])
- MultivariateRingZp(int, BigInteger) - Static method in class cc.redberry.rings.Rings
-
Ring of multivariate polynomials over Zp integers (Zp[x1, x2, ...]) with arbitrary large modulus
- MultivariateRingZp64(int, long, Comparator<DegreeVector>) - Static method in class cc.redberry.rings.Rings
-
Ring of multivariate polynomials over Zp integers (Zp[x1, x2, ...])
- MultivariateRingZp64(int, long) - Static method in class cc.redberry.rings.Rings
-
Ring of multivariate polynomials over Zp machine integers (Zp[x1, x2, ...])
- MultivariateRingZp64(int, IntegersZp64, Comparator<DegreeVector>) - Static method in class cc.redberry.rings.Rings
-
Ring of multivariate polynomials over Zp integers (Zp[x1, x2, ...])
- MultivariateRingZp64(int, IntegersZp64) - Static method in class cc.redberry.rings.Rings
-
Ring of multivariate polynomials over Zp integers (Zp[x1, x2, ...])
- MultivariateSquareFreeFactorization - Class in cc.redberry.rings.poly.multivar
-
- nanosecondsToString(long) - Static method in class cc.redberry.rings.util.TimeUnits
-
- nBasisGenerators() - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Returns the number of elements in Groebner basis
- negate(E) - Method in class cc.redberry.rings.AQuotientRing
-
- negate() - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is (-this)
,
and whose scale is this.scale()
.
- negate(MathContext) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is (-this)
,
with rounding according to the context settings.
- negate() - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is (-this)
.
- negate(I) - Method in class cc.redberry.rings.ImageRing
-
- negate(BigInteger) - Method in class cc.redberry.rings.Integers
-
- negate(BigInteger) - Method in class cc.redberry.rings.IntegersZp
-
- negate(long) - Method in class cc.redberry.rings.IntegersZp64
-
Negate mod operation
- negate(Poly) - Method in class cc.redberry.rings.poly.FiniteField
-
- negate() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Negates this and returns
- negate() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
- negate(Monomial<E>) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebra
-
- negate(MonomialZp64) - Method in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebraZp64
-
- negate(Term) - Method in interface cc.redberry.rings.poly.multivar.IMonomialAlgebra
-
Negates term
- negate() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- negate() - Method in class cc.redberry.rings.Rational
-
Negates this
- negate(Rational<E>) - Method in class cc.redberry.rings.Rationals
-
- negate(E) - Method in interface cc.redberry.rings.Ring
-
Negates the given element
- negate(int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- negate(long[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- negate(BigInteger[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- negateMutable(Poly) - Method in class cc.redberry.rings.poly.FiniteField
-
- negateMutable(E) - Method in interface cc.redberry.rings.Ring
-
Negates the given element and destroys the initial content of element
- NEGATIVE_ONE - Static variable in class cc.redberry.rings.bigint.BigInteger
-
The BigInteger constant -1.
- NEGATIVE_TWO - Static variable in class cc.redberry.rings.bigint.BigInteger
-
The BigInteger constant negative two.
- nextInt(int, int) - Method in class cc.redberry.rings.util.RandomDataGenerator
-
- nextLong(long, long) - Method in class cc.redberry.rings.util.RandomDataGenerator
-
- nextPrime(BigInteger) - Static method in class cc.redberry.rings.primes.BigPrimes
-
Return the smallest prime greater than or equal to n.
- nextPrime(long) - Static method in class cc.redberry.rings.primes.BigPrimes
-
Return the smallest prime greater than or equal to n.
- nextPrime(int) - Static method in class cc.redberry.rings.primes.SmallPrimes
-
Return the smallest prime greater than or equal to n.
- nextProbablePrime() - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns the first integer greater than this BigInteger
that
is probably prime.
- NO_MINIMIZATION - Static variable in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
no any minimization at intermediate steps, just keep all track of generators as is
- nontrivialQuotientQ(Poly, Poly) - Static method in class cc.redberry.rings.poly.multivar.MultivariateDivision
-
Tests whether there is nontrivial quotient dividend / divider
- norm1(UnivariatePolynomial<BigInteger>) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Returns L1 norm of the polynomial, i.e.
- norm2(UnivariatePolynomial<BigInteger>) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Returns L2 norm of the polynomial, i.e.
- norm2Double(UnivariatePolynomial<BigInteger>) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Returns L2 norm of the poly, i.e.
- normal() - Method in class cc.redberry.rings.Rational
-
Reduces this rational to normal form by doing division with remainder, that is if numerator = div *
denominator + rem
then the array (div, rem/denominator)
will be returned.
- normalForm(Poly) - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Reduces poly
modulo this ideal
- normalSelectionStrategy(Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
Normal selection strategy: chose syzygy with the less lcm(fi.lt(), fj.lt()) with respect to monomialOrder
- normMax() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- not() - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is (~this)
.
- numberOfPoints() - Method in class cc.redberry.rings.poly.multivar.MultivariateInterpolation.Interpolation
-
Returns the number of interpolation points used
- numberOfPoints() - Method in class cc.redberry.rings.poly.multivar.MultivariateInterpolation.InterpolationZp64
-
Returns the number of interpolation points used
- numberOfPoints() - Method in class cc.redberry.rings.poly.univar.UnivariateInterpolation.Interpolation
-
Returns the number of interpolation points used
- numberOfPoints() - Method in class cc.redberry.rings.poly.univar.UnivariateInterpolation.InterpolationZp64
-
Returns the number of interpolation points used
- numerator - Variable in class cc.redberry.rings.poly.multivar.GroebnerBasis.HilbertSeries
-
Reduced numerator (GCD is cancelled)
- numerator - Variable in class cc.redberry.rings.Rational
-
The numerator.
- nUsedVariables() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns the number of really used variables (those which are not units)
- nVariables() - Method in class cc.redberry.rings.poly.FiniteField
-
- nVariables() - Method in interface cc.redberry.rings.poly.IPolynomialRing
-
Number of polynomial variables
- nVariables - Variable in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
The number of variables
- nVariables() - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
Returns number of variables
- nVariables() - Method in class cc.redberry.rings.poly.MultivariateRing
-
- nVariables() - Method in class cc.redberry.rings.poly.QuotientRing
-
- nVariables() - Method in class cc.redberry.rings.poly.UnivariateQuotientRing
-
- nVariables() - Method in class cc.redberry.rings.poly.UnivariateRing
-
- PairedIterator<Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> - Class in cc.redberry.rings.poly.multivar
-
Iterator over a pair of polynomials
- PairedIterator(Poly, Poly) - Constructor for class cc.redberry.rings.poly.multivar.PairedIterator
-
- parallelStream() - Method in class cc.redberry.rings.util.ListWrapper
-
- parse(String) - Method in interface cc.redberry.rings.ElementParser
-
Parse string into E
- parse(String) - Method in class cc.redberry.rings.ImageRing
-
- parse(String) - Method in class cc.redberry.rings.poly.FiniteField
-
- parse(String, String[]) - Method in class cc.redberry.rings.poly.FiniteField
-
- parse(String, String[]) - Method in interface cc.redberry.rings.poly.IPolynomialRing
-
Parse string into polynomial
- parse(String[], Ring<E>, String[]) - Static method in class cc.redberry.rings.poly.multivar.Ideal
-
Shortcut for parse
- parse(String[], Ring<E>, Comparator<DegreeVector>, String[]) - Static method in class cc.redberry.rings.poly.multivar.Ideal
-
Shortcut for parse
- parse(String, String...) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Parse multivariate Z[X] polynomial from string.
- parse(String, Ring<E>, String...) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Parse multivariate polynomial from string.
- parse(String, Comparator<DegreeVector>, String...) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Parse multivariate Z[X] polynomial from string.
- parse(String, Ring<E>, Comparator<DegreeVector>, String...) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Parse multivariate polynomial from string.
- parse(String, Ring<E>) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Parse multivariate polynomial from string.
- parse(String, IntegersZp64, String...) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Parse multivariate polynomial from string.
- parse(String, IntegersZp64, Comparator<DegreeVector>, String...) - Static method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Parse multivariate polynomial from string.
- parse(String) - Method in class cc.redberry.rings.poly.QuotientRing
-
- parse(String, String[]) - Method in class cc.redberry.rings.poly.QuotientRing
-
- parse(String, Ring<E>) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Parse string into polynomial
- parse(String) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
Parse string into polynomial
- parse(String, long) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
Parse string into polynomial
- parse(String, IntegersZp64) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
Parse string into polynomial
- parse(String) - Method in class cc.redberry.rings.poly.UnivariateQuotientRing
-
- parse(String, String[]) - Method in class cc.redberry.rings.poly.UnivariateQuotientRing
-
- parse(ElementParser<E>, String) - Method in class cc.redberry.rings.Rationals
-
- parse(String) - Method in class cc.redberry.rings.Rationals
-
- parse(String) - Method in interface cc.redberry.rings.Ring
-
Parse string into ring element
- parsePoly(String) - Method in interface cc.redberry.rings.poly.IPolynomial
-
Parse string representation of polynomial
- parsePoly(String, String[]) - Method in interface cc.redberry.rings.poly.IPolynomial
-
Parse string representation of polynomial
- parsePoly(String) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- parsePoly(String, String[]) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- parsePoly(String, ElementParser<E>, String[]) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- parsePoly(String) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- parsePoly(String, String[]) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- parsePoly(String, String[]) - Method in interface cc.redberry.rings.poly.univar.IUnivariatePolynomial
-
- parsePoly(String) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- parsePoly(String, ElementParser<E>, String) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- parsePoly(String) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- parsePoly(String) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- perfectPowerBase() - Method in class cc.redberry.rings.AQuotientRing
-
- perfectPowerBase() - Method in class cc.redberry.rings.ARing
-
- perfectPowerBase() - Method in class cc.redberry.rings.ImageRing
-
- perfectPowerBase() - Method in class cc.redberry.rings.IntegersZp64
-
Returns base
if modulus == base^exponent
, and -1
otherwisec
- perfectPowerBase() - Method in class cc.redberry.rings.Rationals
-
- perfectPowerBase() - Method in interface cc.redberry.rings.Ring
-
Returns base
so that cardinality == base^exponent
or null if cardinality is not finite
- perfectPowerBaseDomain() - Method in class cc.redberry.rings.IntegersZp
-
- perfectPowerBaseDomain() - Method in class cc.redberry.rings.IntegersZp64
-
- perfectPowerDecomposition(BigInteger) - Static method in class cc.redberry.rings.bigint.BigIntegerUtil
-
Tests whether n
is a perfect power n == a^b
and returns {a, b}
if so and null
otherwise
- perfectPowerDecomposition(long) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
Tests whether n
is a perfect power n == a^b
and returns {a, b}
if so and null
otherwise
- perfectPowerExponent() - Method in class cc.redberry.rings.AQuotientRing
-
- perfectPowerExponent() - Method in class cc.redberry.rings.ARing
-
- perfectPowerExponent() - Method in class cc.redberry.rings.ImageRing
-
- perfectPowerExponent() - Method in class cc.redberry.rings.IntegersZp64
-
Returns exponent
if modulus == base^exponent
, and -1
otherwisec
- perfectPowerExponent() - Method in class cc.redberry.rings.Rationals
-
- perfectPowerExponent() - Method in interface cc.redberry.rings.Ring
-
Returns exponent
so that cardinality == base^exponent
or null if cardinality is not finite
- plain - Static variable in interface cc.redberry.rings.ToStringSupport
-
Object::toString
- plain() - Static method in interface cc.redberry.rings.ToStringSupport
-
Object::toString
- plus() - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is (+this)
, and whose
scale is this.scale()
.
- plus(MathContext) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is (+this)
,
with rounding according to the context settings.
- PollardP1(BigInteger, long) - Static method in class cc.redberry.rings.primes.BigPrimes
-
Pollards's p-1 algorithm.
- PollardRho(BigInteger, int, RandomGenerator) - Static method in class cc.redberry.rings.primes.BigPrimes
-
Pollards's rho algorithm (random search version).
- PollardRho(BigInteger, long) - Static method in class cc.redberry.rings.primes.BigPrimes
-
Pollards's rho algorithm.
- polyAddMod(T, T, T, UnivariateDivision.InverseModMonomial<T>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialArithmetic
-
Returns the remainder of the sum (m1 + m2)
and polyModulus
using fast algorithm for
pre-conditioned modulus.
- polyAddMod(T, T, T, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialArithmetic
-
Returns the remainder of the sum (m1 + m2)
and polyModulus
.
- polyMod() - Method in class cc.redberry.rings.poly.univar.HenselLifting.bLinearLift
-
- polyMod() - Method in class cc.redberry.rings.poly.univar.HenselLifting.bQuadraticLift
-
- polyMod() - Method in interface cc.redberry.rings.poly.univar.HenselLifting.LiftableQuintet
-
Returns initial Z[x] polynomial modulo lifted modulus
- polyMod() - Method in class cc.redberry.rings.poly.univar.HenselLifting.lLinearLift
-
- polyMod() - Method in class cc.redberry.rings.poly.univar.HenselLifting.lQuadraticLift
-
- polyMod(T, T, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialArithmetic
-
Returns the remainder of dividend
and polyModulus
.
- polyMod(T, T, UnivariateDivision.InverseModMonomial<T>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialArithmetic
-
Returns the remainder of dividend
and polyModulus
using fast algorithm for pre-conditioned
modulus.
- polyMultiplyMod(T, T, T, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialArithmetic
-
Returns the remainder of the product (m1 * m2)
and polyModulus
.
- polyMultiplyMod(T, T, T, UnivariateDivision.InverseModMonomial<T>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialArithmetic
-
Returns the remainder of the product (m1 * m2)
and polyModulus
using fast algorithm for
pre-conditioned modulus.
- polyNegateMod(T, T, UnivariateDivision.InverseModMonomial<T>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialArithmetic
-
Returns the remainder of the negated poly -m1
and polyModulus
using fast algorithm for
pre-conditioned modulus.
- polyNegateMod(T, T, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialArithmetic
-
Returns the remainder of the negated poly -m1
and polyModulus
.
- PolynomialCollector(Supplier<Poly>) - Constructor for class cc.redberry.rings.poly.multivar.AMultivariatePolynomial.PolynomialCollector
-
- PolynomialCollector(Ring<E>) - Constructor for class cc.redberry.rings.poly.univar.UnivariatePolynomial.PolynomialCollector
-
- PolynomialExtendedGCD(T, T) - Static method in class cc.redberry.rings.poly.PolynomialMethods
-
Computes [gcd(a,b), s, t]
such that s * a + t * b = gcd(a, b)
.
- PolynomialExtendedGCD(T, T) - Static method in class cc.redberry.rings.poly.univar.UnivariateGCD
-
Computes [gcd(a,b), s, t]
such that s * a + t * b = gcd(a, b)
.
- PolynomialFactorDecomposition<Poly extends IPolynomial<Poly>> - Class in cc.redberry.rings.poly
-
Factor decomposition of element.
- PolynomialGCD(Poly...) - Static method in class cc.redberry.rings.poly.multivar.MultivariateGCD
-
Calculates greatest common divisor of the array of polynomials
- PolynomialGCD(Iterable<Poly>) - Static method in class cc.redberry.rings.poly.multivar.MultivariateGCD
-
Calculates greatest common divisor of the array of polynomials
- PolynomialGCD(Poly, Poly) - Static method in class cc.redberry.rings.poly.multivar.MultivariateGCD
-
Calculates greatest common divisor of two multivariate polynomials
- PolynomialGCD(Poly, Poly) - Static method in class cc.redberry.rings.poly.PolynomialMethods
-
Compute GCD of two polynomials.
- PolynomialGCD(Poly...) - Static method in class cc.redberry.rings.poly.PolynomialMethods
-
Compute GCD of array of polynomials.
- PolynomialGCD(Iterable<Poly>) - Static method in class cc.redberry.rings.poly.PolynomialMethods
-
Compute GCD of collection of polynomials.
- PolynomialGCD(T, T) - Static method in class cc.redberry.rings.poly.univar.UnivariateGCD
-
Calculates the GCD of two polynomials.
- PolynomialGCD(T...) - Static method in class cc.redberry.rings.poly.univar.UnivariateGCD
-
Returns GCD of a list of polynomials.
- PolynomialGCD(Iterable<T>) - Static method in class cc.redberry.rings.poly.univar.UnivariateGCD
-
Returns GCD of a list of polynomials.
- PolynomialGCDinGF(Poly, Poly) - Static method in class cc.redberry.rings.poly.multivar.MultivariateGCD
-
Calculates greatest common divisor of two multivariate polynomials over finite fields
- PolynomialGCDinZ(MultivariatePolynomial<BigInteger>, MultivariatePolynomial<BigInteger>) - Static method in class cc.redberry.rings.poly.multivar.MultivariateGCD
-
Calculates greatest common divisor of two multivariate polynomials over Z
- PolynomialMethods - Class in cc.redberry.rings.poly
-
High-level methods for polynomials.
- PolynomialRemainders(T...) - Constructor for class cc.redberry.rings.poly.univar.UnivariateGCD.PolynomialRemainders
-
- PolynomialRemainders(ArrayList<T>) - Constructor for class cc.redberry.rings.poly.univar.UnivariateGCD.PolynomialRemainders
-
- PolynomialRing(Poly) - Static method in class cc.redberry.rings.Rings
-
Generic factory for polynomial ring
- polyPow(T, BigInteger, boolean) - Static method in class cc.redberry.rings.poly.PolynomialMethods
-
Returns base
in a power of non-negative exponent
.
- polyPow(T, long) - Static method in class cc.redberry.rings.poly.PolynomialMethods
-
Returns base
in a power of non-negative exponent
- polyPow(T, BigInteger) - Static method in class cc.redberry.rings.poly.PolynomialMethods
-
Returns base
in a power of non-negative exponent
- polyPow(T, long, boolean) - Static method in class cc.redberry.rings.poly.PolynomialMethods
-
Returns base
in a power of non-negative exponent
- polyPow(T, int, boolean, TIntObjectHashMap<T>) - Static method in class cc.redberry.rings.poly.PolynomialMethods
-
Returns base
in a power of non-negative exponent
- polyPow(T, long, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialArithmetic
-
Returns base
in a power of non-negative exponent
- polyPowers(T, T, UnivariateDivision.InverseModMonomial<T>, int) - Static method in class cc.redberry.rings.poly.univar.ModularComposition
-
Returns poly^{i} mod polyModulus
for i in [0...nIterations]
- polyPowMod(T, long, T, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialArithmetic
-
Returns base
in a power of non-negative exponent
modulo polyModulus
- polyPowMod(T, long, T, UnivariateDivision.InverseModMonomial<T>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialArithmetic
-
Returns base
in a power of non-negative exponent
modulo polyModulus
- polyPowMod(T, BigInteger, T, UnivariateDivision.InverseModMonomial<T>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialArithmetic
-
Returns base
in a power of non-negative exponent
modulo polyModulus
- polyPowMod(T, BigInteger, T, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialArithmetic
-
Returns base
in a power of non-negative exponent
modulo polyModulus
- polySubtractMod(T, T, T, UnivariateDivision.InverseModMonomial<T>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialArithmetic
-
Returns the remainder of the difference (m1 - m2)
and polyModulus
using fast algorithm for
pre-conditioned modulus.
- polySubtractMod(T, T, T, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariatePolynomialArithmetic
-
Returns the remainder of the difference (m1 - m2)
and polyModulus
.
- pow(int) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is
(thisn), The power is computed exactly, to
unlimited precision.
- pow(int, MathContext) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is
(thisn).
- pow(int) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is (thisexponent).
- pow(long, long) - Static method in class cc.redberry.rings.bigint.BigIntegerUtil
-
Returns base
in a power of e
(non negative)
- pow(BigInteger, long) - Static method in class cc.redberry.rings.bigint.BigIntegerUtil
-
Returns base
in a power of e
(non negative)
- pow(BigInteger, int) - Static method in class cc.redberry.rings.bigint.BigIntegerUtil
-
Returns base
in a power of e
(non negative)
- pow(BigInteger, BigInteger) - Static method in class cc.redberry.rings.bigint.BigIntegerUtil
-
Returns base
in a power of e
(non negative)
- pow(I, int) - Method in class cc.redberry.rings.ImageRing
-
- pow(I, long) - Method in class cc.redberry.rings.ImageRing
-
- pow(I, BigInteger) - Method in class cc.redberry.rings.ImageRing
-
- pow(BigInteger, int) - Method in class cc.redberry.rings.Integers
-
- pow(BigInteger, long) - Method in class cc.redberry.rings.Integers
-
- pow(BigInteger, BigInteger) - Method in class cc.redberry.rings.Integers
-
- pow(int) - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Returns this in a power of exponent
- pow(int) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64.lPrecomputedPowers
-
- pow(int, int) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64.lPrecomputedPowersHolder
-
- pow(int) - Method in class cc.redberry.rings.Rational
-
Raise this in a power exponent
- pow(long) - Method in class cc.redberry.rings.Rational
-
Raise this in a power exponent
- pow(BigInteger) - Method in class cc.redberry.rings.Rational
-
Raise this in a power exponent
- pow(E, int) - Method in interface cc.redberry.rings.Ring
-
Returns base
in a power of exponent
(non negative)
- pow(E, long) - Method in interface cc.redberry.rings.Ring
-
Returns base
in a power of exponent
(non negative)
- pow(E, BigInteger) - Method in interface cc.redberry.rings.Ring
-
Returns base
in a power of exponent
(non negative)
- powMod(long, long) - Method in class cc.redberry.rings.IntegersZp64
-
Returns base
in a power of non-negative e
modulo magic.modulus
- powMod(long, long, long) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
Returns base
in a power of non-negative e
modulo modulus
- powModSigned(long, long, FastDivision.Magic) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
Returns base
in a power of non-negative e
modulo magic.modulus
- powModulusMod(UnivariatePolynomialZp64, UnivariatePolynomialZp64, UnivariateDivision.InverseModMonomial<UnivariatePolynomialZp64>, ArrayList<UnivariatePolynomialZp64>) - Static method in class cc.redberry.rings.poly.univar.ModularComposition
-
Returns poly^modulus mod polyModulus
using precomputed monomial powers x^{i*modulus} mod
polyModulus
for i in [0...degree(poly)]
- powModulusMod(UnivariatePolynomial<E>, UnivariatePolynomial<E>, UnivariateDivision.InverseModMonomial<UnivariatePolynomial<E>>, ArrayList<UnivariatePolynomial<E>>) - Static method in class cc.redberry.rings.poly.univar.ModularComposition
-
Returns poly^modulus mod polyModulus
using precomputed monomial powers x^{i*modulus} mod
polyModulus
for i in [0...degree(poly)]
- powModulusMod(T, T, UnivariateDivision.InverseModMonomial<T>, ArrayList<T>) - Static method in class cc.redberry.rings.poly.univar.ModularComposition
-
Returns poly^modulus mod polyModulus
using precomputed monomial powers x^{i*modulus} mod
polyModulus
for i in [0...degree(poly)]
- powModUnsigned(long, long, FastDivision.Magic) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
Returns base
in a power of non-negative e
modulo magic.modulus
- precision() - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns the precision of this BigDecimal
.
- PrecomputedPowersHolder(Ring<E>, MultivariatePolynomial.PrecomputedPowers<E>[]) - Constructor for class cc.redberry.rings.poly.multivar.MultivariatePolynomial.PrecomputedPowersHolder
-
- primeFactors(long) - Static method in class cc.redberry.rings.primes.BigPrimes
-
Prime factors decomposition.
- primeFactors(BigInteger) - Static method in class cc.redberry.rings.primes.BigPrimes
-
Prime factors decomposition.
- primeFactors(int) - Static method in class cc.redberry.rings.primes.SmallPrimes
-
Prime factors decomposition.
- PrimesIterator - Class in cc.redberry.rings.primes
-
Iterator over prime numbers.
- PrimesIterator() - Constructor for class cc.redberry.rings.primes.PrimesIterator
-
Create iterator over prime numbers starting from 2.
- PrimesIterator(long) - Constructor for class cc.redberry.rings.primes.PrimesIterator
-
Create iterator over prime numbers starting from the prime closest to the specified value (prime >= from)
- primitive() - Method in class cc.redberry.rings.poly.PolynomialFactorDecomposition
-
- primitivePart() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Reduces poly to its primitive part (primitive part will always have positive l.c.)
- primitivePart(int) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Gives primitive part of this considered as R[variable][other_variables]
- primitivePart(int) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- primitivePart() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- primitivePart(int) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- primitivePart() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- primitivePart() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- primitivePartSameSign() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Reduces poly to its primitive part, so that primitive part will have the same signum as the initial poly
- primitivePartSameSign() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- primitivePartSameSign() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- primitivePartSameSign() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- probablePrime(int, Random) - Static method in class cc.redberry.rings.bigint.BigInteger
-
Returns a positive BigInteger that is probably prime, with the
specified bitLength.
- product(Comparator<DegreeVector>[], int[]) - Static method in class cc.redberry.rings.poly.multivar.MonomialOrder
-
Block product of orderings
- product(Comparator<DegreeVector>, int, Comparator<DegreeVector>, int) - Static method in class cc.redberry.rings.poly.multivar.MonomialOrder
-
Block product of orderings
- pseudoDivideAndRemainder(UnivariatePolynomialZ64, UnivariatePolynomialZ64, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Returns quotient and remainder using pseudo division.
- pseudoDivideAndRemainder(UnivariatePolynomial<E>, UnivariatePolynomial<E>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Returns quotient and remainder using pseudo division.
- pseudoDivideAndRemainder(Poly, Poly, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Returns quotient and remainder of dividend
and divider
using pseudo division.
- pseudoRemainder(Poly, Poly...) - Static method in class cc.redberry.rings.poly.multivar.MultivariateDivision
-
Performs multivariate pseudo division with remainder and returns the remainder.
- pseudoRemainder(Poly, Collection<Poly>) - Static method in class cc.redberry.rings.poly.multivar.MultivariateDivision
-
Performs multivariate division with remainder and rerurns the remainder.
- pseudoRemainder(Poly, Poly) - Static method in class cc.redberry.rings.poly.multivar.MultivariateDivision
-
Performs multivariate division with remainder and rerurns the remainder.
- PseudoRemainders(T, T, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateGCD
-
Euclidean algorithm for polynomials over Z that uses pseudo division
- PseudoRemainders(UnivariatePolynomialZ64, UnivariatePolynomialZ64, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateGCD
-
Euclidean algorithm for polynomials over Euclidean rings that uses pseudo division
- PseudoRemainders(UnivariatePolynomial<E>, UnivariatePolynomial<E>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateGCD
-
Euclidean algorithm for polynomials over Euclidean rings that uses pseudo division
- put(Term) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Puts monomial
to this polynomial replacing the previous entry if was
- Q - Static variable in class cc.redberry.rings.Rings
-
Ring of rationals (Q)
- QuadraticSieve(BigInteger, int) - Static method in class cc.redberry.rings.primes.BigPrimes
-
- quickSort(int[], int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified target array of ints into ascending numerical order and simultaneously permutes the coSort
ints array in the same way as the target array.
- quickSort(int[], int, int, int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified range of the specified target array of ints into ascending numerical order and simultaneously
permutes the coSort
ints array in the same way as the target array.
- quickSort(long[], long[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified target array of ints into ascending numerical order and simultaneously permutes the coSort
longs array in the same way as the target array.
- quickSort(long[], int, int, long[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified range of the specified target array of ints into ascending numerical order and simultaneously
permutes the coSort
longs array in the same way as the target array.
- quickSort(int[], long[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified target array of ints into ascending numerical order and simultaneously permutes the coSort
longs array in the same way as the target array.
- quickSort(int[], int, int, long[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified range of the specified target array of ints into ascending numerical order and simultaneously
permutes the coSort
longs array in the same way as the target array.
- quickSort(T[], Object[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified target array of objects into ascending order, according to the natural ordering of its
elements and simultaneously permutes the coSort
objects array in the same way then specified target
array.
- quickSort(T[], int, int, Object[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified target array of objects into ascending order, according to the natural ordering of its
elements and simultaneously permutes the coSort
objects array in the same way then specified target
array.
- quickSort(T[], int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified target array of objects into ascending order, according to the natural ordering of its
elements and simultaneously permutes the coSort
objects array in the same way then specified target
array.
- quickSort(T[], int, int, int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified target array of objects into ascending order, according to the natural ordering of its
elements and simultaneously permutes the coSort
objects array in the same way then specified target
array.
- quickSort(int[], Object[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified target array of ints into ascending numerical order and simultaneously permutes the coSort
Objects array in the same way as the target array.
- quickSort(int[], int, int, Object[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified range of the specified target array of ints into ascending numerical order and simultaneously
permutes the coSort
Objects array in the same way as the target array.
- quickSort(short[], int, int, int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified range of the specified target array of ints into ascending numerical order and simultaneously
permutes the coSort
ints array in the same way as the target array.
- quickSort(short[], int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified target array of shorts into ascending numerical order and simultaneously permutes the coSort
ints array in the same way as the target array.
- quickSort(int[], IntComparator) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified range of the specified target array of ints into order specified by
IntComparator
using quicksort.
- quickSort(int[], int, int, IntComparator) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified range of the specified target array of ints into order specified by
IntComparator
using quicksort.
- quickSort(int[], int[], IntComparator) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified target array of ints according to
IntComparator
and simultaneously permutes the
coSort
Objects array in the same way as the target array.
- quickSort(int[], int, int, int[], IntComparator) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified range of the specified target array of ints according to
IntComparator
and
simultaneously permutes the
coSort
Objects array in the same way as the target array.
- quickSort1(int[], int, int, int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- quickSort1(long[], int, int, long[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
This method is the same as
)
, but without range checking.
- quickSort1(int[], int, int, long[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
This method is the same as
)
, but without range checking.
- quickSort1(T[], int, int, Object[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- quickSort1(T[], int, int, int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- quickSort1(int[], int, int, Object[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
This method is the same as
)
, but without range checking.
- quickSort1(short[], int, int, int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- quickSort1(int[], int, int, IntComparator) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified range of the specified target array of ints into order specified by
IntComparator
using quicksort.
- quickSortP(int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified array and returns the resulting permutation
- quickSortP(short[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- quotient(I, I) - Method in class cc.redberry.rings.ImageRing
-
- quotient(Poly) - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Returns the quotient this : oth
- quotient(Ideal<Term, Poly>) - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Returns the quotient this : oth
- quotient(UnivariatePolynomialZ64, UnivariatePolynomialZ64, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Returns quotient dividend/ divider
- quotient(UnivariatePolynomialZp64, UnivariatePolynomialZp64, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Returns quotient of dividing dividend
by divider
.
- quotient(UnivariatePolynomial<E>, UnivariatePolynomial<E>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Returns quotient of dividend
and divider
.
- quotient(Poly, Poly, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Returns quotient dividend/ divider
or null if exact division o
- quotient(E, E) - Method in interface cc.redberry.rings.Ring
-
Returns the quotient of dividend / divider
- quotientFast(UnivariatePolynomialZp64, UnivariatePolynomialZp64, UnivariateDivision.InverseModMonomial<UnivariatePolynomialZp64>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Fast quotient using Newton's iteration.
- quotientFast(UnivariatePolynomial<E>, UnivariatePolynomial<E>, UnivariateDivision.InverseModMonomial<UnivariatePolynomial<E>>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Fast quotient using Newton's iteration.
- QuotientRing<Term extends AMonomial<Term>,Poly extends AMultivariatePolynomial<Term,Poly>> - Class in cc.redberry.rings.poly
-
Multivariate quotient ring
- QuotientRing(IPolynomialRing<Poly>, Ideal<Term, Poly>) - Constructor for class cc.redberry.rings.poly.QuotientRing
-
- QuotientRing(IPolynomialRing<Poly>, Ideal<Term, Poly>) - Static method in class cc.redberry.rings.Rings
-
Quotient ring baseRing/<ideal>
- radicalContains(Poly) - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Tests whether poly
belongs to the radical of this
- raiseExponents(long) - Method in class cc.redberry.rings.FactorDecomposition
-
Multiply each exponent by a given factor
- randomArray(int, Ring<E>, RandomGenerator) - Static method in class cc.redberry.rings.poly.univar.RandomUnivariatePolynomials
-
Creates random array of length degree + 1
with elements from the specified ring
- randomBigArray(int, BigInteger, RandomGenerator) - Static method in class cc.redberry.rings.poly.univar.RandomUnivariatePolynomials
-
Creates random array of length degree + 1
with elements bounded by bound
(by absolute value).
- randomBigIntegerArray(int, BigInteger, BigInteger, RandomGenerator) - Static method in class cc.redberry.rings.util.RandomUtil
-
Creates random array of length degree + 1
with elements bounded by bound
(by absolute value).
- RandomDataGenerator - Class in cc.redberry.rings.util
-
- RandomDataGenerator(RandomGenerator) - Constructor for class cc.redberry.rings.util.RandomDataGenerator
-
- randomElement(RandomGenerator) - Method in class cc.redberry.rings.ImageRing
-
- randomElement(RandomGenerator) - Method in class cc.redberry.rings.IntegersZp
-
- randomElement(RandomGenerator) - Method in class cc.redberry.rings.IntegersZp64
-
Returns a random element from this ring
- randomElement() - Method in class cc.redberry.rings.IntegersZp64
-
Returns a random element from this ring
- randomElement(RandomGenerator) - Method in class cc.redberry.rings.poly.FiniteField
-
- randomElement(int, int, RandomGenerator) - Method in class cc.redberry.rings.poly.MultivariateRing
-
Generates random multivariate polynomial
- randomElement(int, int) - Method in class cc.redberry.rings.poly.MultivariateRing
-
Generates random multivariate polynomial
- randomElement(RandomGenerator) - Method in class cc.redberry.rings.poly.MultivariateRing
-
Gives a random constant polynomial.
- randomElement(int, int, RandomGenerator) - Method in class cc.redberry.rings.poly.UnivariateRing
-
Gives a random univariate polynomial with the degree randomly picked from minDegree
(inclusive) to maxDegree
(exclusive)
- randomElement(int, RandomGenerator) - Method in class cc.redberry.rings.poly.UnivariateRing
-
Gives a random univariate polynomial with the specified degree
- randomElement(RandomGenerator) - Method in class cc.redberry.rings.poly.UnivariateRing
-
- randomElement(RandomGenerator) - Method in class cc.redberry.rings.Rationals
-
- randomElement() - Method in interface cc.redberry.rings.Ring
-
Returns a random element from this ring
- randomElement(RandomGenerator) - Method in interface cc.redberry.rings.Ring
-
Returns a random element from this ring
- randomInt(BigInteger, RandomGenerator) - Static method in class cc.redberry.rings.util.RandomUtil
-
Returns random integer in range [0, bound)
.
- randomIntArray(int, int, int, RandomGenerator) - Static method in class cc.redberry.rings.util.RandomUtil
-
Creates random array of length degree + 1
with elements bounded by bound
(by absolute value).
- randomIrreduciblePolynomial(long, int, RandomGenerator) - Static method in class cc.redberry.rings.poly.univar.IrreduciblePolynomials
-
Generated random irreducible Zp polynomial of degree degree
- randomIrreduciblePolynomial(Ring<E>, int, RandomGenerator) - Static method in class cc.redberry.rings.poly.univar.IrreduciblePolynomials
-
Generated random irreducible polynomial over specified ring of degree degree
- randomIrreduciblePolynomial(Poly, int, RandomGenerator) - Static method in class cc.redberry.rings.poly.univar.IrreduciblePolynomials
-
Generated random irreducible polynomial of degree degree
- randomIrreduciblePolynomialOverZ(int, RandomGenerator) - Static method in class cc.redberry.rings.poly.univar.IrreduciblePolynomials
-
Generated random irreducible polynomial over Z
- randomLongArray(int, long, RandomGenerator) - Static method in class cc.redberry.rings.poly.univar.RandomUnivariatePolynomials
-
Creates random array of length degree + 1
with elements bounded by bound
(by absolute value).
- randomLongArray(int, long, long, RandomGenerator) - Static method in class cc.redberry.rings.util.RandomUtil
-
Creates random array of length degree + 1
with elements bounded by bound
(by absolute value).
- randomMonicPoly(int, long, RandomGenerator) - Static method in class cc.redberry.rings.poly.univar.RandomUnivariatePolynomials
-
Creates random polynomial of specified degree
.
- randomMonicPoly(int, BigInteger, RandomGenerator) - Static method in class cc.redberry.rings.poly.univar.RandomUnivariatePolynomials
-
Creates random polynomial of specified degree
.
- randomMonicPoly(int, Ring<E>, RandomGenerator) - Static method in class cc.redberry.rings.poly.univar.RandomUnivariatePolynomials
-
Creates random polynomial of specified degree
.
- RandomMultivariatePolynomials - Class in cc.redberry.rings.poly.multivar
-
Methods to generate random multivariate polynomials.
- randomNonTrivialElement(RandomGenerator) - Method in class cc.redberry.rings.Rationals
-
- randomNonZeroElement(RandomGenerator) - Method in class cc.redberry.rings.IntegersZp64
-
Returns a random non zero element from this ring
- randomNonZeroElement(RandomGenerator) - Method in interface cc.redberry.rings.Ring
-
Returns a random non zero element from this ring
- randomPoly(Poly, int, RandomGenerator) - Static method in class cc.redberry.rings.poly.univar.RandomUnivariatePolynomials
-
Creates random polynomial of specified degree
.
- randomPoly(int, RandomGenerator) - Static method in class cc.redberry.rings.poly.univar.RandomUnivariatePolynomials
-
Creates random polynomial of specified degree
.
- randomPoly(int, long, RandomGenerator) - Static method in class cc.redberry.rings.poly.univar.RandomUnivariatePolynomials
-
Creates random polynomial of specified degree
with elements bounded by bound
(by absolute
value).
- randomPoly(int, BigInteger, RandomGenerator) - Static method in class cc.redberry.rings.poly.univar.RandomUnivariatePolynomials
-
Creates random polynomial of specified degree
with elements bounded by bound
(by absolute
value).
- randomPoly(int, Ring<E>, RandomGenerator) - Static method in class cc.redberry.rings.poly.univar.RandomUnivariatePolynomials
-
Creates random polynomial of specified degree
with elements from specified ring
- randomPolynomial(int, int, int, BigInteger, Comparator<DegreeVector>, RandomGenerator) - Static method in class cc.redberry.rings.poly.multivar.RandomMultivariatePolynomials
-
Generates random Z[X] polynomial with coefficients bounded by bound
- randomPolynomial(int, int, int, RandomGenerator) - Static method in class cc.redberry.rings.poly.multivar.RandomMultivariatePolynomials
-
Generates random Z[X] polynomial
- randomPolynomial(int, int, int, Ring<E>, Comparator<DegreeVector>, RandomGenerator) - Static method in class cc.redberry.rings.poly.multivar.RandomMultivariatePolynomials
-
Generates random polynomial
- randomPolynomial(int, int, int, IntegersZp64, RandomGenerator) - Static method in class cc.redberry.rings.poly.multivar.RandomMultivariatePolynomials
-
Generates random Zp[X] polynomial over machine integers
- randomPolynomial(int, int, int, IntegersZp64, Comparator<DegreeVector>, RandomGenerator) - Static method in class cc.redberry.rings.poly.multivar.RandomMultivariatePolynomials
-
Generates random Zp[X] polynomial over machine integers
- randomPolynomial(Poly, int, int, RandomGenerator) - Static method in class cc.redberry.rings.poly.multivar.RandomMultivariatePolynomials
-
Generates random multivariate polynomial
- randomPrime(RandomGenerator) - Method in class cc.redberry.rings.primes.SieveOfAtkin
-
- RandomUnivariatePolynomials - Class in cc.redberry.rings.poly.univar
-
Methods to generate random polynomials.
- RandomUtil - Class in cc.redberry.rings.util
-
- range(int, int) - Method in class cc.redberry.rings.poly.multivar.AMonomial
-
Selects range from this
- Rational<E> - Class in cc.redberry.rings
-
Rational expression with numerator and denominator from the ring.
- Rational(Ring<E>, E, E) - Constructor for class cc.redberry.rings.Rational
-
Constructs rational with the specified numerator and denominator
- Rational(Ring<E>, E) - Constructor for class cc.redberry.rings.Rational
-
Constructs rational with the specified numerator and unit denominator
- RationalReconstruction - Class in cc.redberry.rings
-
- Rationals<E> - Class in cc.redberry.rings
-
The ring of rationals (Q).
- Rationals(Ring<E>) - Constructor for class cc.redberry.rings.Rationals
-
- reciprocal(E) - Method in class cc.redberry.rings.AQuotientRing
-
- reciprocal(I) - Method in class cc.redberry.rings.ImageRing
-
- reciprocal(BigInteger) - Method in class cc.redberry.rings.Integers
-
- reciprocal(BigInteger) - Method in class cc.redberry.rings.IntegersZp
-
- reciprocal(long) - Method in class cc.redberry.rings.IntegersZp64
-
Returns modular inverse of val
- reciprocal(Poly) - Method in class cc.redberry.rings.poly.FiniteField
-
- reciprocal() - Method in class cc.redberry.rings.Rational
-
Return the multiplicative inverse of this rational.
- reciprocal(Rational<E>) - Method in class cc.redberry.rings.Rationals
-
- reciprocal(E) - Method in interface cc.redberry.rings.Ring
-
Gives the inverse element element ^ (-1)
- reconstruct(long, long, long, long) - Static method in class cc.redberry.rings.RationalReconstruction
-
Performs a rational number reconstruction.
- reconstruct(BigInteger, BigInteger, BigInteger, BigInteger) - Static method in class cc.redberry.rings.RationalReconstruction
-
Performs a rational number reconstruction.
- reconstruct(Poly, Poly, int, int) - Static method in class cc.redberry.rings.RationalReconstruction
-
Performs a rational number reconstruction.
- reconstructFarey(BigInteger, BigInteger) - Static method in class cc.redberry.rings.RationalReconstruction
-
Performs a rational number reconstruction via Farey images, that is reconstructuction with bound B = sqrt(N/2 -
1/2)
- reconstructFareyErrorTolerant(BigInteger, BigInteger) - Static method in class cc.redberry.rings.RationalReconstruction
-
Performs a error tolerant rational number reconstruction as described in Algorithm 5 of Janko Boehm, Wolfram
Decker, Claus Fieker, Gerhard Pfister, "The use of Bad Primes in Rational Reconstruction",
https://arxiv.org/abs/1207.1651v2
- reducedRowEchelonForm(Ring<E>, E[][], E[]) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Gives the reduced row echelon form of the linear system lhs.x = rhs
from a given row echelon form.
- reducedRowEchelonForm(IntegersZp64, long[][], long[]) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Gives the reduced row echelon form of the linear system lhs.x = rhs
from a given row echelon form.
- reduceUnitContent() - Method in class cc.redberry.rings.poly.PolynomialFactorDecomposition
-
- release() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
release caches
- release() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
release caches
- release() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
release caches
- remainder(BigDecimal) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is (this % divisor)
.
- remainder(BigDecimal, MathContext) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is (this %
divisor)
, with rounding according to the context settings.
- remainder(BigInteger) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is (this % val)
.
- remainder(BigInteger, int) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is (this % val)
using a
specified number of threads if the inputs are sufficiently large.
- remainder(I, I) - Method in class cc.redberry.rings.ImageRing
-
- remainder(BigInteger, BigInteger) - Method in class cc.redberry.rings.Integers
-
- remainder(BigInteger, BigInteger) - Method in class cc.redberry.rings.IntegersZp
-
- remainder(Poly, Poly) - Method in class cc.redberry.rings.poly.FiniteField
-
- remainder(Poly, Poly...) - Static method in class cc.redberry.rings.poly.multivar.MultivariateDivision
-
Performs multivariate division with remainder and returns the remainder.
- remainder(Poly, Collection<Poly>) - Static method in class cc.redberry.rings.poly.multivar.MultivariateDivision
-
Performs multivariate division with remainder and rerurns the remainder.
- remainder(Poly, Poly) - Static method in class cc.redberry.rings.poly.multivar.MultivariateDivision
-
Performs multivariate division with remainder and rerurns the remainder.
- remainder(Poly, Poly) - Static method in class cc.redberry.rings.poly.PolynomialMethods
-
Returns quotient and remainder of a and b.
- remainder(UnivariatePolynomialZ64, UnivariatePolynomialZ64, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Returns remainder of dividend
and divider
or null
if division is not possible.
- remainder(UnivariatePolynomialZp64, UnivariatePolynomialZp64, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Returns remainder of dividing dividend
by divider
.
- remainder(UnivariatePolynomial<E>, UnivariatePolynomial<E>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Returns remainder of dividend
and divider
.
- remainder(Poly, Poly, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Returns remainder of dividend
and divider
.
- remainder(Poly, Poly) - Method in class cc.redberry.rings.poly.UnivariateRing
-
- remainder(E, E) - Method in interface cc.redberry.rings.Ring
-
Returns the remainder of dividend / divider
- remainderFast(UnivariatePolynomialZp64, UnivariatePolynomialZp64, UnivariateDivision.InverseModMonomial<UnivariatePolynomialZp64>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Fast remainder using Newton's iteration with switch to classical remainder for small polynomials.
- remainderFast(UnivariatePolynomial<E>, UnivariatePolynomial<E>, UnivariateDivision.InverseModMonomial<UnivariatePolynomial<E>>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Fast remainder using Newton's iteration with switch to classical remainder for small polynomials.
- remainderFast(Poly, Poly, UnivariateDivision.InverseModMonomial<Poly>, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Fast remainder using Newton's iteration with switch to classical remainder for small polynomials.
- remainderMonomial(T, int, boolean) - Static method in class cc.redberry.rings.poly.univar.UnivariateDivision
-
Returns the remainder of dividend
and monomial x^xDegree
- remainderNumerator() - Method in class cc.redberry.rings.poly.multivar.GroebnerBasis.HilbertSeries
-
Remainder part R(t) of HPS(t): HPS(t) = I(t) + R(t)/(1-t)^m
- remainderParallel(BigInteger) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is (this % val)
,
using multiple threads if the inputs are sufficiently large.
- remainders - Variable in class cc.redberry.rings.poly.univar.UnivariateGCD.PolynomialRemainders
-
actual data
- remove(int[], int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- remove(long[], int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- remove(T[], int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- remove(T[], int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Removes elements at specified positions
in specified array
.
- remove(int[], int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Removes elements at specified positions
in specified array
.
- remove(long[], int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Removes elements at specified positions
in specified array
.
- remove(Object) - Method in class cc.redberry.rings.util.ListWrapper
-
- remove(int) - Method in class cc.redberry.rings.util.ListWrapper
-
- removeAll(Collection<?>) - Method in class cc.redberry.rings.util.ListWrapper
-
- removeIf(Predicate<? super Poly>) - Method in class cc.redberry.rings.util.ListWrapper
-
- removeRange(int, int) - Method in class cc.redberry.rings.util.ListWrapper
-
- removeRedundant(List<Poly>) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
Computes reduced Groebner basis
- renameVariables(P, int[]) - Static method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Rename variables from [0,1,...N] to [newVariables[0], newVariables[1], ..., newVariables[N]] (new instance
created)
- renameVariables(T, int[]) - Static method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Rename variables from [0,1,...N] to [newVariables[0], newVariables[1], ..., newVariables[N]] (new instance
created)
- renameVariables(P, int[], Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Rename variables from [0,1,...N] to [newVariables[0], newVariables[1], ..., newVariables[N]] (new instance
created)
- replaceAll(UnaryOperator<Poly>) - Method in class cc.redberry.rings.util.ListWrapper
-
- retainAll(Collection<?>) - Method in class cc.redberry.rings.util.ListWrapper
-
- reverse() - Method in interface cc.redberry.rings.poly.univar.IUnivariatePolynomial
-
Reverses the coefficients of this
- reverse() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- reverse(int[], int, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- reverse(long[], int, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- reverse(T[], int, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- reverse(T[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- reverse(int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- reverse(long[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- ring - Variable in class cc.redberry.rings.FactorDecomposition
-
The ring
- ring - Variable in class cc.redberry.rings.ImageRing
-
the ring
- ring - Variable in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebra
-
- ring - Variable in class cc.redberry.rings.poly.multivar.IMonomialAlgebra.MonomialAlgebraZp64
-
- ring - Variable in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
The coefficient ring
- ring - Variable in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64.lPrecomputedPowers
-
- ring - Variable in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
The ring.
- ring - Variable in class cc.redberry.rings.poly.univar.HenselLifting.bLinearLift
-
The modulus
- ring - Variable in class cc.redberry.rings.poly.univar.HenselLifting.bQuadraticLift
-
The modulus
- ring - Variable in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
The coefficient ring
- ring - Variable in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
The coefficient ring
- ring - Variable in class cc.redberry.rings.Rational
-
The ring.
- ring - Variable in class cc.redberry.rings.Rationals
-
Ring that numerator and denominator belongs to
- Ring<E> - Interface in cc.redberry.rings
-
Ring of elements.
- Rings - Class in cc.redberry.rings
-
Common rings.
- round(MathContext) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
rounded according to the
MathContext
settings.
- ROUND_CEILING - Static variable in class cc.redberry.rings.bigint.BigDecimal
-
Rounding mode to round towards positive infinity.
- ROUND_DOWN - Static variable in class cc.redberry.rings.bigint.BigDecimal
-
Rounding mode to round towards zero.
- ROUND_FLOOR - Static variable in class cc.redberry.rings.bigint.BigDecimal
-
Rounding mode to round towards negative infinity.
- ROUND_HALF_DOWN - Static variable in class cc.redberry.rings.bigint.BigDecimal
-
Rounding mode to round towards "nearest neighbor"
unless both neighbors are equidistant, in which case round
down.
- ROUND_HALF_EVEN - Static variable in class cc.redberry.rings.bigint.BigDecimal
-
Rounding mode to round towards the "nearest neighbor"
unless both neighbors are equidistant, in which case, round
towards the even neighbor.
- ROUND_HALF_UP - Static variable in class cc.redberry.rings.bigint.BigDecimal
-
Rounding mode to round towards "nearest neighbor"
unless both neighbors are equidistant, in which case round up.
- ROUND_UNNECESSARY - Static variable in class cc.redberry.rings.bigint.BigDecimal
-
Rounding mode to assert that the requested operation has an exact
result, hence no rounding is necessary.
- ROUND_UP - Static variable in class cc.redberry.rings.bigint.BigDecimal
-
Rounding mode to round away from zero.
- RoundingMode - Enum in cc.redberry.rings.bigint
-
Specifies a rounding behavior for numerical operations
capable of discarding precision.
- rowEchelonForm(Ring<E>, E[][]) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Gives the row echelon form of the matrix
- rowEchelonForm(Ring<E>, E[][], boolean) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Gives the row echelon form of the matrix
- rowEchelonForm(Ring<E>, E[][], E[]) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Gives the row echelon form of the linear system lhs.x = rhs
.
- rowEchelonForm(Ring<E>, E[][], E[], boolean, boolean) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Gives the row echelon form of the linear system lhs.x = rhs
.
- rowEchelonForm(IntegersZp64, long[][]) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Gives the row echelon form of the matrix
- rowEchelonForm(IntegersZp64, long[][], boolean) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Gives the row echelon form of the matrix
- rowEchelonForm(IntegersZp64, long[][], long[]) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Gives the row echelon form of the linear system lhs.x = rhs
(rhs may be null).
- rowEchelonForm(IntegersZp64, long[][], long[], boolean, boolean) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Gives the row echelon form of the linear system lhs.x = rhs
(rhs may be null).
- safeAdd(long, long) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
- safeMultiply(long, long) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
- safeMultiply(long, long, long) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
- safePow(long, long) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
Returns base
in a power of e
(non negative)
- safeSubtract(long, long) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
- safeToInt(long) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
Casts long
to signed int
throwing exception in case of overflow.
- sameCoefficientRingWith(Poly) - Method in interface cc.redberry.rings.poly.IPolynomial
-
Returns whether oth
and this
have the same coefficient ring
- sameCoefficientRingWith(MultivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- sameCoefficientRingWith(MultivariatePolynomialZp64) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- sameCoefficientRingWith(UnivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- sameCoefficientRingWith(UnivariatePolynomialZ64) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- sameCoefficientRingWith(UnivariatePolynomialZp64) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- sameSkeletonExceptQ(AMultivariatePolynomial, int...) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Tests whether this
and oth
have the same skeleton with respect all except specified variables
- sameSkeletonQ(AMultivariatePolynomial) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Tests whether this
and oth
have the same skeleton
- sameSkeletonQ(AMultivariatePolynomial, int...) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Tests whether this
and oth
have the same skeleton with respect to specified variables
- scale() - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns the scale of this BigDecimal
.
- scaleByPowerOfTen(int) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal whose numerical value is equal to
(this
* 10n).
- select(int) - Method in class cc.redberry.rings.poly.multivar.AMonomial
-
Sets exponents of all variables except the specified variable to zero
- select(int[]) - Method in class cc.redberry.rings.poly.multivar.AMonomial
-
Set's exponents of all variables except specified variables to zero
- select(T[], int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Selects elements from specified array
at specified positions
.
- select(int[], int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Selects elements from specified array
at specified positions
.
- sequence(int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- sequence(int, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- seriesCoefficient(int, int) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Gives (unevaluated) coefficient of Taylor series expansion for specified variable that is derivative(poly,
variable, order) / order!
, where the derivative is formal derivative and calculated with arithmetic performed
in Z ring (to overcome possible zeros in Zp).
- seriesCoefficient(int, int) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- seriesCoefficient(int, int) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- seriesExpansionDense(Ring<uPoly>, Poly, int, HenselLifting.IEvaluation<Term, Poly>) - Static method in class cc.redberry.rings.poly.multivar.HenselLifting
-
Generates a power series expansion for poly about the point specified by variable and evaluation
- set(Poly) - Method in interface cc.redberry.rings.poly.IPolynomial
-
Sets the content of this to oth
- set(int, int) - Method in class cc.redberry.rings.poly.multivar.AMonomial
-
Set's exponent of specified variable to specified value
- set(Poly) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
- set(int, long) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64.lPrecomputedPowersHolder
-
- set(int, E) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Sets i-th coefficient of this poly with specified value
- set(UnivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- set(int, Poly) - Method in class cc.redberry.rings.util.ListWrapper
-
- setAllCoefficientsToUnit() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Set all coefficients to units
- setAndDestroy(Poly) - Method in interface cc.redberry.rings.poly.univar.IUnivariatePolynomial
-
Sets the content of this with oth
and destroys oth
- setAndDestroy(UnivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- setBit(int) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is equivalent to this BigInteger
with the designated bit set.
- setCoefficient(E) - Method in class cc.redberry.rings.poly.multivar.Monomial
-
- setCoefficient(long) - Method in class cc.redberry.rings.poly.multivar.MonomialZp64
-
- setCoefficientFrom(Term) - Method in class cc.redberry.rings.poly.multivar.AMonomial
-
Sets coefficient of this with coefficient of oth
- setCoefficientFrom(Monomial<E>) - Method in class cc.redberry.rings.poly.multivar.Monomial
-
- setCoefficientFrom(MonomialZp64) - Method in class cc.redberry.rings.poly.multivar.MonomialZp64
-
- setCoefficientRingFrom(Poly) - Method in interface cc.redberry.rings.poly.IPolynomial
-
Set the coefficient ring from specified poly
- setCoefficientRingFrom(MultivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- setCoefficientRingFrom(MultivariatePolynomialZp64) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- setCoefficientRingFrom(UnivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- setCoefficientRingFrom(UnivariatePolynomialZ64) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- setCoefficientRingFrom(UnivariatePolynomialZp64) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- setDegreeVector(DegreeVector) - Method in class cc.redberry.rings.poly.multivar.AMonomial
-
Sets the degree vector
- setDegreeVector(int[], int) - Method in class cc.redberry.rings.poly.multivar.AMonomial
-
Sets the degree vector
- setDegreeVector(int[]) - Method in class cc.redberry.rings.poly.multivar.AMonomial
-
Sets the degree vector
- setDegreeVector(DegreeVector) - Method in class cc.redberry.rings.poly.multivar.Monomial
-
- setDegreeVector(int[], int) - Method in class cc.redberry.rings.poly.multivar.Monomial
-
- setDegreeVector(DegreeVector) - Method in class cc.redberry.rings.poly.multivar.MonomialZp64
-
- setDegreeVector(int[], int) - Method in class cc.redberry.rings.poly.multivar.MonomialZp64
-
- setFrom(int, Poly, int) - Method in interface cc.redberry.rings.poly.univar.IUnivariatePolynomial
-
Sets i-th element of this by j-th element of other poly
- setFrom(int, UnivariatePolynomial<E>, int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- setLC(int, Poly) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Set the leading coefficient of specified variable to a specified value (this is considered as
R[other_variables][variable])
- setLC(E) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Sets the leading coefficient to the specified value
- setLC(long) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Sets the leading coefficient to the specified value
- setLC(E) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Sets the leading coefficient of this poly
- setModulus(long) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
Creates new Zp[x] polynomial by coping the coefficients of this and reducing them modulo new modulus.
- setModulus(IntegersZp64) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
Creates new Zp[x] polynomial by coping the coefficients of this and reducing them modulo new modulus.
- setModulusUnsafe(long) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
does not copy the data and does not reduce the data with new modulus
- setNVariables(int) - Method in class cc.redberry.rings.poly.multivar.AMonomial
-
Sets the number of variables
- setOrdering(Comparator<DegreeVector>) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Makes a copy of this with the new ordering newOrdering
- setRing(Ring<E>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Returns a copy of this with coefficient reduced to a newRing
- setRing(long) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Switches to another ring specified by newModulus
- setRing(IntegersZp64) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Switches to another ring specified by newDomain
- setRing(Ring<E>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Switches to another ring specified by newRing
- setRing(Ring<E>) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Returns a copy of this with elements reduced to a new coefficient ring
- setRingUnsafe(Ring<E>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
internal API
- setRingUnsafe(IntegersZp64) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
internal API
- setRingUnsafe(Ring<E>) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
internal API
- setScale(int, RoundingMode) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose scale is the specified
value, and whose unscaled value is determined by multiplying or
dividing this BigDecimal
's unscaled value by the
appropriate power of ten to maintain its overall value.
- setScale(int, int) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose scale is the specified
value, and whose unscaled value is determined by multiplying or
dividing this BigDecimal
's unscaled value by the
appropriate power of ten to maintain its overall value.
- setScale(int) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose scale is the specified
value, and whose value is numerically equal to this
BigDecimal
's.
- setToValueOf(E[]) - Method in interface cc.redberry.rings.Ring
-
- setUnit(E) - Method in class cc.redberry.rings.FactorDecomposition
-
Sets the unit factor
- setUnit(Poly) - Method in class cc.redberry.rings.poly.PolynomialFactorDecomposition
-
- setZero(int) - Method in class cc.redberry.rings.poly.multivar.AMonomial
-
Set exponent of specified var
to zero
- setZero(int[]) - Method in class cc.redberry.rings.poly.multivar.AMonomial
-
Set exponents of specified variables to zero
- setZero(int) - Method in interface cc.redberry.rings.poly.univar.IUnivariatePolynomial
-
Fills i-th element with zero
- setZero(int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- SEVEN - Static variable in class cc.redberry.rings.bigint.BigInteger
-
The BigInteger constant seven.
- shift(int, long) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Returns a copy of this with variable -> variable + shift
- shift(int, E) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Returns a copy of this with variable -> variable + shift
- shift(int[], E[]) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Returns a copy of this with variables -> variables + shifts
- shift(int, long) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Returns a copy of this with variable -> variable + shift
- shift(int[], long[]) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Substitutes variable -> variable + shift
for each variable from variables
array
- shift(E) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Shifts variable x -> x + value and returns the result (new instance)
- shiftLeft(int) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is (this << n)
.
- shiftLeft(int) - Method in interface cc.redberry.rings.poly.univar.IUnivariatePolynomial
-
Returns the quotient this / x^offset
, it is polynomial with coefficient list formed by shifting
coefficients of this
to the left by offset
.
- shiftLeft(int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- shiftRight(int) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is (this >> n)
.
- shiftRight(int) - Method in interface cc.redberry.rings.poly.univar.IUnivariatePolynomial
-
Multiplies this
by the x^offset
.
- shiftRight(int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- short2int(short[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- SHORT_MAX_VALUE - Static variable in class cc.redberry.rings.bigint.BigInteger
-
The BigInteger constant Int.MAX_VALUE.
- shortValueExact() - Method in class cc.redberry.rings.bigint.BigDecimal
-
Converts this BigDecimal
to a short
, checking
for lost information.
- shortValueExact() - Method in class cc.redberry.rings.bigint.BigInteger
-
Converts this BigInteger
to a short
, checking
for lost information.
- shuffle(int[], RandomGenerator) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- SieveOfAtkin - Class in cc.redberry.rings.primes
-
- signum() - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns the signum function of this BigDecimal
.
- signum() - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns the signum function of this BigInteger.
- signum(I) - Method in class cc.redberry.rings.ImageRing
-
- signum(BigInteger) - Method in class cc.redberry.rings.Integers
-
- signum() - Method in class cc.redberry.rings.poly.PolynomialFactorDecomposition
-
Calculates the signum of the polynomial constituted by this decomposition
- signum() - Method in class cc.redberry.rings.Rational
-
Signum of this rational
- signum(Rational<E>) - Method in class cc.redberry.rings.Rationals
-
- signum(E) - Method in interface cc.redberry.rings.Ring
-
- signumOfLC() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Gives signum of the leading coefficient
- signumOfLC() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- signumOfLC() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- signumOfLC() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- SIX - Static variable in class cc.redberry.rings.bigint.BigInteger
-
The BigInteger constant six.
- size() - Method in class cc.redberry.rings.FactorDecomposition
-
Number of non-constant factors
- size() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Returns the size of this polynomial
- size() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns the number of terms in this polynomial
- size() - Method in interface cc.redberry.rings.poly.univar.IUnivariatePolynomial
-
Returns the degree of this polynomial
- size() - Method in class cc.redberry.rings.poly.univar.UnivariateGCD.PolynomialRemainders
-
- size() - Method in class cc.redberry.rings.util.ListWrapper
-
- SmallPrimes - Class in cc.redberry.rings.primes
-
Prime factorization of 32-bit integers.
- smallTrialDivision(int, TIntArrayList) - Static method in class cc.redberry.rings.primes.SmallPrimes
-
Extract small factors.
- solve(Ring<E>, E[][], E[]) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Solves linear system lhs.x = rhs
and reduces lhs to row echelon form.
- solve(Ring<E>, E[][], E[], E[]) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Solves linear system lhs.x = rhs
and reduces the lhs to row echelon form.
- solve(Ring<E>, ArrayList<E[]>, ArrayList<E>, E[]) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Solves linear system lhs.x = rhs
and stores the result in result
(which should be of the enough
length).
- solve(IntegersZp64, long[][], long[]) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Solves linear system lhs.x = rhs
and reduces the lhs to row echelon form.
- solve(IntegersZp64, long[][], long[], long[]) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Solves linear system lhs.x = rhs
and reduces the lhs to row echelon form.
- solve(IntegersZp64, ArrayList<long[]>, TLongArrayList, long[]) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Solves linear system lhs.x = rhs
and stores the result in result
(which should be of the enough
length).
- solve(Poly) - Method in class cc.redberry.rings.poly.univar.DiophantineEquations.DiophantineSolver
-
- solveGB(List<Poly>, List<Collection<DegreeVector>>, Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
Sparse Groebner basis via "linear lifting".
- solveVandermonde(Ring<E>, E[], E[]) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Solves Vandermonde linear system (that is with i-th equation of the form {@code row[i]^0 * x0 + row[i]^1 * x1 +
...
- solveVandermonde(Ring<E>, E[], E[], E[]) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Solves Vandermonde linear system (that is with i-th equation of the form {@code row[i]^0 * x0 + row[i]^1 * x1 +
...
- solveVandermonde(IntegersZp64, long[], long[]) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Solves Vandermonde linear system (that is with i-th equation of the form {@code row[i]^0 * x0 + row[i]^1 * x1 +
...
- solveVandermonde(IntegersZp64, long[], long[], long[]) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Solves Vandermonde linear system (that is with i-th equation of the form {@code row[i]^0 * x0 + row[i]^1 * x1 +
...
- solveVandermondeT(Ring<E>, E[], E[]) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Solves transposed Vandermonde linear system (that is with i-th equation of the form {@code row[0]^i * x0 +
row[1]^i * x1 + ...
- solveVandermondeT(Ring<E>, E[], E[], E[]) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Solves transposed Vandermonde linear system (that is with i-th equation of the form {@code row[0]^i * x0 +
row[1]^i * x1 + ...
- solveVandermondeT(IntegersZp64, long[], long[]) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Solves transposed Vandermonde linear system (that is with i-th equation of the form {@code row[0]^i * x0 +
row[1]^i * x1 + ...
- solveVandermondeT(IntegersZp64, long[], long[], long[]) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Solves transposed Vandermonde linear system (that is with i-th equation of the form {@code row[0]^i * x0 +
row[1]^i * x1 + ...
- sort(Comparator<? super Poly>) - Method in class cc.redberry.rings.util.ListWrapper
-
- sparsity() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Sparsity level: size / (product of degrees)
- sparsity2() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Sparsity level: size / nDenseTerms
where nDenseTerms is a total number of possible distinct terms with
total degree not larger than distinct total degrees presented in this.
- split(Poly, int...) - Static method in class cc.redberry.rings.poly.multivar.MultivariateConversions
-
Given poly in R[x1,x2,...,xN] converts to poly in R[variables][other_variables]
- split(IPolynomialRing<Poly>, int...) - Static method in class cc.redberry.rings.poly.multivar.MultivariateConversions
-
Given poly in R[x1,x2,...,xN] converts to poly in R[variables][other_variables]
- spliterator() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- spliterator() - Method in class cc.redberry.rings.util.ListWrapper
-
- sqrtCeil(BigInteger) - Static method in class cc.redberry.rings.bigint.BigIntegerUtil
-
Returns ceil square root of val
- sqrtFloor(BigInteger) - Static method in class cc.redberry.rings.bigint.BigIntegerUtil
-
Returns floor square root of val
- square() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Squares this
- square() - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Returns squared ideal
- square() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- square() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- square() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- square() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
- square() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
- SquareFreeFactorization(Poly) - Static method in class cc.redberry.rings.poly.multivar.MultivariateSquareFreeFactorization
-
Performs square-free factorization of a {@code poly.
- SquareFreeFactorization(T) - Static method in class cc.redberry.rings.poly.univar.UnivariateSquareFreeFactorization
-
Performs square-free factorization of a poly
.
- SquareFreeFactorizationMusser(Poly) - Static method in class cc.redberry.rings.poly.multivar.MultivariateSquareFreeFactorization
-
Performs square-free factorization of a poly
which coefficient ring has any characteristic using Musser's
algorithm.
- SquareFreeFactorizationMusser(Poly) - Static method in class cc.redberry.rings.poly.univar.UnivariateSquareFreeFactorization
-
Performs square-free factorization of a poly
using Musser's algorithm (both zero and non-zero
characteristic of coefficient ring allowed).
- SquareFreeFactorizationMusserZeroCharacteristics(Poly) - Static method in class cc.redberry.rings.poly.multivar.MultivariateSquareFreeFactorization
-
Performs square-free factorization of a poly
which coefficient ring has zero characteristic using
Musser's algorithm.
- SquareFreeFactorizationMusserZeroCharacteristics(Poly) - Static method in class cc.redberry.rings.poly.univar.UnivariateSquareFreeFactorization
-
Performs square-free factorization of a poly which coefficient ring has zero characteristic using Musser's
algorithm.
- SquareFreeFactorizationYunZeroCharacteristics(Poly) - Static method in class cc.redberry.rings.poly.multivar.MultivariateSquareFreeFactorization
-
Performs square-free factorization of a poly
which coefficient ring has zero characteristic using Yun's
algorithm.
- SquareFreeFactorizationYunZeroCharacteristics(Poly) - Static method in class cc.redberry.rings.poly.univar.UnivariateSquareFreeFactorization
-
Performs square-free factorization of a poly
which coefficient ring has zero characteristic using Yun's
algorithm.
- squareFreePart() - Method in class cc.redberry.rings.FactorDecomposition
-
Square-free part
- SquareFreePart(Poly) - Static method in class cc.redberry.rings.poly.multivar.MultivariateSquareFreeFactorization
-
Returns square-free part of the poly
- SquareFreePart(T) - Static method in class cc.redberry.rings.poly.univar.UnivariateSquareFreeFactorization
-
Returns square-free part of the poly
- stableSort(int[], int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified array of ints into ascending order using stable sort algorithm and simultaneously permutes
the coSort
ints array in the same way as the target array.
- statisticsNanotime(DescriptiveStatistics) - Static method in class cc.redberry.rings.util.TimeUnits
-
- statisticsNanotime(DescriptiveStatistics, boolean) - Static method in class cc.redberry.rings.util.TimeUnits
-
- statisticsNanotimeFull(DescriptiveStatistics) - Static method in class cc.redberry.rings.util.TimeUnits
-
- stream() - Method in class cc.redberry.rings.FactorDecomposition
-
Stream of all factors
- stream() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Returns a stream of coefficients of this
- stream() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Returns a sequential Stream
with coefficients of this as its source.
- stream() - Method in class cc.redberry.rings.Rational
-
Stream of numerator and denominator
- stream() - Method in class cc.redberry.rings.util.ListWrapper
-
- streamWithoutUnit() - Method in class cc.redberry.rings.FactorDecomposition
-
- stripTrailingZeros() - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
which is numerically equal to
this one but with any trailing zeros removed from the
representation.
- subList(int, int) - Method in class cc.redberry.rings.util.ListWrapper
-
- SubresultantRemainders(T, T) - Static method in class cc.redberry.rings.poly.univar.UnivariateGCD
-
Euclidean algorithm for polynomials over Euclidean rings that produces subresultants sequence
- SubresultantRemainders(UnivariatePolynomialZ64, UnivariatePolynomialZ64) - Static method in class cc.redberry.rings.poly.univar.UnivariateGCD
-
Euclidean algorithm for polynomials over Euclidean rings that produces subresultants sequence
- SubresultantRemainders(UnivariatePolynomial<E>, UnivariatePolynomial<E>) - Static method in class cc.redberry.rings.poly.univar.UnivariateGCD
-
Euclidean algorithm for polynomials over Euclidean rings that produces subresultants sequence
- substitute(int, MultivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Returns a copy of this with poly
substituted for variable
.
- substitute(int, MultivariatePolynomialZp64) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Returns a copy of this with poly
substituted for variable
- subtract(E, E) - Method in class cc.redberry.rings.AQuotientRing
-
- subtract(BigDecimal) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is (this -
subtrahend)
, and whose scale is max(this.scale(),
subtrahend.scale())
.
- subtract(BigDecimal, MathContext) - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigDecimal
whose value is (this - subtrahend)
,
with rounding according to the context settings.
- subtract(BigInteger) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a BigInteger whose value is (this - val)
.
- subtract(I, I) - Method in class cc.redberry.rings.ImageRing
-
- subtract(BigInteger, BigInteger) - Method in class cc.redberry.rings.Integers
-
- subtract(BigInteger, BigInteger) - Method in class cc.redberry.rings.IntegersZp
-
- subtract(long, long) - Method in class cc.redberry.rings.IntegersZp64
-
Subtract mod operation
- subtract(Poly, Poly) - Method in class cc.redberry.rings.poly.FiniteField
-
- subtract(Poly) - Method in interface cc.redberry.rings.poly.IPolynomial
-
Subtracts oth
from this
.
- subtract(Poly...) - Method in interface cc.redberry.rings.poly.IPolynomial
-
Subtracts oth
from this
.
- subtract(Poly) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
- subtract(Term, Poly) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Subtracts cf * oth
from this polynomial
- subtract(Term) - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Subtracts monomial
from this polynomial
- subtract(E) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Subtracts oth
from this polynomial
- subtract(long) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Subtracts oth
from this polynomial and returns it
- subtract(E) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Subtract constant from this.
- subtract(UnivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- subtract(UnivariatePolynomial<E>, E, int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
Subtracts factor * x^exponent * oth
from this
- subtract(E) - Method in class cc.redberry.rings.Rational
-
Subtracts other
from this
- subtract(long) - Method in class cc.redberry.rings.Rational
-
Subtracts other
from this
- subtract(Rational<E>) - Method in class cc.redberry.rings.Rational
-
Subtracts other
from this
- subtract(Rational<E>, Rational<E>) - Method in class cc.redberry.rings.Rationals
-
- subtract(E, E) - Method in interface cc.redberry.rings.Ring
-
Subtracts b
from a
- subtract(int[], int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- subtractLt() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Removes the leading term from this polynomial
- subtractMutable(Poly, Poly) - Method in class cc.redberry.rings.poly.FiniteField
-
- subtractMutable(E, E) - Method in interface cc.redberry.rings.Ring
-
Subtracts b
from a
and destroys the initial content of a
- sum(int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- sum(int[], int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- sum(int[], int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- sum(int[], int, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- sumExponents() - Method in class cc.redberry.rings.FactorDecomposition
-
Sum all exponents
- sumToDouble(int[], int, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- sumToDouble(int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- supplier() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial.PolynomialCollector
-
- supplier() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial.PolynomialCollector
-
- swap(int[], int, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Swaps x[a] with x[b].
- swap(long[], int, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Swaps x[a] with x[b].
- swap(Object[], int, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Swaps x[a] with x[b].
- swapVariables(P, int, int) - Static method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Renames variable i
to j
and j
to i
(new instance created)
- symmetricForm(BigInteger) - Method in class cc.redberry.rings.IntegersZp
-
Converts value
to a symmetric representation of Zp
- symmetricForm(long) - Method in class cc.redberry.rings.IntegersZp64
-
to symmetric modulus
- symMod(long, long) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
Returns value mod modulus
in the symmetric representation (-modulus/2 <= result <= modulus/2
)
- syzygy(Poly, Poly) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
Computes syzygy of given polynomials
- syzygy(GroebnerBasis.SyzygyPair<Term, Poly>) - Static method in class cc.redberry.rings.poly.multivar.GroebnerBasis
-
Computes syzygy of given polynomials
- take() - Method in class cc.redberry.rings.primes.PrimesIterator
-
Get the next prime number
- TEN - Static variable in class cc.redberry.rings.bigint.BigDecimal
-
The value 10, with a scale of 0.
- TEN - Static variable in class cc.redberry.rings.bigint.BigInteger
-
The BigInteger constant ten.
- testBit(int) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns true
if and only if the designated bit is set.
- THREE - Static variable in class cc.redberry.rings.bigint.BigInteger
-
The BigInteger constant three.
- TimeConstrained - Class in cc.redberry.rings.util
-
- TimeConstrained() - Constructor for class cc.redberry.rings.util.TimeConstrained
-
- timeConstrained(Callable<T>, long, T) - Static method in class cc.redberry.rings.util.TimeConstrained
-
Runs lambda, stopping after specified number of milliseconds
- timeConstrained(Callable<T>, long) - Static method in class cc.redberry.rings.util.TimeConstrained
-
Runs lambda, stopping after specified number of milliseconds
- timeConstrained0(Callable<T>, long, T) - Static method in class cc.redberry.rings.util.TimeConstrained
-
Runs lambda, stopping after specified number of milliseconds
- TimeUnits - Class in cc.redberry.rings.util
-
- timSort(int[], int[]) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Sorts the specified array of ints into ascending order using TimSort algorithm and simultaneously permutes the
coSort
ints array in the same way as the target array.
- toArray() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
- toArray(Set<Integer>) - Static method in class cc.redberry.rings.util.ArraysUtil
-
Converts Set<Integer>
to int[]
- toArray() - Method in class cc.redberry.rings.util.ListWrapper
-
- toArray(T[]) - Method in class cc.redberry.rings.util.ListWrapper
-
- toArrayWithoutUnit() - Method in class cc.redberry.rings.FactorDecomposition
-
Array of factors without constant factor
- toArrayWithUnit() - Method in class cc.redberry.rings.FactorDecomposition
-
Array of factors without constant factor
- toBigInteger() - Method in class cc.redberry.rings.bigint.BigDecimal
-
Converts this BigDecimal
to a BigInteger
.
- toBigIntegerExact() - Method in class cc.redberry.rings.bigint.BigDecimal
-
Converts this BigDecimal
to a BigInteger
,
checking for lost information.
- toBigMonomial() - Method in class cc.redberry.rings.poly.multivar.MonomialZp64
-
- toBigPoly() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Returns polynomial over Z formed from the coefficients of this
- toBigPoly() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZ64
-
Converts this to a polynomial over BigIntegers
- toBigPoly() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomialZp64
-
Converts this to a polynomial over BigIntegers
- toByteArray() - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns a byte array containing the two's-complement
representation of this BigInteger.
- toCommonDenominator(UnivariatePolynomial<Rational<E>>) - Static method in class cc.redberry.rings.poly.Util
-
Brings polynomial with rational coefficients to common denominator
- toCommonDenominator(MultivariatePolynomial<Rational<E>>) - Static method in class cc.redberry.rings.poly.Util
-
Brings polynomial with rational coefficients to common denominator
- toDenseRecursiveForm() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Gives a recursive univariate representation of this poly.
- toDenseRecursiveForm() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Gives a recursive univariate representation of this poly.
- toEngineeringString() - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a string representation of this BigDecimal
,
using engineering notation if an exponent is needed.
- toPlainString() - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a string representation of this BigDecimal
without an exponent field.
- toSparseRecursiveForm() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
Gives a recursive sparse univariate representation of this poly.
- toSparseRecursiveForm() - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
Gives a recursive sparse univariate representation of this poly.
- toString() - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns the string representation of this BigDecimal
,
using scientific notation if an exponent is needed.
- toString(int) - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns the String representation of this BigInteger in the
given radix.
- toString() - Method in class cc.redberry.rings.bigint.BigInteger
-
Returns the decimal String representation of this BigInteger.
- toString() - Method in class cc.redberry.rings.bigint.MathContext
-
Returns the string representation of this MathContext
.
- toString() - Method in class cc.redberry.rings.FactorDecomposition
-
- toString(ToStringSupport<E>) - Method in class cc.redberry.rings.FactorDecomposition
-
- toString(ToStringSupport<E>, boolean) - Method in class cc.redberry.rings.FactorDecomposition
-
- toString() - Method in class cc.redberry.rings.Integers
-
- toString() - Method in class cc.redberry.rings.IntegersZp
-
- toString() - Method in class cc.redberry.rings.IntegersZp64
-
- toString(String[]) - Method in class cc.redberry.rings.poly.FiniteField
-
- toString(String, String[]) - Method in class cc.redberry.rings.poly.FiniteField
-
- toString(String, ToStringSupport<Poly>, String[]) - Method in class cc.redberry.rings.poly.FiniteField
-
- toString() - Method in class cc.redberry.rings.poly.FiniteField
-
- toString(String[]) - Method in interface cc.redberry.rings.poly.IPolynomial
-
- toString(String, String[]) - Method in interface cc.redberry.rings.poly.IPolynomialRing
-
String representation of this ring.
- toString() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
- toString(String[]) - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
String representation of this monomial with specified string names for variables
- toString() - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
- toString() - Method in class cc.redberry.rings.poly.multivar.GroebnerBasis.HilbertSeries
-
- toString(String[]) - Method in class cc.redberry.rings.poly.multivar.Ideal
-
- toString() - Method in class cc.redberry.rings.poly.multivar.Ideal
-
- toString() - Method in class cc.redberry.rings.poly.multivar.Monomial
-
- toString() - Method in class cc.redberry.rings.poly.multivar.MonomialZp64
-
- toString(String[]) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- toString(ToStringSupport<E>, String[]) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomial
-
- toString(String...) - Method in class cc.redberry.rings.poly.multivar.MultivariatePolynomialZp64
-
- toString(String[]) - Method in class cc.redberry.rings.poly.PolynomialFactorDecomposition
-
- toString(String[]) - Method in class cc.redberry.rings.poly.QuotientRing
-
- toString(String, String[]) - Method in class cc.redberry.rings.poly.QuotientRing
-
- toString() - Method in class cc.redberry.rings.poly.QuotientRing
-
- toString() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- toString(String[]) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- toString(ToStringSupport<E>, String) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- toString(String[]) - Method in class cc.redberry.rings.poly.UnivariateQuotientRing
-
- toString(String, String[]) - Method in class cc.redberry.rings.poly.UnivariateQuotientRing
-
- toString() - Method in class cc.redberry.rings.poly.UnivariateQuotientRing
-
- toString() - Method in class cc.redberry.rings.Rational
-
- toString(ToStringSupport<E>) - Method in class cc.redberry.rings.Rational
-
- toString() - Method in class cc.redberry.rings.Rationals
-
- toString(E) - Method in interface cc.redberry.rings.Ring
-
- toString(E) - Method in interface cc.redberry.rings.ToStringSupport
-
Gives string representation of specified element
- toString(long[], int, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- toString(T[], int, int) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- toString(T[], int, int, Function<T, String>) - Static method in class cc.redberry.rings.util.ArraysUtil
-
- toString() - Method in class cc.redberry.rings.util.ListWrapper
-
- toString(String[]) - Method in interface cc.redberry.rings.WithVariables
-
Returns string representation of this using specified string representation for variables.
- toStringArray() - Method in class cc.redberry.rings.poly.multivar.DegreeVector
-
- ToStringSupport<E> - Interface in cc.redberry.rings
-
- totalDegree() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
- totalDegree - Variable in class cc.redberry.rings.poly.multivar.DegreeVector
-
Sum of all exponents (total degree)
- toZero() - Method in interface cc.redberry.rings.poly.IPolynomial
-
Sets this to zero
- toZero() - Method in class cc.redberry.rings.poly.multivar.AMonomial
-
Set all exponents to zero
- toZero() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
- toZero() - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- transposeSquare(Object[][]) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Transpose square matrix
- transposeSquare(long[][]) - Static method in class cc.redberry.rings.linear.LinearSolver
-
Transpose square matrix
- trivial(Poly) - Static method in class cc.redberry.rings.poly.multivar.Ideal
-
Creates trivial ideal (ideal = ring)
- trivial(Poly, Comparator<DegreeVector>) - Static method in class cc.redberry.rings.poly.multivar.Ideal
-
Creates trivial ideal (ideal = ring)
- truncate(int) - Method in interface cc.redberry.rings.poly.univar.IUnivariatePolynomial
-
Returns the remainder this rem x^(newDegree + 1)
, it is polynomial formed by coefficients of this from
zero to newDegree
(both inclusive)
- truncate(int) - Method in class cc.redberry.rings.poly.univar.UnivariatePolynomial
-
- Tuple2(A, B) - Constructor for class cc.redberry.rings.poly.Util.Tuple2
-
- TWO - Static variable in class cc.redberry.rings.bigint.BigInteger
-
The BigInteger constant two.
- ulp() - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns the size of an ulp, a unit in the last place, of this
BigDecimal
.
- uncompress(String) - Static method in class cc.redberry.rings.util.ZipUtil
-
- union(Poly) - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Returns the union of this and oth
- union(Ideal<Term, Poly>) - Method in class cc.redberry.rings.poly.multivar.Ideal
-
Returns the union of this and oth
- unit - Variable in class cc.redberry.rings.FactorDecomposition
-
unit coefficient
- unit(Ring<E>, E) - Static method in class cc.redberry.rings.FactorDecomposition
-
Unit factorization
- unit(Poly) - Static method in class cc.redberry.rings.poly.PolynomialFactorDecomposition
-
Unit factorization
- UnivariateDivision - Class in cc.redberry.rings.poly.univar
-
Division with remainder of univariate polynomials.
- UnivariateDivision.InverseModMonomial<Poly extends IUnivariatePolynomial<Poly>> - Class in cc.redberry.rings.poly.univar
-
Holds poly^(-1) mod x^i
- UnivariateFactorization - Class in cc.redberry.rings.poly.univar
-
Factorization of univariate polynomials.
- UnivariateGCD - Class in cc.redberry.rings.poly.univar
-
Univariate polynomial GCD and sub-resultant sequences.
- UnivariateGCD.PolynomialRemainders<T extends IUnivariatePolynomial<T>> - Class in cc.redberry.rings.poly.univar
-
Polynomial remainder sequence
- UnivariateInterpolation - Class in cc.redberry.rings.poly.univar
-
Univariate polynomial interpolation.
- UnivariateInterpolation.Interpolation<E> - Class in cc.redberry.rings.poly.univar
-
Updatable Newton interpolation
- UnivariateInterpolation.InterpolationZp64 - Class in cc.redberry.rings.poly.univar
-
Updatable Newton interpolation
- UnivariatePolynomial<E> - Class in cc.redberry.rings.poly.univar
-
Univariate polynomial over generic ring.
- UnivariatePolynomial.PolynomialCollector<E> - Class in cc.redberry.rings.poly.univar
-
Collector which collects stream of element to a UnivariatePolynomial
- UnivariatePolynomialArithmetic - Class in cc.redberry.rings.poly.univar
-
Helper methods for univariate polynomial arithmetic.
- UnivariatePolynomialZ64 - Class in cc.redberry.rings.poly.univar
-
Univariate polynomial over machine integers in range [-2^63, 2^63].
- UnivariatePolynomialZp64 - Class in cc.redberry.rings.poly.univar
-
- UnivariateQuotientRing<Poly extends IUnivariatePolynomial<Poly>> - Class in cc.redberry.rings.poly
-
Univariate quotient ring
- UnivariateQuotientRing(IPolynomialRing<Poly>, Poly) - Constructor for class cc.redberry.rings.poly.UnivariateQuotientRing
-
- UnivariateQuotientRing(IPolynomialRing<uPoly>, uPoly) - Static method in class cc.redberry.rings.Rings
-
Quotient ring baseRing/<modulus>
- UnivariateRing<Poly extends IUnivariatePolynomial<Poly>> - Class in cc.redberry.rings.poly
-
Ring of univariate polynomials.
- UnivariateRing(Poly) - Constructor for class cc.redberry.rings.poly.UnivariateRing
-
Creates ring of univariate polynomials which support operations over univariate polynomials of the type same as
of provided factory
polynomial
- UnivariateRing(Ring<E>) - Static method in class cc.redberry.rings.Rings
-
Ring of univariate polynomials over specified coefficient ring
- UnivariateRing(Poly) - Static method in class cc.redberry.rings.Rings
-
Ring of univariate polynomials with specified factory
- UnivariateRingGF(FiniteField<uPoly>) - Static method in class cc.redberry.rings.Rings
-
Ring of univariate polynomials over Galois Field (GF[x])
- UnivariateRingQ - Static variable in class cc.redberry.rings.Rings
-
Ring of univariate polynomials over rationals (Q[x])
- UnivariateRingZ - Static variable in class cc.redberry.rings.Rings
-
Ring of univariate polynomials over integers (Z[x])
- UnivariateRingZp(BigInteger) - Static method in class cc.redberry.rings.Rings
-
Ring of univariate polynomials over Zp integers (Zp[x]) with arbitrary large modulus
- UnivariateRingZp64(long) - Static method in class cc.redberry.rings.Rings
-
Ring of univariate polynomials over Zp integers (Zp[x])
- UnivariateRingZp64(IntegersZp64) - Static method in class cc.redberry.rings.Rings
-
Ring of univariate polynomials over Zp integers (Zp[x])
- UnivariateSquareFreeFactorization - Class in cc.redberry.rings.poly.univar
-
Square-free factorization of univariate polynomials over Z and Zp.
- univariateVariable() - Method in class cc.redberry.rings.poly.multivar.AMultivariatePolynomial
-
Returns -1 if this poly is not effectively univariate or variable in which it is univariate
- UNLIMITED - Static variable in class cc.redberry.rings.bigint.MathContext
-
A MathContext
object whose settings have the values
required for unlimited precision arithmetic.
- unsafePow(long, long) - Static method in class cc.redberry.rings.poly.MachineArithmetic
-
Returns base
in a power of e
(non negative)
- unscaledValue() - Method in class cc.redberry.rings.bigint.BigDecimal
-
Returns a BigInteger
whose value is the unscaled
value of this BigDecimal
.
- update(E, MultivariatePolynomial<E>) - Method in class cc.redberry.rings.poly.multivar.MultivariateInterpolation.Interpolation
-
Updates interpolation, so that interpolating polynomial satisfies interpolation[point] = value
- update(E[], MultivariatePolynomial<E>[]) - Method in class cc.redberry.rings.poly.multivar.MultivariateInterpolation.Interpolation
-
Updates interpolation, so that interpolating polynomial satisfies interpolation[point] = value
- update(long, MultivariatePolynomialZp64) - Method in class cc.redberry.rings.poly.multivar.MultivariateInterpolation.InterpolationZp64
-
Updates interpolation, so that interpolating polynomial satisfies interpolation[point] = value
- update(long[], MultivariatePolynomialZp64[]) - Method in class cc.redberry.rings.poly.multivar.MultivariateInterpolation.InterpolationZp64
-
Updates interpolation, so that interpolating polynomial satisfies interpolation[point] = value
- update(E, E) - Method in class cc.redberry.rings.poly.univar.UnivariateInterpolation.Interpolation
-
Updates interpolation, so that interpolating polynomial satisfies interpolation[point] = value
- update(E[], E[]) - Method in class cc.redberry.rings.poly.univar.UnivariateInterpolation.Interpolation
-
Updates interpolation, so that interpolating polynomial satisfies interpolation[point] = value
- update(long, long) - Method in class cc.redberry.rings.poly.univar.UnivariateInterpolation.InterpolationZp64
-
Updates interpolation, so that interpolating polynomial satisfies interpolation[point] = value
- update(long[], long[]) - Method in class cc.redberry.rings.poly.univar.UnivariateInterpolation.InterpolationZp64
-
Updates interpolation, so that interpolating polynomial satisfies interpolation[point] = value
- Util - Class in cc.redberry.rings.poly
-
- Util.Tuple2<A,B> - Class in cc.redberry.rings.poly
-