Uses of Class
edu.jas.arith.ModIntegerRing
-
Packages that use ModIntegerRing 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.ufd Unique factorization domain package. -
-
Uses of ModIntegerRing in edu.jas.arith
Fields in edu.jas.arith declared as ModIntegerRing Modifier and Type Field Description ModIntegerRing
ModInteger. ring
ModIntegerRing reference.(package private) ModIntegerRing
ModIntegerIterator. ring
Methods in edu.jas.arith that return ModIntegerRing Modifier and Type Method Description ModIntegerRing
ModInteger. factory()
Get the corresponding element factory.Constructors in edu.jas.arith with parameters of type ModIntegerRing Constructor Description ModInteger(ModIntegerRing m)
The constructor creates a 0 ModInteger object from a given ModIntegerRing.ModInteger(ModIntegerRing m, long a)
The constructor creates a ModInteger object from a ModIntegerRing and a long value part.ModInteger(ModIntegerRing m, java.lang.String s)
The constructor creates a ModInteger object from a ModIntegerRing and a String value part.ModInteger(ModIntegerRing m, java.math.BigInteger a)
The constructor creates a ModInteger object from a ModIntegerRing and a value part.ModIntegerIterator(ModIntegerRing fac)
ModInteger iterator constructor. -
Uses of ModIntegerRing in edu.jas.fd
Methods in edu.jas.fd with parameters of type ModIntegerRing 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 ModIntegerRing in edu.jas.gbufd
Methods in edu.jas.gbufd with parameters of type ModIntegerRing 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. -
Uses of ModIntegerRing in edu.jas.ufd
Methods in edu.jas.ufd with parameters of type ModIntegerRing 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.
-