Uses of Class
edu.jas.arith.ModLong
Packages that use ModLong
Package
Description
Basic arithmetic package.
Factorization domain package for solvable polynomial rings.
Groebner bases using unique factorization package.
Unique factorization domain package.
-
Uses of ModLong in edu.jas.arith
Methods in edu.jas.arith that return ModLongModifier and TypeMethodDescriptionModLong.abs()
ModLong absolute value.ModLongRing.chineseRemainder
(ModLong c, ModLong ci, ModLong a) ModLong chinese remainder algorithm.ModLong.copy()
Clone this.Copy ModLong element c.ModLongRing.create
(long c) Create ModLong element c.Create ModLong element c.ModLongRing.create
(BigInteger c) Create ModLong element c.ModLong divide.ModLong[]
ModInteger extended greatest common divisor.ModLongRing.fromInteger
(long a) Get a ModLong element from a long value.ModLongRing.fromInteger
(BigInteger a) Get a ModLong element from a BigInteger value.ModInteger greatest common divisor.ModLongRing.getONE()
Get the one element.ModLongRing.getZERO()
Get the zero element.ModLong.inverse()
ModLong inverse.ModLong multiply.ModLong.negate()
ModLong negative.ModLongIterator.next()
Get next integer.Parse ModLong from Reader.Parse ModLong from String.ModLongRing.random
(int n) ModLong random.ModLong random.ModLong remainder.ModLong subtraction.ModLong summation.Methods in edu.jas.arith that return types with arguments of type ModLongModifier and TypeMethodDescriptionModular digit list chinese remainder algorithm.ModLongRing.generators()
Get a list of the generating elements.ModLongRing.iterator()
Get a ModLong iterator.PrimeInteger.residueListFermat
(long n) Fermat residue list.PrimeInteger.residueListFermatSingle
(long m, long a) Fermat residue list, single modulus.Methods in edu.jas.arith with parameters of type ModLongModifier and TypeMethodDescriptionModLongRing.chineseRemainder
(ModLong c, ModLong ci, ModLong a) ModLong chinese remainder algorithm.Modular digit list chinese remainder algorithm.int
ModLong comparison.Copy ModLong element c.ModLong divide.ModLong[]
ModInteger extended greatest common divisor.ModInteger greatest common divisor.ModLong multiply.ModLong remainder.ModLong subtraction.ModLong summation.Method parameters in edu.jas.arith with type arguments of type ModLong -
Uses of ModLong in edu.jas.fd
Methods in edu.jas.fd that return types with arguments of type ModLongModifier 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 ModLong in edu.jas.gbufd
Methods in edu.jas.gbufd that return types with arguments of type ModLongModifier 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.Method parameters in edu.jas.gbufd with type arguments of type ModLongModifier and TypeMethodDescriptionstatic GroebnerBaseAbstract
<ModLong> GBFactory.getImplementation
(ModLongRing fac, PairList<ModLong> pl) 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 ModLong in edu.jas.ufd
Methods in edu.jas.ufd that return types with arguments of type ModLongModifier 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.