Uses of Class
edu.jas.arith.ModLongRing
Packages that use ModLongRing
Package
Description
Basic arithmetic package.
Factorization domain package for solvable polynomial rings.
Groebner bases using unique factorization package.
Unique factorization domain package.
-
Uses of ModLongRing in edu.jas.arith
Fields in edu.jas.arith declared as ModLongRingModifier and TypeFieldDescriptionfinal ModLongRing
ModLong.ring
ModLongRing reference.(package private) final ModLongRing
ModLongIterator.ring
Methods in edu.jas.arith that return ModLongRingConstructors in edu.jas.arith with parameters of type ModLongRingModifierConstructorDescriptionThe constructor creates a 0 ModLong object from a given ModLongRing.ModLong
(ModLongRing m, long a) The constructor creates a ModLong object from a ModLongRing and a long value part.ModLong
(ModLongRing m, Long a) The constructor creates a ModLong object from a ModLongRing and a Long value part.ModLong
(ModLongRing m, String s) The constructor creates a ModLong object from a ModLongRing and a String value part.ModLong
(ModLongRing m, BigInteger a) The constructor creates a ModLong object from a ModLongRing and a value part.ModLong iterator constructor. -
Uses of ModLongRing in edu.jas.fd
Methods in edu.jas.fd with parameters of type ModLongRingModifier and TypeMethodDescriptionstatic GreatestCommonDivisorAbstract
<ModLong> SGCDFactory.getImplementation
(ModLongRing fac) Determine suitable implementation of gcd algorithms, case ModLong.static GreatestCommonDivisorAbstract
<ModLong> SGCDFactory.getProxy
(ModLongRing fac) Determine suitable proxy for gcd algorithms, case ModLong. -
Uses of ModLongRing in edu.jas.gbufd
Methods in edu.jas.gbufd with parameters of type ModLongRingModifier and TypeMethodDescriptionstatic GroebnerBaseAbstract
<ModLong> GBFactory.getImplementation
(ModLongRing fac) Determine suitable implementation of GB algorithms, case ModLong.static GroebnerBaseAbstract
<ModLong> GBFactory.getImplementation
(ModLongRing fac, PairList<ModLong> pl) Determine suitable implementation of GB algorithms, case ModLong.static SolvableGroebnerBaseAbstract
<ModLong> SGBFactory.getImplementation
(ModLongRing fac) Determine suitable implementation of GB algorithms, case ModLong.static SolvableGroebnerBaseAbstract
<ModLong> SGBFactory.getImplementation
(ModLongRing fac, PairList<ModLong> pl) Determine suitable implementation of GB algorithms, case ModLong. -
Uses of ModLongRing in edu.jas.ufd
Methods in edu.jas.ufd with parameters of type ModLongRingModifier and TypeMethodDescriptionstatic FactorAbstract
<ModLong> FactorFactory.getImplementation
(ModLongRing fac) Determine suitable implementation of factorization algorithm, case ModInteger.static GreatestCommonDivisorAbstract
<ModLong> GCDFactory.getImplementation
(ModLongRing fac) Determine suitable implementation of gcd algorithms, case ModLong.static SquarefreeAbstract
<ModLong> SquarefreeFactory.getImplementation
(ModLongRing fac) Determine suitable implementation of factorization algorithm, case ModLong.static GreatestCommonDivisorAbstract
<ModLong> GCDFactory.getProxy
(ModLongRing fac) Determine suitable proxy for gcd algorithms, case ModLong.