Uses of Class
edu.jas.arith.ModInteger
-
Packages that use ModInteger Package Description edu.jas.arith Basic arithmetic package.edu.jas.fd Factorization domain package for solvable polynomial rings.edu.jas.gbufd Groebner bases using unique factorization package.edu.jas.poly Generic coefficients polynomial package.edu.jas.ufd Unique factorization domain package. -
-
Uses of ModInteger in edu.jas.arith
Methods in edu.jas.arith that return ModInteger Modifier and Type Method Description ModInteger
ModInteger. abs()
ModInteger absolute value.ModInteger
ModIntegerRing. chineseRemainder(ModInteger c, ModInteger ci, ModInteger a)
ModInteger chinese remainder algorithm.ModInteger
ModInteger. copy()
Clone this.ModInteger
ModIntegerRing. copy(ModInteger c)
Copy ModInteger element c.ModInteger
ModIntegerRing. create(long c)
Create ModInteger element c.ModInteger
ModIntegerRing. create(java.lang.String c)
Create ModInteger element c.ModInteger
ModIntegerRing. create(java.math.BigInteger c)
Create ModInteger element c.ModInteger
ModInteger. divide(ModInteger S)
ModInteger divide.ModInteger[]
ModInteger. egcd(ModInteger S)
ModInteger extended greatest common divisor.ModInteger
ModIntegerRing. fromInteger(long a)
Get a ModInteger element from a long value.ModInteger
ModIntegerRing. fromInteger(java.math.BigInteger a)
Get a ModInteger element from a BigInteger value.ModInteger
ModInteger. gcd(ModInteger S)
ModInteger greatest common divisor.ModInteger
ModIntegerRing. getONE()
Get the one element.ModInteger
ModIntegerRing. getZERO()
Get the zero element.ModInteger[]
ModInteger. hegcd(ModInteger S)
ModInteger half extended greatest common divisor.ModInteger
ModInteger. inverse()
ModInteger inverse.static ModInteger
ModInteger. MIABS(ModInteger A)
ModInteger absolute value.static ModInteger
ModInteger. MIDIF(ModInteger A, ModInteger B)
ModInteger subtraction.static ModInteger
ModInteger. MIINV(ModInteger A)
ModInteger inverse.static ModInteger
ModInteger. MINEG(ModInteger A)
ModInteger negative.static ModInteger
ModInteger. MIPROD(ModInteger A, ModInteger B)
ModInteger product.static ModInteger
ModInteger. MIQ(ModInteger A, ModInteger B)
ModInteger quotient.static ModInteger
ModInteger. MIREM(ModInteger A, ModInteger B)
ModInteger remainder.static ModInteger
ModInteger. MISUM(ModInteger A, ModInteger B)
ModInteger summation.ModInteger
ModInteger. multiply(ModInteger S)
ModInteger multiply.ModInteger
ModInteger. negate()
ModInteger negative.ModInteger
ModIntegerIterator. next()
Get next integer.ModInteger
ModIntegerRing. parse(java.io.Reader r)
Parse ModInteger from Reader.ModInteger
ModIntegerRing. parse(java.lang.String s)
Parse ModInteger from String.ModInteger[]
ModInteger. quotientRemainder(ModInteger S)
Quotient and remainder by division of this by S.ModInteger
ModIntegerRing. random(int n)
ModInteger random.ModInteger
ModIntegerRing. random(int n, java.util.Random rnd)
ModInteger random.ModInteger
ModInteger. remainder(ModInteger S)
ModInteger remainder.ModInteger
ModInteger. subtract(ModInteger S)
ModInteger subtraction.ModInteger
ModInteger. sum(ModInteger S)
ModInteger summation.Methods in edu.jas.arith that return types with arguments of type ModInteger Modifier and Type Method Description static java.util.List<ModInteger>
ModIntegerRing. chineseRemainder(ModInteger m1, ModInteger m2, java.util.List<ModInteger> L1, java.util.List<ModInteger> L2)
Modular integer list chinese remainder algorithm.java.util.List<ModInteger>
ModIntegerRing. generators()
Get a list of the generating elements.java.util.Iterator<ModInteger>
ModIntegerRing. iterator()
Get a ModInteger iterator.Methods in edu.jas.arith with parameters of type ModInteger Modifier and Type Method Description ModInteger
ModIntegerRing. chineseRemainder(ModInteger c, ModInteger ci, ModInteger a)
ModInteger chinese remainder algorithm.static java.util.List<ModInteger>
ModIntegerRing. chineseRemainder(ModInteger m1, ModInteger m2, java.util.List<ModInteger> L1, java.util.List<ModInteger> L2)
Modular integer list chinese remainder algorithm.int
ModInteger. compareTo(ModInteger b)
ModInteger comparison.ModInteger
ModIntegerRing. copy(ModInteger c)
Copy ModInteger element c.ModInteger
ModInteger. divide(ModInteger S)
ModInteger divide.ModInteger[]
ModInteger. egcd(ModInteger S)
ModInteger extended greatest common divisor.ModInteger
ModInteger. gcd(ModInteger S)
ModInteger greatest common divisor.ModInteger[]
ModInteger. hegcd(ModInteger S)
ModInteger half extended greatest common divisor.static ModInteger
ModInteger. MIABS(ModInteger A)
ModInteger absolute value.static int
ModInteger. MICOMP(ModInteger A, ModInteger B)
ModInteger comparison.static ModInteger
ModInteger. MIDIF(ModInteger A, ModInteger B)
ModInteger subtraction.static ModInteger
ModInteger. MIINV(ModInteger A)
ModInteger inverse.static ModInteger
ModInteger. MINEG(ModInteger A)
ModInteger negative.static ModInteger
ModInteger. MIPROD(ModInteger A, ModInteger B)
ModInteger product.static ModInteger
ModInteger. MIQ(ModInteger A, ModInteger B)
ModInteger quotient.static ModInteger
ModInteger. MIREM(ModInteger A, ModInteger B)
ModInteger remainder.static int
ModInteger. MISIGN(ModInteger A)
ModInteger signum.static ModInteger
ModInteger. MISUM(ModInteger A, ModInteger B)
ModInteger summation.ModInteger
ModInteger. multiply(ModInteger S)
ModInteger multiply.ModInteger[]
ModInteger. quotientRemainder(ModInteger S)
Quotient and remainder by division of this by S.ModInteger
ModInteger. remainder(ModInteger S)
ModInteger remainder.ModInteger
ModInteger. subtract(ModInteger S)
ModInteger subtraction.ModInteger
ModInteger. sum(ModInteger S)
ModInteger summation.Method parameters in edu.jas.arith with type arguments of type ModInteger Modifier and Type Method Description static java.util.List<ModInteger>
ModIntegerRing. chineseRemainder(ModInteger m1, ModInteger m2, java.util.List<ModInteger> L1, java.util.List<ModInteger> L2)
Modular integer list chinese remainder algorithm. -
Uses of ModInteger in edu.jas.fd
Methods in edu.jas.fd that return types with arguments of type ModInteger Modifier and Type Method Description static GreatestCommonDivisorAbstract<ModInteger>
SGCDFactory. getImplementation(ModIntegerRing fac)
Determine suitable implementation of gcd algorithms, case ModInteger.static GreatestCommonDivisorAbstract<ModInteger>
SGCDFactory. getProxy(ModIntegerRing fac)
Determine suitable proxy for gcd algorithms, case ModInteger. -
Uses of ModInteger in edu.jas.gbufd
Methods in edu.jas.gbufd that return types with arguments of type ModInteger Modifier and Type Method Description static GroebnerBaseAbstract<ModInteger>
GBFactory. getImplementation(ModIntegerRing fac)
Determine suitable implementation of GB algorithms, case ModInteger.static GroebnerBaseAbstract<ModInteger>
GBFactory. getImplementation(ModIntegerRing fac, PairList<ModInteger> pl)
Determine suitable implementation of GB algorithms, case ModInteger.static SolvableGroebnerBaseAbstract<ModInteger>
SGBFactory. getImplementation(ModIntegerRing fac)
Determine suitable implementation of GB algorithms, case ModInteger.static SolvableGroebnerBaseAbstract<ModInteger>
SGBFactory. getImplementation(ModIntegerRing fac, PairList<ModInteger> pl)
Determine suitable implementation of GB algorithms, case ModInteger.Method parameters in edu.jas.gbufd with type arguments of type ModInteger Modifier and Type Method Description static GroebnerBaseAbstract<ModInteger>
GBFactory. getImplementation(ModIntegerRing fac, PairList<ModInteger> pl)
Determine suitable implementation of GB algorithms, case ModInteger.static SolvableGroebnerBaseAbstract<ModInteger>
SGBFactory. getImplementation(ModIntegerRing fac, PairList<ModInteger> pl)
Determine suitable implementation of GB algorithms, case ModInteger. -
Uses of ModInteger in edu.jas.poly
Methods in edu.jas.poly that return types with arguments of type ModInteger Modifier and Type Method Description static Product<ModInteger>
PolyUtil. toProduct(ProductRing<ModInteger> pfac, BigInteger c)
Product representation.static GenPolynomial<Product<ModInteger>>
PolyUtil. toProduct(GenPolynomialRing<Product<ModInteger>> pfac, GenPolynomial<BigInteger> A)
Product representation.static java.util.List<GenPolynomial<Product<ModInteger>>>
PolyUtil. toProduct(GenPolynomialRing<Product<ModInteger>> pfac, java.util.List<GenPolynomial<BigInteger>> L)
Product representation.Method parameters in edu.jas.poly with type arguments of type ModInteger Modifier and Type Method Description static Product<ModInteger>
PolyUtil. toProduct(ProductRing<ModInteger> pfac, BigInteger c)
Product representation.static GenPolynomial<Product<ModInteger>>
PolyUtil. toProduct(GenPolynomialRing<Product<ModInteger>> pfac, GenPolynomial<BigInteger> A)
Product representation.static java.util.List<GenPolynomial<Product<ModInteger>>>
PolyUtil. toProduct(GenPolynomialRing<Product<ModInteger>> pfac, java.util.List<GenPolynomial<BigInteger>> L)
Product representation. -
Uses of ModInteger in edu.jas.ufd
Methods in edu.jas.ufd that return types with arguments of type ModInteger Modifier and Type Method Description static FactorAbstract<ModInteger>
FactorFactory. getImplementation(ModIntegerRing fac)
Determine suitable implementation of factorization algorithm, case ModInteger.static GreatestCommonDivisorAbstract<ModInteger>
GCDFactory. getImplementation(ModIntegerRing fac)
Determine suitable implementation of gcd algorithms, case ModInteger.static SquarefreeAbstract<ModInteger>
SquarefreeFactory. getImplementation(ModIntegerRing fac)
Determine suitable implementation of factorization algorithm, case ModInteger.static GreatestCommonDivisorAbstract<ModInteger>
GCDFactory. getProxy(ModIntegerRing fac)
Determine suitable proxy for gcd algorithms, case ModInteger.
-