edu.jas.gb
Class OrderedPairlist<C extends RingElem<C>>
- java.lang.Object
-
- edu.jas.gb.OrderedPairlist<C>
-
- All Implemented Interfaces:
- PairList<C>, java.io.Serializable
- Direct Known Subclasses:
- CriticalPairList, OrderedDPairlist, OrderedMinPairlist, OrderedRPairlist, OrderedSyzPairlist
public class OrderedPairlist<C extends RingElem<C>> extends java.lang.Object implements PairList<C>
Pair list management. The original Buchberger algorithm with criterions following Winkler in SAC-1, Kredel in ALDES/SAC-2, Kredel in MAS. Implemented using GenPolynomial, TreeMap and BitSet.- See Also:
- Serialized Form
-
-
Constructor Summary
Constructors Constructor and Description OrderedPairlist()Constructor.OrderedPairlist(GenPolynomialRing<C> r)Constructor.OrderedPairlist(int m, GenPolynomialRing<C> r)Constructor.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method and Description PairList<C>create(GenPolynomialRing<C> r)Create a new PairList.PairList<C>create(int m, GenPolynomialRing<C> r)Create a new PairList.booleancriterion3(int i, int j, ExpVector eij)GB criterium 3.java.util.List<GenPolynomial<C>>getList()Get the list of polynomials.booleanhasNext()Test if there is possibly a pair in the list.intput(GenPolynomial<C> p)Put one Polynomial to the pairlist and reduction matrix.intputCount()Get the number of polynomials put to the pairlist.intputOne()Put the ONE-Polynomial to the pairlist.intputOne(GenPolynomial<C> one)Put the ONE-Polynomial to the pairlist.intremCount()Get the number of required pairs removed from the pairlist.Pair<C>removeNext()Remove the next required pair from the pairlist and reduction matrix.intsize()Get the size of the list of polynomials.java.lang.StringtoString()toString.
-
-
-
Constructor Detail
-
OrderedPairlist
public OrderedPairlist()
Constructor.
-
OrderedPairlist
public OrderedPairlist(GenPolynomialRing<C> r)
Constructor.- Parameters:
r- polynomial factory.
-
OrderedPairlist
public OrderedPairlist(int m, GenPolynomialRing<C> r)Constructor.- Parameters:
m- number of module variables.r- polynomial factory.
-
-
Method Detail
-
create
public PairList<C> create(GenPolynomialRing<C> r)
Create a new PairList.
-
create
public PairList<C> create(int m, GenPolynomialRing<C> r)
Create a new PairList.
-
toString
public java.lang.String toString()
toString.
-
put
public int put(GenPolynomial<C> p)
Put one Polynomial to the pairlist and reduction matrix.
-
removeNext
public Pair<C> removeNext()
Remove the next required pair from the pairlist and reduction matrix. Appy the criterions 3 and 4 to see if the S-polynomial is required.- Specified by:
removeNextin interfacePairList<C extends RingElem<C>>- Returns:
- the next pair if one exists, otherwise null.
-
hasNext
public boolean hasNext()
Test if there is possibly a pair in the list.
-
getList
public java.util.List<GenPolynomial<C>> getList()
Get the list of polynomials.
-
size
public int size()
Get the size of the list of polynomials.
-
putCount
public int putCount()
Get the number of polynomials put to the pairlist.
-
remCount
public int remCount()
Get the number of required pairs removed from the pairlist.
-
putOne
public int putOne(GenPolynomial<C> one)
Put the ONE-Polynomial to the pairlist.- Parameters:
one- polynomial. (no more required)- Returns:
- the index of the last polynomial.
-
putOne
public int putOne()
Put the ONE-Polynomial to the pairlist.
-
-
DMelt 3.0 © DataMelt by jWork.ORG