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 PairList<C>
GBAlgorithmBuilder. strategy
Requested pairlist strategy.Constructors in edu.jas.application with parameters of type PairList 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 PairList<C>
HybridReducerReceiverEC. pairlist
private PairList<C>
HybridReducerServerEC. pairlist
private PairList<C>
LeftSolvableReducer. pairlist
private PairList<C>
Reducer. pairlist
private PairList<C>
ReducerIter. pairlist
private PairList<C>
ReducerServerEC. pairlist
private PairList<C>
TwosidedSolvableReducer. pairlist
PairList<C>
GroebnerBaseAbstract. strategy
Strategy for pair selection.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 Constructor Description GroebnerBaseAbstract(PairList<C> pl)
Constructor.GroebnerBaseAbstract(Reduction<C> red, PairList<C> pl)
Constructor.GroebnerBaseDistributedEC(java.lang.String mfile, int threads, PairList<C> pl, int port)
Constructor.GroebnerBaseDistributedEC(java.lang.String mfile, int threads, java.util.concurrent.ExecutorService pool, PairList<C> pl, int port)
Constructor.GroebnerBaseDistributedHybridEC(java.lang.String mfile, int threads, int threadsPerNode, PairList<C> pl, int port)
Constructor.GroebnerBaseDistributedHybridEC(java.lang.String mfile, int threads, int threadsPerNode, java.util.concurrent.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, java.util.concurrent.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, java.util.concurrent.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.HybridReducerReceiverEC(Terminator fin, java.util.concurrent.atomic.AtomicInteger a, TaggedSocketChannel pc, DistHashTable<java.lang.Integer,GenPolynomial<C>> dl, PairList<C> L)
Constructor.HybridReducerServerEC(int tpn, Terminator fin, ChannelFactory cf, DistHashTable<java.lang.Integer,GenPolynomial<C>> dl, PairList<C> L)
Constructor.LeftSolvableReducer(Terminator fin, java.util.List<GenSolvablePolynomial<C>> G, PairList<C> L)
Reducer(Terminator fin, java.util.List<GenPolynomial<C>> G, PairList<C> L)
ReducerIter(Terminator fin, java.util.List<GenPolynomial<C>> G, PairList<C> L)
ReducerServerEC(Terminator fin, ChannelFactory cf, DistHashTable<java.lang.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, java.util.concurrent.ExecutorService pool, SolvableReduction<C> sred, PairList<C> pl)
Constructor.SolvableGroebnerBaseSeq(PairList<C> pl)
Constructor.SolvableGroebnerBaseSeq(SolvableReduction<C> sred, PairList<C> pl)
Constructor.TwosidedSolvableReducer(Terminator fin, int modv, java.util.List<GenSolvablePolynomial<C>> X, java.util.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 PairList<C>
PseudoReducer. pairlist
private 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.
-