Uses of Class
edu.jas.arith.ModLong

Packages that use ModLong

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 ModLong in edu.jas.arith

Methods in edu.jas.arith that return ModLong

Modifier and Type	Method	Description
ModLong	ModLong.abs()	ModLong absolute value.
ModLong	ModLongRing.chineseRemainder(ModLong c, ModLong ci, ModLong a)	ModLong chinese remainder algorithm.
ModLong	ModLong.copy()	Clone this.
ModLong	ModLongRing.copy(ModLong c)	Copy ModLong element c.
ModLong	ModLongRing.create(long c)	Create ModLong element c.
ModLong	ModLongRing.create(java.lang.String c)	Create ModLong element c.
ModLong	ModLongRing.create(java.math.BigInteger c)	Create ModLong element c.
ModLong	ModLong.divide(ModLong S)	ModLong divide.
ModLong[]	ModLong.egcd(ModLong S)	ModInteger extended greatest common divisor.
ModLong	ModLongRing.fromInteger(long a)	Get a ModLong element from a long value.
ModLong	ModLongRing.fromInteger(java.math.BigInteger a)	Get a ModLong element from a BigInteger value.
ModLong	ModLong.gcd(ModLong S)	ModInteger greatest common divisor.
ModLong	ModLongRing.getONE()	Get the one element.
ModLong	ModLongRing.getZERO()	Get the zero element.
ModLong	ModLong.inverse()	ModLong inverse.
ModLong	ModLong.multiply(ModLong S)	ModLong multiply.
ModLong	ModLong.negate()	ModLong negative.
ModLong	ModLongIterator.next()	Get next integer.
ModLong	ModLongRing.parse(java.io.Reader r)	Parse ModLong from Reader.
ModLong	ModLongRing.parse(java.lang.String s)	Parse ModLong from String.
ModLong	ModLongRing.random(int n)	ModLong random.
ModLong	ModLongRing.random(int n, java.util.Random rnd)	ModLong random.
ModLong	ModLong.remainder(ModLong S)	ModLong remainder.
ModLong	ModLong.subtract(ModLong S)	ModLong subtraction.
ModLong	ModLong.sum(ModLong S)	ModLong summation.

Methods in edu.jas.arith that return types with arguments of type ModLong

Modifier and Type	Method	Description
static java.util.List<ModLong>	ModLongRing.chineseRemainder(ModLong m1, ModLong m2, java.util.List<ModLong> L1, java.util.List<ModLong> L2)	Modular digit list chinese remainder algorithm.
java.util.List<ModLong>	ModLongRing.generators()	Get a list of the generating elements.
java.util.Iterator<ModLong>	ModLongRing.iterator()	Get a ModLong iterator.
static java.util.List<ModLong>	PrimeInteger.residueListFermat(long n)	Fermat residue list.
static java.util.List<ModLong>	PrimeInteger.residueListFermatSingle(long m, long a)	Fermat residue list, single modulus.

Methods in edu.jas.arith with parameters of type ModLong

Modifier and Type	Method	Description
ModLong	ModLongRing.chineseRemainder(ModLong c, ModLong ci, ModLong a)	ModLong chinese remainder algorithm.
static java.util.List<ModLong>	ModLongRing.chineseRemainder(ModLong m1, ModLong m2, java.util.List<ModLong> L1, java.util.List<ModLong> L2)	Modular digit list chinese remainder algorithm.
int	ModLong.compareTo(ModLong b)	ModLong comparison.
ModLong	ModLongRing.copy(ModLong c)	Copy ModLong element c.
ModLong	ModLong.divide(ModLong S)	ModLong divide.
ModLong[]	ModLong.egcd(ModLong S)	ModInteger extended greatest common divisor.
ModLong	ModLong.gcd(ModLong S)	ModInteger greatest common divisor.
ModLong	ModLong.multiply(ModLong S)	ModLong multiply.
ModLong	ModLong.remainder(ModLong S)	ModLong remainder.
ModLong	ModLong.subtract(ModLong S)	ModLong subtraction.
ModLong	ModLong.sum(ModLong S)	ModLong summation.

Method parameters in edu.jas.arith with type arguments of type ModLong

Modifier and Type	Method	Description
static java.util.List<ModLong>	ModLongRing.chineseRemainder(ModLong m1, ModLong m2, java.util.List<ModLong> L1, java.util.List<ModLong> L2)	Modular digit list chinese remainder algorithm.

Uses of ModLong in edu.jas.fd

Methods in edu.jas.fd that return types with arguments of type ModLong

Modifier and Type	Method	Description
static 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 ModLong

Modifier and Type	Method	Description
static 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 ModLong

Modifier and Type	Method	Description
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, 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 ModLong

Modifier and Type	Method	Description
static 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.