public class StackAbstractState<AbstractSpaceT extends AbstractState<AbstractSpaceT>> extends java.util.Stack<AbstractSpaceT> implements AbstractState<StackAbstractState<AbstractSpaceT>>
StackAbstractState represents a stack of AbstractStates with the semilattice
operators lifted to the stack.| Constructor and Description |
|---|
StackAbstractState() |
| Modifier and Type | Method and Description |
|---|---|
StackAbstractState<AbstractSpaceT> |
copy()
Creates a copy of itself.
|
boolean |
isLessOrEqual(StackAbstractState<AbstractSpaceT> abstractState)
Compares itself to the
abstractState (i.e., compare the states on the partial order
provided by the domain of the analysis). |
StackAbstractState<AbstractSpaceT> |
join(StackAbstractState<AbstractSpaceT> abstractState)
Computes a join over itself and another abstract state
abstractState (i.e., finds the
least upper bound on the semilattice). |
AbstractSpaceT |
peek(int index)
Returns the
indexth element from the top of the stack. |
AbstractSpaceT |
peekOrDefault(int index,
AbstractSpaceT defaultState)
Returns the
indexth element from the top of the stack. |
AbstractSpaceT |
popOrDefault(AbstractSpaceT defaultState)
Removes the top of the stack and returns it.
|
add, add, addAll, addAll, addElement, capacity, clear, clone, contains, containsAll, copyInto, elementAt, elements, ensureCapacity, equals, firstElement, forEach, get, hashCode, indexOf, indexOf, insertElementAt, isEmpty, iterator, lastElement, lastIndexOf, lastIndexOf, listIterator, listIterator, remove, remove, removeAll, removeAllElements, removeElement, removeElementAt, removeIf, removeRange, replaceAll, retainAll, set, setElementAt, setSize, size, sort, spliterator, subList, toArray, toArray, toString, trimToSizeequals, finalize, getClass, notify, notifyAll, wait, wait, waitequals, getPrecision, hashCode, isLesspublic StackAbstractState<AbstractSpaceT> join(StackAbstractState<AbstractSpaceT> abstractState)
AbstractStateabstractState (i.e., finds the
least upper bound on the semilattice).join in interface AbstractState<StackAbstractState<AbstractSpaceT extends AbstractState<AbstractSpaceT>>>public boolean isLessOrEqual(StackAbstractState<AbstractSpaceT> abstractState)
AbstractStateabstractState (i.e., compare the states on the partial order
provided by the domain of the analysis).isLessOrEqual in interface AbstractState<StackAbstractState<AbstractSpaceT extends AbstractState<AbstractSpaceT>>>public StackAbstractState<AbstractSpaceT> copy()
AbstractStatecopy in interface AbstractState<StackAbstractState<AbstractSpaceT extends AbstractState<AbstractSpaceT>>>public AbstractSpaceT popOrDefault(AbstractSpaceT defaultState)
defaultState.public AbstractSpaceT peek(int index)
indexth element from the top of the stack. If the stack does not have
enough elements, it throws an exception.public AbstractSpaceT peekOrDefault(int index, AbstractSpaceT defaultState)
indexth element from the top of the stack. If the stack does not have
enough elements, it returns the defaultState.