Uses of Enum
edu.jas.gbufd.GBFactory.Algo

Packages that use GBFactory.Algo

Package	Description
edu.jas.application	Groebner base application package.
edu.jas.gbufd	Groebner bases using unique factorization package.

Uses of GBFactory.Algo in edu.jas.application

Methods in edu.jas.application with parameters of type GBFactory.Algo

Modifier and Type	Method	Description
GBAlgorithmBuilder<C>	GBAlgorithmBuilder.domainAlgorithm(GBFactory.Algo a)	Request d-, e- or i-GB algorithm.

Uses of GBFactory.Algo in edu.jas.gbufd

Subclasses with type arguments of type GBFactory.Algo in edu.jas.gbufd

Modifier and Type	Class	Description
static enum	GBFactory.Algo	Algorithm indicators: igb = integerGB, egb = e-GB, dgb = d-GB, qgb = fraction coefficients GB, ffgb = fraction free GB.

Methods in edu.jas.gbufd that return GBFactory.Algo

Modifier and Type	Method	Description
static GBFactory.Algo	GBFactory.Algo.valueOf(String name)	Returns the enum constant of this type with the specified name.
static GBFactory.Algo[]	GBFactory.Algo.values()	Returns an array containing the constants of this enum type, in the order they are declared.

Methods in edu.jas.gbufd with parameters of type GBFactory.Algo

Modifier and Type	Method	Description
static GroebnerBaseAbstract<BigInteger>	GBFactory.getImplementation(BigInteger fac, GBFactory.Algo a)	Determine suitable implementation of GB algorithms, case BigInteger.
static GroebnerBaseAbstract<BigInteger>	GBFactory.getImplementation(BigInteger fac, GBFactory.Algo a, PairList<BigInteger> pl)	Determine suitable implementation of GB algorithms, case BigInteger.
static GroebnerBaseAbstract<BigRational>	GBFactory.getImplementation(BigRational fac, GBFactory.Algo a)	Determine suitable implementation of GB algorithms, case BigRational.
static GroebnerBaseAbstract<BigRational>	GBFactory.getImplementation(BigRational fac, GBFactory.Algo a, PairList<BigRational> pl)	Determine suitable implementation of GB algorithms, case BigRational.
static <C extends GcdRingElem<C>> GroebnerBaseAbstract<GenPolynomial<C>>	GBFactory.getImplementation(GenPolynomialRing<C> fac, GBFactory.Algo a)	Determine suitable implementation of GB algorithms, case (recursive) polynomial.
static <C extends GcdRingElem<C>> GroebnerBaseAbstract<GenPolynomial<C>>	GBFactory.getImplementation(GenPolynomialRing<C> fac, GBFactory.Algo a, PairList<GenPolynomial<C>> pl)	Determine suitable implementation of GB algorithms, case (recursive) polynomial.
static <C extends GcdRingElem<C>> GroebnerBaseAbstract<Quotient<C>>	GBFactory.getImplementation(QuotientRing<C> fac, GBFactory.Algo a)	Determine suitable implementation of GB algorithms, case Quotient coefficients.
static <C extends GcdRingElem<C>> GroebnerBaseAbstract<Quotient<C>>	GBFactory.getImplementation(QuotientRing<C> fac, GBFactory.Algo a, PairList<Quotient<C>> pl)	Determine suitable implementation of GB algorithms, case Quotient coefficients.
static SolvableGroebnerBaseAbstract<BigInteger>	SGBFactory.getImplementation(BigInteger fac, GBFactory.Algo a)	Determine suitable implementation of GB algorithms, case BigInteger.
static SolvableGroebnerBaseAbstract<BigInteger>	SGBFactory.getImplementation(BigInteger fac, GBFactory.Algo a, PairList<BigInteger> pl)	Determine suitable implementation of GB algorithms, case BigInteger.
static SolvableGroebnerBaseAbstract<BigRational>	SGBFactory.getImplementation(BigRational fac, GBFactory.Algo a)	Determine suitable implementation of GB algorithms, case BigRational.
static SolvableGroebnerBaseAbstract<BigRational>	SGBFactory.getImplementation(BigRational fac, GBFactory.Algo a, PairList<BigRational> pl)	Determine suitable implementation of GB algorithms, case BigRational.
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<GenPolynomial<C>>	SGBFactory.getImplementation(GenPolynomialRing<C> fac, GBFactory.Algo a)	Determine suitable implementation of GB algorithms, case (recursive) polynomial.
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<GenPolynomial<C>>	SGBFactory.getImplementation(GenPolynomialRing<C> fac, GBFactory.Algo a, PairList<GenPolynomial<C>> pl)	Determine suitable implementation of GB algorithms, case (recursive) polynomial.
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<Quotient<C>>	SGBFactory.getImplementation(QuotientRing<C> fac, GBFactory.Algo a)	Determine suitable implementation of GB algorithms, case Quotient coefficients.
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<Quotient<C>>	SGBFactory.getImplementation(QuotientRing<C> fac, GBFactory.Algo a, PairList<Quotient<C>> pl)	Determine suitable implementation of GB algorithms, case Quotient coefficients.