Uses of Class
edu.jas.arith.ModInt
-
Packages that use ModInt Package Description edu.jas.arith Basic arithmetic package.edu.jas.gbufd Groebner bases using unique factorization package.edu.jas.ufd Unique factorization domain package. -
-
Uses of ModInt in edu.jas.arith
Methods in edu.jas.arith that return ModInt Modifier and Type Method Description ModInt
ModInt. abs()
ModInt absolute value.ModInt
ModIntRing. chineseRemainder(ModInt c, ModInt ci, ModInt a)
ModInt chinese remainder algorithm.ModInt
ModInt. copy()
Clone this.ModInt
ModIntRing. copy(ModInt c)
Copy ModInt element c.ModInt
ModIntRing. create(int c)
Create ModInt element c.ModInt
ModIntRing. create(java.lang.String c)
Create ModInt element c.ModInt
ModIntRing. create(java.math.BigInteger c)
Create ModInt element c.ModInt
ModInt. divide(ModInt S)
ModInt divide.ModInt[]
ModInt. egcd(ModInt S)
ModInteger extended greatest common divisor.ModInt
ModIntRing. fromInteger(int a)
Get a ModInt element from a int value.ModInt
ModIntRing. fromInteger(long a)
Get a ModInt element from a long value.ModInt
ModIntRing. fromInteger(java.math.BigInteger a)
Get a ModInt element from a BigInteger value.ModInt
ModInt. gcd(ModInt S)
ModInteger greatest common divisor.ModInt
ModIntRing. getONE()
Get the one element.ModInt
ModIntRing. getZERO()
Get the zero element.ModInt
ModInt. inverse()
ModInt inverse.ModInt
ModInt. multiply(ModInt S)
ModInt multiply.ModInt
ModInt. negate()
ModInt negative.ModInt
ModIntIterator. next()
Get next integer.ModInt
ModIntRing. parse(java.io.Reader r)
Parse ModInt from Reader.ModInt
ModIntRing. parse(java.lang.String s)
Parse ModInt from String.ModInt
ModIntRing. random(int n)
ModInt random.ModInt
ModIntRing. random(int n, java.util.Random rnd)
ModInt random.ModInt
ModInt. remainder(ModInt S)
ModInt remainder.ModInt
ModInt. subtract(ModInt S)
ModInt subtraction.ModInt
ModInt. sum(ModInt S)
ModInt summation.Methods in edu.jas.arith that return types with arguments of type ModInt Modifier and Type Method Description static java.util.List<ModInt>
ModIntRing. chineseRemainder(ModInt m1, ModInt m2, java.util.List<ModInt> L1, java.util.List<ModInt> L2)
Modular digit list chinese remainder algorithm.java.util.List<ModInt>
ModIntRing. generators()
Get a list of the generating elements.java.util.Iterator<ModInt>
ModIntRing. iterator()
Get a ModInt iterator.Methods in edu.jas.arith with parameters of type ModInt Modifier and Type Method Description ModInt
ModIntRing. chineseRemainder(ModInt c, ModInt ci, ModInt a)
ModInt chinese remainder algorithm.static java.util.List<ModInt>
ModIntRing. chineseRemainder(ModInt m1, ModInt m2, java.util.List<ModInt> L1, java.util.List<ModInt> L2)
Modular digit list chinese remainder algorithm.int
ModInt. compareTo(ModInt b)
ModInt comparison.ModInt
ModIntRing. copy(ModInt c)
Copy ModInt element c.ModInt
ModInt. divide(ModInt S)
ModInt divide.ModInt[]
ModInt. egcd(ModInt S)
ModInteger extended greatest common divisor.ModInt
ModInt. gcd(ModInt S)
ModInteger greatest common divisor.ModInt
ModInt. multiply(ModInt S)
ModInt multiply.ModInt
ModInt. remainder(ModInt S)
ModInt remainder.ModInt
ModInt. subtract(ModInt S)
ModInt subtraction.ModInt
ModInt. sum(ModInt S)
ModInt summation.Method parameters in edu.jas.arith with type arguments of type ModInt Modifier and Type Method Description static java.util.List<ModInt>
ModIntRing. chineseRemainder(ModInt m1, ModInt m2, java.util.List<ModInt> L1, java.util.List<ModInt> L2)
Modular digit list chinese remainder algorithm. -
Uses of ModInt in edu.jas.gbufd
Methods in edu.jas.gbufd that return types with arguments of type ModInt Modifier and Type Method Description static GroebnerBaseAbstract<ModInt>
GBFactory. getImplementation(ModIntRing fac)
Determine suitable implementation of GB algorithms, case ModInt.static GroebnerBaseAbstract<ModInt>
GBFactory. getImplementation(ModIntRing fac, PairList<ModInt> pl)
Determine suitable implementation of GB algorithms, case ModInt.Method parameters in edu.jas.gbufd with type arguments of type ModInt Modifier and Type Method Description static GroebnerBaseAbstract<ModInt>
GBFactory. getImplementation(ModIntRing fac, PairList<ModInt> pl)
Determine suitable implementation of GB algorithms, case ModInt. -
Uses of ModInt in edu.jas.ufd
Methods in edu.jas.ufd that return types with arguments of type ModInt Modifier and Type Method Description static FactorAbstract<ModInt>
FactorFactory. getImplementation(ModIntRing fac)
Determine suitable implementation of factorization algorithm, case ModInteger.static GreatestCommonDivisorAbstract<ModInt>
GCDFactory. getImplementation(ModIntRing fac)
Determine suitable implementation of gcd algorithms, case ModInt.static SquarefreeAbstract<ModInt>
SquarefreeFactory. getImplementation(ModIntRing fac)
Determine suitable implementation of factorization algorithm, case ModInt.static GreatestCommonDivisorAbstract<ModInt>
GCDFactory. getProxy(ModIntRing fac)
Determine suitable proxy for gcd algorithms, case ModInt.
-