Uses of Interface
edu.jas.gb.PairList

Packages that use PairList

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

Uses of PairList in edu.jas.application

Fields in edu.jas.application declared as PairList

Modifier and Type	Field	Description
final PairList<C>	GBAlgorithmBuilder.strategy	Requested pairlist strategy.

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

Modifier	Constructor	Description
	GBAlgorithmBuilder(GenPolynomialRing<C> ring, GroebnerBaseAbstract<C> algo, PairList<C> strategy)	Constructor.

Uses of PairList in edu.jas.gb

Classes in edu.jas.gb that implement PairList

Modifier and Type	Class	Description
class	CriticalPairList<C extends RingElem<C>>	Critical pair list management.
class	OrderedDPairlist<C extends RingElem<C>>	Pair list management for d-Groebner bases.
class	OrderedMinPairlist<C extends RingElem<C>>	Pair list management.
class	OrderedPairlist<C extends RingElem<C>>	Pair list management.
class	OrderedSyzPairlist<C extends RingElem<C>>	Pair list management.

Fields in edu.jas.gb declared as PairList

Modifier and Type	Field	Description
private final PairList<C>	HybridReducerReceiverEC.pairlist
private final PairList<C>	HybridReducerServerEC.pairlist
private final PairList<C>	LeftSolvableReducer.pairlist
private final PairList<C>	Reducer.pairlist
private final PairList<C>	ReducerIter.pairlist
private final PairList<C>	ReducerServerEC.pairlist
private final PairList<C>	TwosidedSolvableReducer.pairlist
final PairList<C>	GroebnerBaseAbstract.strategy	Strategy for pair selection.
final PairList<C>	SolvableGroebnerBaseAbstract.strategy	Strategy for pair selection.

Methods in edu.jas.gb that return PairList

Modifier and Type	Method	Description
PairList<C>	CriticalPairList.create(int m, GenPolynomialRing<C> r)	Create a new PairList.
PairList<C>	CriticalPairList.create(GenPolynomialRing<C> r)	Create a new PairList.
PairList<C>	OrderedDPairlist.create(int m, GenPolynomialRing<C> r)	Create a new PairList.
PairList<C>	OrderedDPairlist.create(GenPolynomialRing<C> r)	Create a new PairList.
PairList<C>	OrderedMinPairlist.create(int m, GenPolynomialRing<C> r)	Create a new PairList.
PairList<C>	OrderedMinPairlist.create(GenPolynomialRing<C> r)	Create a new PairList.
PairList<C>	OrderedPairlist.create(int m, GenPolynomialRing<C> r)	Create a new PairList.
PairList<C>	OrderedPairlist.create(GenPolynomialRing<C> r)	Create a new PairList.
PairList<C>	OrderedSyzPairlist.create(int m, GenPolynomialRing<C> r)	Create a new PairList.
PairList<C>	OrderedSyzPairlist.create(GenPolynomialRing<C> r)	Create a new PairList.
PairList<C>	PairList.create(int m, GenPolynomialRing<C> r)	Create a new PairList.
PairList<C>	PairList.create(GenPolynomialRing<C> r)	Create a new PairList.

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

Modifier	Constructor	Description
	GroebnerBaseAbstract(PairList<C> pl)	Constructor.
	GroebnerBaseAbstract(Reduction<C> red, PairList<C> pl)	Constructor.
	GroebnerBaseDistributedEC(String mfile, int threads, PairList<C> pl, int port)	Constructor.
	GroebnerBaseDistributedEC(String mfile, int threads, ExecutorService pool, PairList<C> pl, int port)	Constructor.
	GroebnerBaseDistributedHybridEC(String mfile, int threads, int threadsPerNode, PairList<C> pl, int port)	Constructor.
	GroebnerBaseDistributedHybridEC(String mfile, int threads, int threadsPerNode, ExecutorService pool, PairList<C> pl, int port)	Constructor.
	GroebnerBaseParallel(int threads, PairList<C> pl)	Constructor.
	GroebnerBaseParallel(int threads, Reduction<C> red, PairList<C> pl)	Constructor.
	GroebnerBaseParallel(int threads, ExecutorService pool, Reduction<C> red, PairList<C> pl)	Constructor.
	GroebnerBaseParIter(int threads, PairList<C> pl)	Constructor.
	GroebnerBaseParIter(int threads, Reduction<C> red, PairList<C> pl)	Constructor.
	GroebnerBaseParIter(int threads, ExecutorService pool, Reduction<C> red, PairList<C> pl)	Constructor.
	GroebnerBaseSeq(PairList<C> pl)	Constructor.
	GroebnerBaseSeq(Reduction<C> red, PairList<C> pl)	Constructor.
	GroebnerBaseSeqIter(PairList<C> pl)	Constructor.
	GroebnerBaseSeqIter(Reduction<C> red, PairList<C> pl)	Constructor.
(package private)	HybridReducerReceiverEC(Terminator fin, AtomicInteger a, TaggedSocketChannel pc, DistHashTable<Integer, GenPolynomial<C>> dl, PairList<C> L)	Constructor.
(package private)	HybridReducerServerEC(int tpn, Terminator fin, ChannelFactory cf, DistHashTable<Integer, GenPolynomial<C>> dl, PairList<C> L)	Constructor.
(package private)	LeftSolvableReducer(Terminator fin, List<GenSolvablePolynomial<C>> G, PairList<C> L)
(package private)	Reducer(Terminator fin, List<GenPolynomial<C>> G, PairList<C> L)
(package private)	ReducerIter(Terminator fin, List<GenPolynomial<C>> G, PairList<C> L)
(package private)	ReducerServerEC(Terminator fin, ChannelFactory cf, DistHashTable<Integer, GenPolynomial<C>> dl, PairList<C> L)
	SolvableGroebnerBaseAbstract(PairList<C> pl)	Constructor.
	SolvableGroebnerBaseAbstract(SolvableReduction<C> sred, PairList<C> pl)	Constructor.
	SolvableGroebnerBaseParallel(int threads, PairList<C> pl)	Constructor.
	SolvableGroebnerBaseParallel(int threads, SolvableReduction<C> sred, PairList<C> pl)	Constructor.
	SolvableGroebnerBaseParallel(int threads, ExecutorService pool, SolvableReduction<C> sred, PairList<C> pl)	Constructor.
	SolvableGroebnerBaseSeq(PairList<C> pl)	Constructor.
	SolvableGroebnerBaseSeq(SolvableReduction<C> sred, PairList<C> pl)	Constructor.
(package private)	TwosidedSolvableReducer(Terminator fin, int modv, List<GenSolvablePolynomial<C>> X, List<GenSolvablePolynomial<C>> G, PairList<C> L)

Uses of PairList in edu.jas.gbufd

Classes in edu.jas.gbufd that implement PairList

Modifier and Type	Class	Description
class	OrderedRPairlist<C extends RegularRingElem<C>>	Pair list management for R-Groebner bases.

Fields in edu.jas.gbufd declared as PairList

Modifier and Type	Field	Description
private final PairList<C>	PseudoReducer.pairlist
private final PairList<GenPolynomial<C>>	PseudoReducerRec.pairlist

Methods in edu.jas.gbufd with parameters of type PairList

Modifier and Type	Method	Description
static GroebnerBaseAbstract<BigInteger>	GBFactory.getImplementation(BigInteger fac, PairList<BigInteger> pl)	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, PairList<BigRational> pl)	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 GroebnerBaseAbstract<ModInteger>	GBFactory.getImplementation(ModIntegerRing fac, PairList<ModInteger> pl)	Determine suitable implementation of GB algorithms, case ModInteger.
static GroebnerBaseAbstract<ModInt>	GBFactory.getImplementation(ModIntRing fac, PairList<ModInt> pl)	Determine suitable implementation of GB algorithms, case ModInt.
static GroebnerBaseAbstract<ModLong>	GBFactory.getImplementation(ModLongRing fac, PairList<ModLong> pl)	Determine suitable implementation of GB algorithms, case ModLong.
static <C extends GcdRingElem<C>> GroebnerBaseAbstract<GenPolynomial<C>>	GBFactory.getImplementation(GenPolynomialRing<C> fac, PairList<GenPolynomial<C>> pl)	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<C>	GBFactory.getImplementation(RingFactory<C> fac, PairList<C> pl)	Determine suitable implementation of GB algorithms, other cases.
static <C extends GcdRingElem<C>> GroebnerBaseAbstract<Quotient<C>>	GBFactory.getImplementation(QuotientRing<C> fac, PairList<Quotient<C>> pl)	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, PairList<BigInteger> pl)	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, PairList<BigRational> pl)	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, PairList<ModInteger> pl)	Determine suitable implementation of GB algorithms, case ModInteger.
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, 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, 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, PairList<C> pl)	Determine suitable implementation of GB algorithms, other cases.
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, PairList<Quotient<C>> pl)	Determine suitable implementation of GB algorithms, case Quotient coefficients.
static <C extends GcdRingElem<C>> GroebnerBaseAbstract<C>	GBFactory.getProxy(RingFactory<C> fac, PairList<C> pl)	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.

Constructors in edu.jas.gbufd with parameters of type PairList

Modifier	Constructor	Description
	GroebnerBaseFGLM(Reduction<C> red, PairList<C> pl)	Constructor.
	GroebnerBaseFGLM(Reduction<C> red, PairList<C> pl, GroebnerBaseAbstract<C> gb)	Constructor.
	GroebnerBasePseudoParallel(int threads, RingFactory<C> rf, PairList<C> pl)	Constructor.
	GroebnerBasePseudoParallel(int threads, RingFactory<C> rf, PseudoReduction<C> red, ExecutorService pool, PairList<C> pl)	Constructor.
	GroebnerBasePseudoRecParallel(int threads, RingFactory<GenPolynomial<C>> rf, PairList<GenPolynomial<C>> pl)	Constructor.
	GroebnerBasePseudoRecParallel(int threads, RingFactory<GenPolynomial<C>> rf, PseudoReduction<GenPolynomial<C>> red, ExecutorService pool, PairList<GenPolynomial<C>> pl)	Constructor.
	GroebnerBasePseudoRecSeq(PseudoReduction<GenPolynomial<C>> red, RingFactory<GenPolynomial<C>> rf, PairList<GenPolynomial<C>> pl)	Constructor.
	GroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf, PairList<GenPolynomial<C>> pl)	Constructor.
	GroebnerBasePseudoSeq(PseudoReduction<C> red, RingFactory<C> rf, PairList<C> pl)	Constructor.
	GroebnerBasePseudoSeq(RingFactory<C> rf, PairList<C> pl)	Constructor.
	GroebnerBaseQuotient(int threads, QuotientRing<C> rf, PairList<GenPolynomial<C>> pl)	Constructor.
	GroebnerBaseQuotient(QuotientRing<C> rf, PairList<GenPolynomial<C>> pl)	Constructor.
	GroebnerBaseRational(int threads, PairList<BigInteger> pl)	Constructor.
	GroebnerBaseRational(PairList<BigInteger> pl)	Constructor.
(package private)	PseudoReducer(Terminator fin, List<GenPolynomial<C>> G, PairList<C> L, GreatestCommonDivisorAbstract<C> engine)
(package private)	PseudoReducerRec(Terminator fin, List<GenPolynomial<GenPolynomial<C>>> G, PairList<GenPolynomial<C>> L, GreatestCommonDivisorAbstract<C> engine)
	SolvableGroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf, PairList<GenPolynomial<C>> pl)	Constructor.
	SolvableGroebnerBasePseudoRecSeq(RingFactory<GenPolynomial<C>> rf, SolvablePseudoReduction<C> red, PairList<GenPolynomial<C>> pl)	Constructor.
	SolvableGroebnerBasePseudoSeq(SolvablePseudoReduction<C> red, RingFactory<C> rf, PairList<C> pl)	Constructor.
	SolvableGroebnerBasePseudoSeq(RingFactory<C> rf, PairList<C> pl)	Constructor.