Uses of Class
edu.jas.fd.GreatestCommonDivisorAbstract
-
Packages that use GreatestCommonDivisorAbstract Package Description edu.jas.application Groebner base application package.edu.jas.fd Factorization domain package for solvable polynomial rings. -
-
Uses of GreatestCommonDivisorAbstract in edu.jas.application
Fields in edu.jas.application declared as GreatestCommonDivisorAbstract Modifier and Type Field Description GreatestCommonDivisorAbstract<C>
SolvableLocalResidueRing. fdengine
FD engine of the factory.GreatestCommonDivisorAbstract<C>
SolvableLocalRing. fdengine
FD engine of the factory. -
Uses of GreatestCommonDivisorAbstract in edu.jas.fd
Subclasses of GreatestCommonDivisorAbstract in edu.jas.fd Modifier and Type Class Description class
GreatestCommonDivisorFake<C extends GcdRingElem<C>>
(Non-unique) factorization domain greatest common divisor common algorithms with monic polynomial remainder sequence.class
GreatestCommonDivisorPrimitive<C extends GcdRingElem<C>>
(Non-unique) factorization domain greatest common divisor common algorithms with primitive polynomial remainder sequence.class
GreatestCommonDivisorSimple<C extends GcdRingElem<C>>
(Non-unique) factorization domain greatest common divisor common algorithms with monic polynomial remainder sequence.class
GreatestCommonDivisorSyzygy<C extends GcdRingElem<C>>
(Non-unique) factorization domain greatest common divisor common algorithms with syzygy computation.class
SGCDParallelProxy<C extends GcdRingElem<C>>
Solvable greatest common divisor parallel proxy.Fields in edu.jas.fd declared as GreatestCommonDivisorAbstract Modifier and Type Field Description GreatestCommonDivisorAbstract<C>
SGCDParallelProxy. e0
GCD engines.GreatestCommonDivisorAbstract<C>
SGCDParallelProxy. e1
GreatestCommonDivisorAbstract<C>
SGCDParallelProxy. e2
GreatestCommonDivisorAbstract<C>
SolvableQuotientRing. fdengine
FD engine of the factory.Methods in edu.jas.fd that return GreatestCommonDivisorAbstract Modifier and Type Method Description static <C extends GcdRingElem<C>>
GreatestCommonDivisorAbstract<C>SGCDFactory. getFakeImplementation(RingFactory<C> fac)
Determine fake implementation of gcd algorithms, other cases.static GreatestCommonDivisorAbstract<BigInteger>
SGCDFactory. getImplementation(BigInteger fac)
Determine suitable implementation of gcd algorithms, case BigInteger.static GreatestCommonDivisorAbstract<BigRational>
SGCDFactory. getImplementation(BigRational fac)
Determine suitable implementation of gcd algorithms, case BigRational.static GreatestCommonDivisorAbstract<ModInteger>
SGCDFactory. getImplementation(ModIntegerRing fac)
Determine suitable implementation of gcd algorithms, case ModInteger.static GreatestCommonDivisorAbstract<ModLong>
SGCDFactory. getImplementation(ModLongRing fac)
Determine suitable implementation of gcd algorithms, case ModLong.static <C extends GcdRingElem<C>>
GreatestCommonDivisorAbstract<C>SGCDFactory. getImplementation(RingFactory<C> fac)
Determine suitable implementation of gcd algorithms, other cases.static GreatestCommonDivisorAbstract<BigInteger>
SGCDFactory. getProxy(BigInteger fac)
Determine suitable proxy for gcd algorithms, case BigInteger.static GreatestCommonDivisorAbstract<BigRational>
SGCDFactory. getProxy(BigRational fac)
Determine suitable proxy for gcd algorithms, case BigRational.static GreatestCommonDivisorAbstract<ModInteger>
SGCDFactory. getProxy(ModIntegerRing fac)
Determine suitable proxy for gcd algorithms, case ModInteger.static GreatestCommonDivisorAbstract<ModLong>
SGCDFactory. getProxy(ModLongRing fac)
Determine suitable proxy for gcd algorithms, case ModLong.static <C extends GcdRingElem<C>>
GreatestCommonDivisorAbstract<C>SGCDFactory. getProxy(RingFactory<C> fac)
Determine suitable proxy for gcd algorithms, other cases.Constructors in edu.jas.fd with parameters of type GreatestCommonDivisorAbstract Constructor Description SGCDParallelProxy(RingFactory<C> cf, GreatestCommonDivisorAbstract<C> e1, GreatestCommonDivisorAbstract<C> e2)
ParallelProxy constructor.
-