All Classes (com.ibm.wala.util 1.5.0 API)

All Classes Interface Summary Class Summary Enum Summary Exception Summary Error Summary
Class	Description
AbstractFixedPointSolver<T extends IVariable<T>>	Represents a set of `IFixedPointStatement`s to be solved by a `IFixedPointSolver`
AbstractGraph<T>	Basic functionality for a `Graph` that delegates node and edge management.
AbstractLabeledGraph<T,U>
AbstractMeetOperator<T extends IVariable<T>>	Abstract superclass for meet operators
AbstractNumberedGraph<T>	Basic functionality for a graph that delegates node and edge management, and tracks node numbers
AbstractNumberedLabeledGraph<T,U>
AbstractOperator<T extends IVariable<T>>	operator for a step in an iterative solver This is an abstract class and not an interface in order to force subclasses to re-implement equals(), hashCode(), and toString()
AbstractStatement<T extends IVariable<T>,O extends AbstractOperator<T>>	Represents a single step in an iterative solver
AbstractVariable<T extends AbstractVariable<T>>	Represents a single variable in a fixed-point system.
Acyclic	Utilities for dealing with acyclic subgraphs
ArrayIterator<T>	an Iterator of array elements
ArrayNonNullIterator<T>	Iterator that only returns non-null elements of the array hasNext() return true when there is a non-null element, false otherwise next() returns the current element and advances the counter up to the next non-null element or beyond the limit of the array
ArraySet<T>	A set implementation backed by an array.
ArraySetMultiMap<K,V>
Assertions	WALA-specific assertion checking.
BasicFramework<T,V extends IVariable<V>>	a basic implementation of the dataflow framework
BasicLauncher	A generic process launcher
BasicNaturalRelation	A relation between non-negative integers This implementation uses n IntVectors, to hold the first n y's associated with each x, and then 1 extra vector of SparseIntSet to hold the remaining ys.
BasicNodeManager<T>	Simple implementation of a `NodeManager`.
BasicNullaryStatement<T extends IVariable<T>>	An implementation of NullaryStep that carries its operator explicitly
BasicOrderedMultiGraph<T>	Inefficient implementation of OrderedMultiGraph.
BasicTree<T>	A simple, extremely inefficient tree implementation
BasicUnaryStatement<T extends IVariable<T>>	An implementation of UnaryStatement that carries its operator explicitly
BFSIterator<T>	This class implements breadth-first search over a Graph, returning an Iterator of the nodes of the graph in order of discovery.
BFSPathFinder<T>	This class searches breadth-first for node that matches some criteria.
BimodalMap<K,V>	This implementation of `Map` chooses between one of two implementations, depending on the size of the map.
BimodalMutableIntSet	An implementation of `MutableIntSet` that delegates to either a `MutableSparseIntSet` or a `BitVectorIntSet`
BimodalMutableIntSetFactory	An object that creates some bimodal mutable int sets.
Bits	utilities for manipulating values at the bit-level.
BitSet<T>	A bit set is a set of elements, each of which corresponds to a unique integer from [0,MAX].
BitVector
BitVectorBase<T extends BitVectorBase>	Abstract base class for implementations of bitvectors
BitVectorFilter	Operator OUT = IN - filterSet
BitVectorFramework<T,L>	a basic implementation of the dataflow framework
BitVectorIdentity	Operator OUT = IN
BitVectorIntersection	Operator U(n) = U(n) n U(j)
BitVectorIntSet	A `BitVector` implementation of `MutableIntSet`.
BitVectorIntSetFactory
BitVectorKillAll	Just kills everything
BitVectorKillGen	Operator OUT = (IN - kill) U gen
BitVectorMinusVector	Operator OUT = IN / v
BitVectorOr	Operator OUT = IN U v
BitVectorRepository	A repository for shared bit vectors as described by Heintze
BitVectorSolver<T>	A `DataflowSolver` specialized for `BitVectorVariable`s
BitVectorUnion	Operator U(n) = U(n) U U(j)
BitVectorUnionConstant	Operator OUT = IN U c
BitVectorUnionVector	Operator lhs = lhs U rhs U v
BitVectorVariable	A bit vector variable for dataflow analysis.
BooleanIdentity	Operator OUT = IN
BooleanSolver<T>	A `DataflowSolver` specialized for `BooleanVariable`s
BooleanUnion	Operator U(n) = U(n) U U(j)
BooleanVariable	A boolean variable for dataflow analysis.
BoundedBFSIterator<T>	This class implements breadth-first search over a Graph, returning an Iterator of the nodes of the graph in order of discovery.
CancelException	An exception for when work is canceled in eclipse.
CollectionFilter<T>	A filter defined by set membership
CommandLine	utilities for parsing a command line
ComposedIterator<O,I>	A 2-level iterator.
CompoundIntIterator	An Iterator which provides a concatenation of two IntIterators.
CompoundIterator<T>	An iterator which provides a logical concatenation of the lists from two other iterators
DataflowSolver<T,V extends IVariable<V>>	Iterative solver for a Killdall dataflow framework
DebuggingMutableIntSetFactory	A debugging factory that creates debugging bitsets that are implemented as two bitsets that perform consistency checks for every operation.
DefaultFixedPointSolver<T extends IVariable<T>>	Default implementation of a fixed point solver.
DefaultFixedPointSystem<T extends IVariable<T>>	Default implementation of a dataflow graph
DelegatingGraph<T>	A utility class.
DelegatingNumberedEdgeManager<T extends INodeWithNumberedEdges>	An object that delegates edge management to the nodes, `INodeWithNumberedEdges`
DelegatingNumberedGraph<T extends INodeWithNumberedEdges>	Basic functionality for a graph that delegates node and edge management, and tracks node numbers
DelegatingNumberedNodeManager<T extends INodeWithNumber>	Basic implementation of a numbered graph -- this implementation relies on nodes that carry numbers and edges.
DFS	utilities related to depth-first search.
DFSAllPathsFinder<T>	Extends `DFSPathFinder` to discover all paths from a set of root nodes to nodes passing some `Predicate`.
DFSDiscoverTimeIterator<T>	This class implements depth-first search over a `NumberedGraph`, return an enumeration of the nodes of the graph in order of increasing discover time.
DFSFinishTimeIterator<T>	This class implements depth-first search over a `Graph`, return an enumeration of the nodes of the graph in order of increasing finishing time.
DFSPathFinder<T>	This class searches depth-first search for node that matches some criteria.
DominanceFrontiers<T>	An object that computes the dominance frontiers of a graph
Dominators<T>	Calculate dominators using Langauer and Tarjan's fastest algorithm.
DotUtil	utilities for interfacing with DOT
DotUtil.DotOutputType	possible output formats for dot
EdgeFilteredNumberedGraph<T>	View of a `NumberedGraph` in which some edges have been filtered out
EdgeManager<T>	An object which manages edges in a directed graph.
EmptyIntIterator	A singleton instance of an empty iterator; this is better than Collections.EMPTY_SET.iterator(), which allocates an iterator object;
EmptyIntSet
EmptyIterator<T>	A singleton instance of an empty iterator; this is better than Collections.EMPTY_SET.iterator(), which allocates an iterator object;
ExtensionGraph<T>
Factorial	Factorial utilities
Factory<T>
FifoQueue<T>	FIFO work queue management of Objects that prevents an object from being added to the queue if it is already enqueued and has not yet been popped.
FifoQueueNoDuplicates<T>	FIFO work queue management of Objects that prevents an Object from being added to the queue if it was ever previously enqueued.
FileOfClasses	An object which represents a set of classes read from a text file.
FileUtil	Simple utilities for accessing files.
FilterIterator<T>	A `FilterIterator` filters an `Iterator` to generate a new one.
Filtersection<T>	intersection of two filters
FixedPointConstants	Constants used in the fixed-point solver framework
FixedSizeBitVector
FloydWarshall<T>	Floyd-Warshall algorithm to compute all-pairs shortest path in graph with no negative cycles.
FloydWarshall.GetPath<T>
FloydWarshall.GetPaths<T>
GeneralStatement<T extends IVariable<T>>	Represents a single step in an iterative solver
GenericDominators<T>	Calculate dominators using Langauer and Tarjan's fastest algorithm.
Graph<T>	Basic interface for a directed graph.
GraphIntegrity	Utility class to check integrity of a graph data structure.
GraphIntegrity.UnsoundGraphException
GraphInverter	A graph view that reverses the edges in a graph
GraphPrint	Simple graph printing utility
GraphReachability<T,S>	A dataflow system that computes, for each graph node, the set of "interesting" nodes that are reachable
GraphSlicer	Utilities related to simple graph subset operations.
GraphUtil	Utility methods for graphs.
GXL
GXL.EntityTypes<T>
HashMapFactory	A debugging aid.
HashSetFactory	A debugging aid.
HashSetMultiMap<K,V>
Heap<T>	Simple Heap data structure.
HeapTracer	Simple utility that uses reflection to trace memory
IBinaryNaturalRelation	a relation R(x,y) where x >= 0
IFixedPointSolver<T extends IVariable<T>>	Solves a set of constraints
IFixedPointStatement<T extends IVariable<T>>	The general form of a statement definition in an iterative solver is: x >= term, where term can be any complex expression whose free variables are among the IVariables of the constraint system this `IFixedPointStatement`is part of (x represents the left-hand side of the constraint).
IFixedPointSystem<T extends IVariable<T>>	Represents a set of `IFixedPointStatement`s to be solved by a `IFixedPointSolver`
IKilldallFramework<T,V extends IVariable<V>>	A dataflow framework in the style of Kildall, POPL 73 This represents a dataflow problem induced over a graph.
ImmutableStack<T>	An immutable stack of objects.
IndiscriminateFilter<T>	A filter that accepts everything.
InferGraphRoots	TODO: Move this somewhere.
INodeWithNumber	Basic interface for a node which lives in one graph ...
INodeWithNumberedEdges	Basic interface for a node which lives in one graph ...
IntegerUnionFind	An implementation of Tarjan's union-find, using path compression and balancing, for non-negative integers
IntIterator	a more efficient iterator for sets of integers
IntMapIterator<T>	An `IntMapIterator` maps an `Iterator` contents to produce a new Iterator
IntPair	A pair of ints.
IntSet	Set of integers; not necessary mutable TODO: extract a smaller interface?
IntSetAction
IntSetUtil	Utilities for dealing with `IntSet`s
IntSetVariable<T extends IntSetVariable<T>>	A variable for dataflow analysis, representing a set of integers.
IntStack	A stack of integer primitives.
IntVector	interface for array of integer
InvertedGraph<T>	A graph view that reverses the edges in a graph
InvertedNumberedGraph<T>	A graph view that reverses the edges in a graph
InvertingEdgeManager<T>	An edge manager that reverses the edges in a graph
InvertingNumberedEdgeManager<T>	An edge manager that reverses the edges in a graph
Iterator2Collection<T>	Converts an `Iterator` to a `Collection`.
Iterator2Iterable<T>	Converts an `Iterator` to an `Iterable`.
Iterator2List<T>
Iterator2Set<T>
IteratorPlusOne<T>	A utility to efficiently compose an iterator and a singleton
IteratorPlusTwo<T>
IteratorUtil	utilities dealing with Iterators
ITransferFunctionProvider<T,V extends IVariable<V>>	The `DataflowSolver` builds system over graphs, with dataflow transfer functions on the nodes, the edges or both.
IVariable<T extends IVariable<T>>	Represents a single variable in a fixed-point iterative system.
IVector<T>	simple interface for a vector.
JavaHome
JavaLauncher	A Java process launcher
LabeledEdgeManager<T,U>	An object which tracks labeled edges in a graph.
LabeledGraph<T,U>	A graph with labeled edges.
Launcher	Abstract base class for a process launcher
LoggingStopwatch	A stop watch that prints log messages.
Logs	simple utilities with logarithms
LongIterator	a more efficient iterator for sets of longs
LongSet	Set of longs; not necessary mutable TODO: extract a smaller interface?
LongSetAction
LongSetUtil	Utilities for dealing with LongSets
LongUtil
MapIterator<X,Y>	An `MapIterator` maps an `Iterator` contents to produce a new Iterator
MapUtil	utilities for managing `Map`s
MonitorUtil	Simple utilities for Eclipse progress monitors
MonitorUtil.IProgressMonitor	Use this interface to decouple core utilities from the Eclipse layer
MultiMap<K,V>
MultiModalIntVector	an implementation of `IntVector` that uses a mix of backing arrays of type int, char, and byte array, in an attempt to save space for common data structures.
MutableIntSet	An `IntSet` that can be changed.
MutableIntSetFactory<T extends MutableIntSet>	An object that creates some flavor of mutable int set.
MutableLongSet
MutableLongSetFactory	An object that creates some flavor of mutable int set.
MutableMapping<T>	A bit set mapping based on an object array.
MutableSharedBitVectorIntSet	The shared bit vector implementation described by [Heintze 1999] TODO: much optimization possible.
MutableSharedBitVectorIntSetFactory	A factory for mutable shared bit vector int sets
MutableSparseIntSet	A sparse ordered, mutable duplicate-free, fully-encapsulated set of integers.
MutableSparseIntSetFactory	An object that creates mutable sparse int sets.
MutableSparseLongSet	A sparse ordered, mutable duplicate-free, fully-encapsulated set of longs.
MutableSparseLongSetFactory	An object that creates mutable sparse int sets.
NodeDecorator<T>
NodeManager<T>	An object which tracks graph nodes.
NodeWithNumber	A node which carries it's own number; which identifies it in a `NumberedGraph` implementation.
NodeWithNumberedEdges	Simple implementation of `INodeWithNumberedEdges`
NonNullSingletonIterator<T>	A singleton iterator for an object which is guaranteed to be not-null.
NullaryOperator<T extends IVariable<T>>	An operator of the form lhs = op
NullaryStatement<T extends IVariable<T>>	Represents a single step, restricted to a nullary operator.
NullProgressMonitor	Dummy `MonitorUtil.IProgressMonitor`
NumberedDFSDiscoverTimeIterator<T>	This class implements depth-first search over a NumberedGraph, return an enumeration of the nodes of the graph in order of increasing discover time.
NumberedDFSFinishTimeIterator<T>	This class implements depth-first search over a NumberedGraph, return an enumeration of the nodes of the graph in order of increasing discover time.
NumberedDominators<T>	Calculate dominators using Langauer and Tarjan's fastest algorithm.
NumberedEdgeManager<T>	Additional functionality for edges in numbered graphs
NumberedGraph<T>	A numbered graph is a `Graph` where each node has a unique persistent non-negative integer id.
NumberedLabeledEdgeManager<T,U>
NumberedLabeledGraph<T,I>
NumberedNodeIterator<T>
NumberedNodeManager<T>	An object which tracks nodes with numbers.
NumberUtility
ObjectArrayMapping<T>	A bit set mapping based on an immutable object array.
ObjectVisitor<T>
OffsetBitVector
OffsetOrdinalSetMapping<T>	An ordinal set mapping, backed a delegate, but adding an offset to each index.
OrderedMultiGraph<T>
OrdinalSet<T>	A Set backed by a set of integers.
OrdinalSetMapping<T>	An object that implements a bijection between whole numbers and objects.
Pair<T,U>
ParanoidHashMap<K,V>	a debugging aid.
ParanoidHashSet<T>	a debugging aid.
Path	We represent a path in a numbered graph as a vector of integers <i_1, ..., i_n> where node i_1 is the src and node i_n is the sink
PlatformUtil	Platform-specific utility functions.
Query	Misc SQL-like support for queries on tables
ReverseIterator<T>	An iterator that reverses an input iterator.
RtJar
SCCIterator<T>	This class computes strongly connected components for a Graph (or a subset of it).
SelfLoopAddedEdgeManager<T>
SelfLoopAddedGraph<T>
SemiSparseMutableIntSet
SemiSparseMutableIntSetFactory
SetOfClasses	Logically, a set of `Class`.
SimpleIntVector	simple implementation of IntVector
SimpleVector<T>	simple implementation of IVector
SlowDFSDiscoverTimeIterator<T>	This class implements depth-first search over a Graph, return an enumeration of the nodes of the graph in order of increasing discover time.
SlowDFSFinishTimeIterator<T>	This class implements depth-first search over a Graph, return an enumeration of the nodes of the graph in order of increasing finishing time.
SlowNumberedNodeManager<T>	An object which manages node numbers via a mapping.
SlowSparseNumberedGraph<T>	A graph of numbered nodes, expected to have a fairly sparse edge structure.
SlowSparseNumberedLabeledGraph<T,U>	A labeled graph implementation suitable for sparse graphs.
SmallMap<K,V>	A simple implementation of Map; intended for Maps with few elements.
SparseIntSet	A sparse ordered, duplicate-free, fully-encapsulated set of integers; not necessary mutable
SparseIntVector	an int vector implementation designed for low occupancy.
SparseLongIntVector	an int vector implementation designed for low occupancy.
SparseLongSet	A sparse ordered, duplicate-free, fully-encapsulated set of longs; not necessary mutable
SparseNumberedEdgeManager<T>	An object which tracks edges for nodes that have numbers.
SparseNumberedGraph<T extends INodeWithNumber>	A graph of numbered nodes, expected to have a fairly sparse edge structure.
SparseNumberedLabeledEdgeManager<T,U>
SparseVector<T>	An `IVector` implementation designed for low occupancy.
Stopwatch	Basic class to time events
StopwatchGC	A `Stopwatch` that also queries the free memory from the GC.
Streams	utilities for IO streams
StringTable
Table<T>
TemporaryFile
Topological	Utilities for iterating over graphs in topological order.
ToStringComparator<T>	A comparator based on lexicographical ordering of toString()
TrueOperator	Operator U(n) = true
TunedMutableSparseIntSet	A `MutableSparseIntSet` that allows for tuning of its initial size and expansion factor.
TunedSimpleIntVector	a simple implementation of int vector that can be tuned to control space usage
TwoLevelIntVector	an int vector implementation which delegates to pages of int vectors.
TwoLevelVector<T>	An `IVector` implementation which delegates to pages of int vectors.
UnaryBitVectorUnion	Operator U(n) = U(n) U U(j)
UnaryOperator<T extends IVariable<T>>	An operator of the form lhs = op (rhs)
UnaryOr	Operator U(n) = U(n) \| U(j)
UnaryStatement<T extends IVariable<T>>	Represents a single step, restricted to a unary operator.
UnimplementedError	Something that's not implemented yet.
Util	Miscellaneous utility functions.
VerboseAction	An optional interface for data structures that provide a verbose option for debugging purposes.
WalaException	An exception to raise for some WALA failure
WalaRuntimeException	Runtime exception for some WALA failure.
WelshPowell<T>
WelshPowell.ColoredVertices<T>
Worklist	Worklist for fixed-point solver implementation