Uses of Class
edu.jas.arith.ModIntRing
Packages that use ModIntRing
Package
Description
Basic arithmetic package.
Groebner bases using unique factorization package.
Unique factorization domain package.
-
Uses of ModIntRing in edu.jas.arith
Fields in edu.jas.arith declared as ModIntRingModifier and TypeFieldDescriptionfinal ModIntRingModInt.ringModIntRing reference.(package private) final ModIntRingModIntIterator.ringMethods in edu.jas.arith that return ModIntRingConstructors in edu.jas.arith with parameters of type ModIntRingModifierConstructorDescriptionModInt(ModIntRing m) The constructor creates a 0 ModInt object from a given ModIntRing.ModInt(ModIntRing m, int a) The constructor creates a ModInt object from a ModIntRing and a int value part.ModInt(ModIntRing m, long a) The constructor creates a ModInt object from a ModIntRing and a long value part.ModInt(ModIntRing m, Integer a) The constructor creates a ModInt object from a ModIntRing and a Int value part.ModInt(ModIntRing m, Long a) The constructor creates a ModInt object from a ModIntRing and a Long value part.ModInt(ModIntRing m, String s) The constructor creates a ModInt object from a ModIntRing and a String value part.ModInt(ModIntRing m, BigInteger a) The constructor creates a ModInt object from a ModIntRing and a value part.ModIntIterator(ModIntRing fac) ModInt iterator constructor. -
Uses of ModIntRing in edu.jas.gbufd
Methods in edu.jas.gbufd with parameters of type ModIntRingModifier and TypeMethodDescriptionstatic 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. -
Uses of ModIntRing in edu.jas.ufd
Methods in edu.jas.ufd with parameters of type ModIntRingModifier and TypeMethodDescriptionstatic 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.