edu.jas.ring
Class OrderedPairlistPS

java.lang.Object
  edu.jas.ring.OrderedPairlistPS

public class OrderedPairlistPS
extends java.lang.Object

Pair list management. Implemented using OrderedPolynomial, TreeMap and BitSet.

Constructor Summary

OrderedPairlistPS(TermOrder to)
Constructor for OrderedPairlist

Method Summary

boolean	GBCriterion3(int i, int j, ExpVector eij) GB criterium 3.
java.util.ArrayList	getList() Get the list of polynomials
boolean	hasNext() Test if there is possibly a pair in the list
int	pairCount() Get the total number of pairs generated
void	put(OrderedPolynomial p, Pair org) Put one Polynomial to the pairlist and reduction matrix record the orginating Pair / null
int	putCount() Get the number of polynomials put to the pairlist
void	putOne(OrderedPolynomial one, Pair org) Put to ONE-Polynomial to the pairlist
void	putParallel(OrderedPolynomial p, Pair org) Put parallel one Polynomial to the pairlist and reduction matrix, record the orginating Pair / null
int	remCount() Get the number of required pairs removed from the pairlist
void	removeAndPut()
Pair	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
Pair	removeNextParallel() 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
void	removeZeros()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

OrderedPairlistPS

public OrderedPairlistPS(TermOrder to)

Constructor for OrderedPairlist

Method Detail

putParallel

public void putParallel(OrderedPolynomial p,
                        Pair org)

Put parallel one Polynomial to the pairlist and reduction matrix, record the orginating Pair / null

removeZeros

public void removeZeros()

removeAndPut

public void removeAndPut()

removeNextParallel

public Pair removeNextParallel()

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

put

public void put(OrderedPolynomial p,
                Pair org)

Put one Polynomial to the pairlist and reduction matrix record the orginating Pair / null

removeNext

public Pair 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

hasNext

public boolean hasNext()

Test if there is possibly a pair in the list

getList

public java.util.ArrayList getList()

Get 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

pairCount

public int pairCount()

Get the total number of pairs generated

putOne

public void putOne(OrderedPolynomial one,
                   Pair org)

Put to ONE-Polynomial to the pairlist

GBCriterion3

public boolean GBCriterion3(int i,
                            int j,
                            ExpVector eij)

GB criterium 3.

Returns:

true if the S-polynomial(i,j) is required.