程序包 proguard.analysis.cpa.defaults

类 StackAbstractState<AbstractSpaceT extends AbstractState<AbstractSpaceT>>

java.lang.Object

java.util.AbstractCollection<E>

java.util.AbstractList<E>

java.util.Vector<E>

java.util.Stack<AbstractSpaceT>

proguard.analysis.cpa.defaults.StackAbstractState<AbstractSpaceT>

所有已实现的接口:

java.io.Serializable, java.lang.Cloneable, java.lang.Iterable<AbstractSpaceT>, java.util.Collection<AbstractSpaceT>, java.util.List<AbstractSpaceT>, java.util.RandomAccess, AbstractState<StackAbstractState<AbstractSpaceT>>

public class StackAbstractState<AbstractSpaceT extends AbstractState<AbstractSpaceT>>
extends java.util.Stack<AbstractSpaceT>
implements AbstractState<StackAbstractState<AbstractSpaceT>>

This StackAbstractState represents a stack of AbstractStates with the semilattice operators lifted to the stack.

另请参阅:

序列化表格

字段概要

从类继承的字段 java.util.Vector

capacityIncrement, elementCount, elementData

从类继承的字段 java.util.AbstractList

modCount

构造器概要

构造器

构造器	说明
StackAbstractState()

方法概要

修饰符和类型	方法	说明
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.

从类继承的方法 java.util.Stack

empty, peek, pop, push, search

从类继承的方法 java.util.Vector

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, trimToSize

从类继承的方法 java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

从接口继承的方法 proguard.analysis.cpa.interfaces.AbstractState

equals, getPrecision, hashCode, isLess

从接口继承的方法 java.util.Collection

parallelStream, stream, toArray

构造器详细资料

StackAbstractState

public StackAbstractState()

方法详细资料

join

public StackAbstractState<AbstractSpaceT> join(StackAbstractState<AbstractSpaceT> abstractState)

从接口复制的说明: AbstractState

Computes a join over itself and another abstract state abstractState (i.e., finds the least upper bound on the semilattice).

指定者:

join 在接口中 AbstractState<AbstractSpaceT extends AbstractState<AbstractSpaceT>>

isLessOrEqual

public boolean isLessOrEqual(StackAbstractState<AbstractSpaceT> abstractState)

从接口复制的说明: AbstractState

Compares itself to the abstractState (i.e., compare the states on the partial order provided by the domain of the analysis).

指定者:

isLessOrEqual 在接口中 AbstractState<AbstractSpaceT extends AbstractState<AbstractSpaceT>>

copy

public StackAbstractState<AbstractSpaceT> copy()

从接口复制的说明: AbstractState

Creates a copy of itself.

指定者:

copy 在接口中 AbstractState<AbstractSpaceT extends AbstractState<AbstractSpaceT>>

popOrDefault

public AbstractSpaceT popOrDefault(AbstractSpaceT defaultState)

Removes the top of the stack and returns it. If the stack is empty, it returns the defaultState.

peek

public AbstractSpaceT peek(int index)

Returns the indexth element from the top of the stack. If the stack does not have enough elements, it throws an exception.

peekOrDefault

public AbstractSpaceT peekOrDefault(int index,
                                    AbstractSpaceT defaultState)

Returns the indexth element from the top of the stack. If the stack does not have enough elements, it returns the defaultState.