Uses of Class
edu.jas.gb.SolvableGroebnerBaseAbstract

Packages that use SolvableGroebnerBaseAbstract

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

Uses of SolvableGroebnerBaseAbstract in edu.jas.application

Fields in edu.jas.application declared as SolvableGroebnerBaseAbstract

Modifier and Type	Field	Description
protected final SolvableGroebnerBaseAbstract<C>	SolvableIdeal.bb	Groebner base engine.
protected final SolvableGroebnerBaseAbstract<C>	SolvableLocalResidueRing.bb	Groebner base engine.
protected final SolvableGroebnerBaseAbstract<C>	SolvableLocalRing.bb	Groebner base engine.
protected final SolvableGroebnerBaseAbstract<C>	SolvableResidueRing.bb	Groebner base engine.

Constructors in edu.jas.application with parameters of type SolvableGroebnerBaseAbstract

Modifier	Constructor	Description
	SolvableIdeal(PolynomialList<C> list, boolean gb, boolean topt, SolvableGroebnerBaseAbstract<C> bb)	Constructor.
	SolvableIdeal(PolynomialList<C> list, boolean gb, boolean topt, SolvableGroebnerBaseAbstract<C> bb, SolvableReduction<C> red)	Constructor.
	SolvableIdeal(PolynomialList<C> list, boolean gb, boolean topt, SolvableGroebnerBaseAbstract<C> bb, SolvableReduction<C> red, SolvableIdeal.Side s)	Constructor.
	SolvableIdeal(PolynomialList<C> list, boolean gb, SolvableGroebnerBaseAbstract<C> bb)	Constructor.
	SolvableIdeal(PolynomialList<C> list, boolean gb, SolvableGroebnerBaseAbstract<C> bb, SolvableReduction<C> red)	Constructor.
	SolvableIdeal(PolynomialList<C> list, SolvableGroebnerBaseAbstract<C> bb, SolvableReduction<C> red)	Constructor.

Uses of SolvableGroebnerBaseAbstract in edu.jas.gb

Subclasses of SolvableGroebnerBaseAbstract in edu.jas.gb

Modifier and Type	Class	Description
class	SGBProxy<C extends GcdRingElem<C>>	Groebner bases parallel proxy.
class	SolvableGroebnerBaseParallel<C extends RingElem<C>>	Solvable Groebner Base parallel algorithm.
class	SolvableGroebnerBaseSeq<C extends RingElem<C>>	Solvable Groebner bases sequential algorithms.
class	SolvableGroebnerBaseSeqPairParallel<C extends RingElem<C>>	Solvable Groebner Base parallel algorithm.

Fields in edu.jas.gb declared as SolvableGroebnerBaseAbstract

Modifier and Type	Field	Description
final SolvableGroebnerBaseAbstract<C>	SGBProxy.e1	GB engines.
final SolvableGroebnerBaseAbstract<C>	SGBProxy.e2

Constructors in edu.jas.gb with parameters of type SolvableGroebnerBaseAbstract

Modifier	Constructor	Description
	SGBProxy(SolvableGroebnerBaseAbstract<C> e1, SolvableGroebnerBaseAbstract<C> e2)	Proxy constructor.

Uses of SolvableGroebnerBaseAbstract in edu.jas.gbmod

Fields in edu.jas.gbmod declared as SolvableGroebnerBaseAbstract

Modifier and Type	Field	Description
protected final SolvableGroebnerBaseAbstract<C>	ModSolvableGroebnerBaseSeq.sbb	Deprecated. Used Solvable Groebner base algorithm.

Constructors in edu.jas.gbmod with parameters of type SolvableGroebnerBaseAbstract

Modifier	Constructor	Description
	ModSolvableGroebnerBasePar(SolvableGroebnerBaseAbstract<C> sbb)	Deprecated. Constructor.
	ModSolvableGroebnerBaseSeq(SolvableGroebnerBaseAbstract<C> sbb)	Deprecated. Constructor.

Uses of SolvableGroebnerBaseAbstract in edu.jas.gbufd

Subclasses of SolvableGroebnerBaseAbstract in edu.jas.gbufd

Modifier and Type	Class	Description
class	SolvableGroebnerBasePseudoRecSeq<C extends GcdRingElem<C>>	Solvable Groebner Base with pseudo reduction sequential algorithm.
class	SolvableGroebnerBasePseudoSeq<C extends GcdRingElem<C>>	Solvable Groebner Base with pseudo reduction sequential algorithm.

Methods in edu.jas.gbufd that return SolvableGroebnerBaseAbstract

Modifier and Type	Method	Description
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<C>	SGBFactory.getImplementation()	Determine suitable implementation of GB algorithms, no factory case.
static SolvableGroebnerBaseAbstract<BigInteger>	SGBFactory.getImplementation(BigInteger fac)	Determine suitable implementation of GB algorithms, case BigInteger.
static SolvableGroebnerBaseAbstract<BigInteger>	SGBFactory.getImplementation(BigInteger fac, PairList<BigInteger> pl)	Determine suitable implementation of GB algorithms, case BigInteger.
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)	Determine suitable implementation of GB algorithms, case BigRational.
static SolvableGroebnerBaseAbstract<BigRational>	SGBFactory.getImplementation(BigRational fac, PairList<BigRational> pl)	Determine suitable implementation of GB algorithms, case BigRational.
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 SolvableGroebnerBaseAbstract<ModInteger>	SGBFactory.getImplementation(ModIntegerRing fac)	Determine suitable implementation of GB algorithms, case ModInteger.
static SolvableGroebnerBaseAbstract<ModInteger>	SGBFactory.getImplementation(ModIntegerRing fac, PairList<ModInteger> pl)	Determine suitable implementation of GB algorithms, case ModInteger.
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.
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<GenPolynomial<C>>	SGBFactory.getImplementation(GenPolynomialRing<C> fac)	Determine suitable implementation of GB algorithms, case (recursive) polynomial.
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<GenPolynomial<C>>	SGBFactory.getImplementation(GenPolynomialRing<C> fac, PairList<GenPolynomial<C>> pl)	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)	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<C>	SGBFactory.getImplementation(RingFactory<C> fac)	Determine suitable implementation of GB algorithms, other cases.
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<C>	SGBFactory.getImplementation(RingFactory<C> fac, PairList<C> pl)	Determine suitable implementation of GB algorithms, other cases.
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<Quotient<C>>	SGBFactory.getImplementation(QuotientRing<C> fac)	Determine suitable implementation of GB algorithms, case Quotient coefficients.
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<Quotient<C>>	SGBFactory.getImplementation(QuotientRing<C> fac, PairList<Quotient<C>> pl)	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)	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.
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<GenPolynomial<C>>	SGBFactory.getProxy(GenPolynomialRing<C> fac)	Determine suitable parallel/concurrent implementation of GB algorithms if possible.
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<C>	SGBFactory.getProxy(RingFactory<C> fac)	Determine suitable parallel/concurrent implementation of GB algorithms if possible.
static <C extends GcdRingElem<C>> SolvableGroebnerBaseAbstract<C>	SGBFactory.getProxy(RingFactory<C> fac, PairList<C> pl)	Determine suitable parallel/concurrent implementation of GB algorithms if possible.