A B C D E F G H I J K L M N O P R S T U V W _

A

a - Variable in class jpaul.RegExps.RegExp.Atomic
 
accept(RegExp.Visitor<A, Res>) - Method in class jpaul.RegExps.RegExp
Method for the visitor pattern.
accept(RegExp.Visitor<A, Res>) - Method in class jpaul.RegExps.RegExp.Atomic
 
accept(RegExp.Visitor<A, Res>) - Method in class jpaul.RegExps.RegExp.Concat
 
accept(RegExp.Visitor<A, Res>) - Method in class jpaul.RegExps.RegExp.EmptyStr
 
accept(RegExp.Visitor<A, Res>) - Method in class jpaul.RegExps.RegExp.None
 
accept(RegExp.Visitor<A, Res>) - Method in class jpaul.RegExps.RegExp.Star
 
accept(RegExp.Visitor<A, Res>) - Method in class jpaul.RegExps.RegExp.Union
 
acceptStates() - Method in class jpaul.RegExps.NFA
Returns the accepting states of this NFA.
action(SolAccessor<V, Info>) - Method in class jpaul.Constraints.Constraint
Performs the action attached to this constraint.
action(SolAccessor<V, Info>) - Method in class jpaul.Constraints.CtConstraint
 
action(SolAccessor<V, Info>) - Method in class jpaul.Constraints.LtConstraint
 
action(SolAccessor<SVar<T>, Set<T>>) - Method in class jpaul.Constraints.SetConstraints.FilterConstraint
 
action(SolAccessor<SVar<T>, Set<T>>) - Method in class jpaul.Constraints.SetConstraints.IntersectConstraint
 
Action<T> - Interface in jpaul.Misc
Action is a wrapper for a void returning method.
action(T) - Method in interface jpaul.Misc.Action
Perform some action on t.
action(T) - Method in class jpaul.Misc.ActionPredicate
Action: executes ActionPredicate.actionPredicate(T) only for its side-effects, ignoring its result.
ActionPredicate<T> - Class in jpaul.Misc
ActionPredicate is a combination of an Action and a Predicate.
ActionPredicate() - Constructor for class jpaul.Misc.ActionPredicate
 
actionPredicate(T) - Method in class jpaul.Misc.ActionPredicate
A boolean predicate WITH possible side-effects.
add(T) - Method in class jpaul.DataStructs.ArrayIterator
 
add(K, V) - Method in class jpaul.DataStructs.MapSetRelation
 
add(T) - Method in class jpaul.DataStructs.NonIterableSet
Adds element elem to this set.
add(K, V) - Method in class jpaul.DataStructs.Relation
Adds the pair <key, value> to the relation.
add(Ta, Tb, Tc) - Method in class jpaul.DataStructs.Relation3
Adds the triple <a,b,c> to this ternary relation.
add(Ta, Tb, Tc) - Method in class jpaul.DataStructs.Relation3MapRelImpl
 
add(E) - Method in class jpaul.DataStructs.ReverseListIterator
 
add(T) - Method in class jpaul.DataStructs.VerboseWorkSet
 
add(T) - Method in interface jpaul.DataStructs.WorkSet
Adds the element elem to this workset.
addAll(K, Collection<V>) - Method in class jpaul.DataStructs.MapSetRelation
 
addAll(Collection<T>) - Method in class jpaul.DataStructs.NonIterableSet
Adds all elements of collection coll to this set.
addAll(K, Collection<V>) - Method in class jpaul.DataStructs.Relation
Puts key in relation to each element of the collection values.
addAll(Collection<T>) - Method in class jpaul.DataStructs.VerboseWorkSet
 
addAll(Collection<T>) - Method in interface jpaul.DataStructs.WorkSet
Adds all elements from elems to this workset.
addAll2(K, Collection<? extends V>) - Method in class jpaul.DataStructs.MapSetRelation
 
addAll2(K, Collection<? extends V>) - Method in class jpaul.DataStructs.Relation
Similar to Relation.addAll(K, java.util.Collection) except that the type of the collection values allows more flexibility.
addCtSource(Collection<T>, SVar<T>) - Method in class jpaul.Constraints.SetConstraints.SetConstraints
Adds an constraint of the form "constant set ct is included in the set s".
addEquality(SVar<T>, SVar<T>) - Method in class jpaul.Constraints.SetConstraints.SetConstraints
Adds two mutual inclusion constraints to reflect the fact that the sets s1 and s2 should be equal.
addInclusion(SVar<T>, SVar<T>) - Method in class jpaul.Constraints.SetConstraints.SetConstraints
Adds an inclusion constraints between two sets.
addToOrder(T) - Method in class jpaul.DataStructs.WorkList
Overrides the abstract method WorkSetAbstr.addToOrder(T).
addToOrder(T) - Method in class jpaul.DataStructs.WorkPriorityQueue
 
addToOrder(T) - Method in class jpaul.DataStructs.WorkStack
 
allKnownElements() - Method in class jpaul.DataStructs.UnionFind
Returns an unmodifiable set containing all elements that this UnionFind structure has knowledge about.
allNonTrivialEquivalenceClasses() - Method in class jpaul.DataStructs.UnionFind
Returns an unmodifiable collection containing all equivalence classes with more than one element.
allTransTerms() - Method in class jpaul.RegExps.RegExp.Concat
Returns all transitive terms of this Concat.
allTransTerms() - Method in class jpaul.RegExps.RegExp.Union
Returns all transitive terms of this Union.
AND(Predicate<T>, Predicate<T>) - Static method in class jpaul.Misc.Predicate
Short-circuited AND operation.
ArcBasedDiGraph<Vertex> - Class in jpaul.Graphs
Digraph based on a list of arcs.
ArcBasedDiGraph(Collection<Pair<Vertex, Vertex>>) - Constructor for class jpaul.Graphs.ArcBasedDiGraph
Constructs a digraph based on a collection of arcs between vertices.
ArcBasedDiGraph(Relation<Vertex, Vertex>) - Constructor for class jpaul.Graphs.ArcBasedDiGraph
Constructs a digraph based on a set of arcs given as a successor relation.
areUnified(E, E) - Method in class jpaul.DataStructs.UnionFind
Checks whether the elements e1 and e2 are unified in this union-find structure.
ArrayIterator<T> - Class in jpaul.DataStructs
ArrayIterator is a read-only iterator over an array of elements.
ArrayIterator(T...) - Constructor for class jpaul.DataStructs.ArrayIterator
Creates a ArrayIterator.
ArraySet<T> - Class in jpaul.DataStructs
ArraySet is an immutable, array-backed set.
ArraySet(Set<T>) - Constructor for class jpaul.DataStructs.ArraySet
Creates an ArraySet containing the elements present in the set set.
ArraySet(Collection<T>) - Constructor for class jpaul.DataStructs.ArraySet
Creates an ArraySet containing the distinct elements from the colection coll.
ArraySet(T...) - Constructor for class jpaul.DataStructs.ArraySet
Creates an ArraySet with the elements given as a variable-length list of arguments (instead of a collection).
ArraySet(Collection<T>, boolean) - Constructor for class jpaul.DataStructs.ArraySet
Powerful and unsafe constructor: creates an ArraySet containing the distinct elements present in the colection coll.
AVG_COST - Static variable in class jpaul.Constraints.Constraint
Possible constraint cost; see Constraint.cost()

B

BasicBlock<Vertex> - Interface in jpaul.Graphs
BasicBlock is a straight-line sequence of vertices.
BasicBlockDiGraph<Vertex> - Class in jpaul.Graphs
A BasicBlockDiGraph is a basic block representation of a directed graph.
BasicBlockDiGraph(DiGraph<Vertex>) - Constructor for class jpaul.Graphs.BasicBlockDiGraph
Creates a BasicBlockDiGraph representation for diGraph.
BiDiNavigator<Vertex> - Interface in jpaul.Graphs
The BiDiNavigator interface allows graph algorithms to detect (and use) the arcs from and to a certain vertex.
BijMap<A,B> - Class in jpaul.DataStructs
BijMap
BijMap(MapFactory<A, B>, MapFactory<B, A>) - Constructor for class jpaul.DataStructs.BijMap
Creates a BijMap.
BijMap() - Constructor for class jpaul.DataStructs.BijMap
 
BinTreeNavigator<T> - Class in jpaul.Graphs
BinTreeNavigator models the arcs of a binary tree.
BinTreeNavigator() - Constructor for class jpaul.Graphs.BinTreeNavigator
 
BinTreeUtil - Class in jpaul.Graphs
BinTreeUtil is a wrapper for binary tree utilities.
BoolMCell - Class in jpaul.Misc
BoolMCell is a mutable cell with boolean content.
BoolMCell(boolean) - Constructor for class jpaul.Misc.BoolMCell
Creates a BoolMCell with initial value initValue.
buildConcat(List<RegExp<A>>) - Static method in class jpaul.RegExps.RegExp
Builds a regular expression equivalent to the concatenation of several (possibly more than 2) terms.
buildScc(DiGraph<Vertex>) - Static method in class jpaul.Graphs.SCComponent
Splits a directed graph into the set of its strongly-connected components.
buildUnion(Set<RegExp<A>>) - Static method in class jpaul.RegExps.RegExp
Builds a regular expression equivalent to the union of several (possibly more than 2) terms.

C

CachedFunction<TArg,TRes> - Class in jpaul.Misc
CachedFunction is a caching wrapper around a (presumably pure) function.
CachedFunction(Function<TArg, TRes>) - Constructor for class jpaul.Misc.CachedFunction
Constructs a caching wrapper around the function func.
cachedFwdNavigator(ForwardNavigator<Vertex>) - Static method in class jpaul.Graphs.GraphUtil
 
CACHING - Variable in class jpaul.Graphs.DiGraph
 
check(T) - Method in class jpaul.Misc.EqualityPredicate
 
check(T) - Method in class jpaul.Misc.Predicate
The boolean predicate.
check(T) - Method in class jpaul.Misc.SetMembership
 
CHECK_IN_OUT - Static variable in class jpaul.Constraints.ConstraintSystem
If on, the solver will check that each constraint reads/writes only variables declared in its in/out set.
checkEq(E, E) - Static method in class jpaul.DataStructs.DSUtil
Checks equality of two objects; deals with the case when obj1 is null, and next invokes equals.
clear() - Method in class jpaul.DataStructs.BijMap
 
clear() - Method in class jpaul.DataStructs.MapSetRelation
 
clear() - Method in class jpaul.DataStructs.MapWrapper
 
clear() - Method in class jpaul.DataStructs.NoCompTreeMap
 
clear() - Method in class jpaul.DataStructs.NonIterableMap
Removes all associations from this association map.
clear() - Method in class jpaul.DataStructs.NonIterableSet
Removes all elements from this set.
clear() - Method in class jpaul.DataStructs.Relation
Removes all mappings stored in this relation.
clear() - Method in class jpaul.DataStructs.Relation3
Removes all associations from this ternary relation.
clear() - Method in class jpaul.DataStructs.Relation3MapRelImpl
 
clear() - Method in class jpaul.DataStructs.VerboseWorkSet
 
clear() - Method in interface jpaul.DataStructs.WorkSet
Removes all elements from the workset.
Complexity: O(1).
clone() - Method in class jpaul.DataStructs.MapSetRelation
Creates a new, independent relation (independent = the operations on the new relation won't affect the old one).
clone() - Method in class jpaul.DataStructs.NoCompTreeMap
 
clone() - Method in class jpaul.DataStructs.Relation
 
CollectionFactory<E> - Interface in jpaul.DataStructs
CollectionFactory is a collection-specific instance of the factory pattern.
comp(Function<T2, T3>, Function<T1, T2>) - Static method in class jpaul.Misc.Function
Computes the composition of two functions.
compare(T, T) - Method in class jpaul.Misc.UComp
Compares its two arguments for order.
compareTo(SCComponent<Vertex>) - Method in class jpaul.Graphs.SCComponent
 
compareTo(BoolMCell) - Method in class jpaul.Misc.BoolMCell
 
compareTo(IntMCell) - Method in class jpaul.Misc.IntMCell
 
compareTo(LongMCell) - Method in class jpaul.Misc.LongMCell
 
Constraint<V extends Var<Info>,Info> - Class in jpaul.Constraints
Constraint models a constraint between several variables.
Constraint() - Constructor for class jpaul.Constraints.Constraint
 
ConstraintSystem<V extends Var<Info>,Info> - Class in jpaul.Constraints
ConstraintSystem is an efficient solver for a system of constraints.
ConstraintSystem(Collection<Constraint<V, Info>>) - Constructor for class jpaul.Constraints.ConstraintSystem
Creates a ConstraintSystem.
constructBiDiNavigator(RelationFactory<Vertex, Vertex>) - Method in class jpaul.Graphs.DiGraph
Construct a full navigator, starting from the forward navigator, as given by the method getForwardNavigator.
contains(Object) - Method in class jpaul.DataStructs.ArraySet
 
contains(T) - Method in class jpaul.DataStructs.NonIterableSet
Checks whether the element elem belongs to this set.
contains(K, V) - Method in class jpaul.DataStructs.Relation
Checks the existence of the relation <key,value>.
contains(Ta, Tb, Tc) - Method in class jpaul.DataStructs.Relation3
Checks the presence of the triple <a,b,c> in this ternary relation.
contains(Ta, Tb, Tc) - Method in class jpaul.DataStructs.Relation3MapRelImpl
 
contains(T) - Method in class jpaul.DataStructs.VerboseWorkSet
 
contains(T) - Method in interface jpaul.DataStructs.WorkSet
Checks whether this workset contains the element e.
Complexity: O(1).
contains(Vertex) - Method in class jpaul.Graphs.SCComponent
Checks whether node belongs to this \ strongly connected component.
containsAll(K, Collection<? extends V>) - Method in class jpaul.DataStructs.Relation
Checks the existence of the relation between key and every element from values.
containsKey(K) - Method in class jpaul.DataStructs.MapSetRelation
 
containsKey(Object) - Method in class jpaul.DataStructs.MapWrapper
 
containsKey(Object) - Method in class jpaul.DataStructs.NoCompTreeMap
 
containsKey(K) - Method in class jpaul.DataStructs.NonIterableMap
Checks whether this association map contains any association for the key key.
containsKey(K) - Method in class jpaul.DataStructs.Relation
Checks the existence of the key key in this relation.
containsValue(Object) - Method in class jpaul.DataStructs.BijMap
 
containsValue(Object) - Method in class jpaul.DataStructs.MapWrapper
 
containsValue(Object) - Method in class jpaul.DataStructs.NoCompTreeMap
Unsupported yet.
copy(Set<T>) - Method in class jpaul.Constraints.SetConstraints.SVar
Returns a set that contains the same elements as s.
copy(Info) - Method in class jpaul.Constraints.Var
Returns a clone of the information x.
cost() - Method in class jpaul.Constraints.Constraint
Returns a rough estimate of the evaluation cost of this constraint.
cost() - Method in class jpaul.Constraints.CtConstraint
 
cost() - Method in class jpaul.Constraints.LtConstraint
 
cost() - Method in class jpaul.Constraints.SetConstraints.FilterConstraint
Returns HIGH_COST.
cost() - Method in class jpaul.Constraints.SetConstraints.IntersectConstraint
Returns HIGH_COST.
cow(MapFactory<K, V>) - Static method in class jpaul.DataStructs.MapFacts
Copy-on-write maps.
cow(RelationFactory<K, V>) - Static method in class jpaul.DataStructs.RelFacts
Returns a relation factory that generates "copy-on-write" (COW) relations.
cow(SetFactory<E>) - Static method in class jpaul.DataStructs.SetFacts
Returns a set factory that generates "copy-on-write" (COW) sets.
create() - Method in interface jpaul.DataStructs.Factory
Create a new object of class T.
create(T) - Method in interface jpaul.DataStructs.Factory
Create a new object of class T, as a copy of t.
create() - Method in class jpaul.DataStructs.MapFactory
 
create(Map<K, V>) - Method in class jpaul.DataStructs.MapFactory
Default implementation: uses create() to create an empty map, and next adds each entry from m to the newly-created map.
create() - Method in class jpaul.DataStructs.MapFacts.HashMapFactory
Deprecated.  
create(Map<K, V>) - Method in class jpaul.DataStructs.MapFacts.HashMapFactory
Deprecated.  
create() - Method in class jpaul.DataStructs.MapFacts.TreeMapFactory
Deprecated.  
create(Map<K, V>) - Method in class jpaul.DataStructs.MapFacts.TreeMapFactory
Deprecated.  
create() - Method in class jpaul.DataStructs.RelationFactory
 
create(Relation<K, V>) - Method in class jpaul.DataStructs.RelationFactory
Default implementation: uses RelationFactory.create() to create an empty relation, and next add each pair from r to the new relation.
create(Set<T>) - Method in class jpaul.DataStructs.SetFactory
Default implementation: invokes SetFactory.newColl(Collection).
create() - Method in class jpaul.DataStructs.SetFacts.HashSetFactory
Deprecated.  
create() - Method in class jpaul.DataStructs.SetFacts.TreeSetFactory
Deprecated.  
create(State, Collection<State>, LabeledDiGraph.LabeledForwardNavigator<State, A>) - Static method in class jpaul.RegExps.NFA
Returns a freshly constructed NFA.
create(State, Collection<State>, LabeledDiGraph.LabeledBiDiNavigator<State, A>) - Static method in class jpaul.RegExps.NFA
Returns a freshly constructed NFA.
CREDO - Static variable in class jpaul.Version
The motivation behind the entire jpaul project.
ct - Variable in class jpaul.Constraints.CtConstraint
 
CtConstraint<V extends Var<Info>,Info> - Class in jpaul.Constraints
CtConstraint models a constraint of the form "constant ct is less than the value of the variable vd".
CtConstraint(Info, V) - Constructor for class jpaul.Constraints.CtConstraint
Creates a LtConstraint with default cost Constraint.VERY_LOW_COST.
CtConstraint(Info, V, int) - Constructor for class jpaul.Constraints.CtConstraint
Creates a CtConstraint with the meaning "the constant ct is smaller than the value of the variable vd."
CtDiffConstraint<T> - Class in jpaul.Constraints.SetConstraints
CtDiffConstraint models a "difference with a constant set" constraint.
CtDiffConstraint(SVar<T>, Collection<T>, SVar<T>) - Constructor for class jpaul.Constraints.SetConstraints.CtDiffConstraint
Creates a CtDiffConstraint with the meaning vIn \ ctSet <= vDest.

D

DEBUG - Static variable in class jpaul.Constraints.ConstraintSystem
Turns on several debugging messages and tests.
Debug - Class in jpaul.Misc
Debug contains some simple debugging methods.
debugGetVarUnification() - Method in class jpaul.Constraints.ConstraintSystem
Returns a map from each original variable to the representative of its corresponding variable equivalence class.
debugPrintSolverStructs(PrintStream) - Method in class jpaul.Constraints.ConstraintSystem
Pretty-printer of solver internals.
debugPrintSolverStructs() - Method in class jpaul.Constraints.ConstraintSystem
Pretty-printer of solver internals using the standard output (System.out).
debugUniqueVars() - Method in class jpaul.Constraints.ConstraintSystem
Returns the yet-ununified variables.
decrOrder() - Method in class jpaul.Graphs.TopSortedCompDiGraph
 
dfs(Action<Vertex>, Action<Vertex>) - Method in class jpaul.Graphs.DiGraph
DFS traversal of this digraph.
dfs2(ActionPredicate<Vertex>, Action<Vertex>) - Method in class jpaul.Graphs.DiGraph
More customizable dfs traversal than that performed by the method dfs.
DiGraph<Vertex> - Class in jpaul.Graphs
DiGraph models a directed graph.
DiGraph() - Constructor for class jpaul.Graphs.DiGraph
Constructs a DiGraph with no caching (the safest choice).
DiGraph(boolean) - Constructor for class jpaul.Graphs.DiGraph
Constructs a DiGraph.
diGraph(Collection<Vertex>, BiDiNavigator<Vertex>) - Static method in class jpaul.Graphs.DiGraph
Constructs a DiGraph object.
diGraph(Collection<Vertex>, ForwardNavigator<Vertex>) - Static method in class jpaul.Graphs.DiGraph
Constructs a DiGraph object.
disjoint(Collection<A>, Collection<B>) - Static method in class jpaul.DataStructs.DSUtil
Checks whether two collections are disjoint.
DSUtil - Class in jpaul.DataStructs
DSUtil is a wrapper for commonly used data-structure utilities.

E

elems() - Method in interface jpaul.Graphs.BasicBlock
 
enclosingBBDiGraph() - Method in interface jpaul.Graphs.BasicBlock
 
entrySet() - Method in class jpaul.DataStructs.BijMap
Returns a set view of the entries from this BijMap.
entrySet() - Method in class jpaul.DataStructs.MapWrapper
 
entrySet() - Method in class jpaul.DataStructs.NoCompTreeMap
Returns an unmodifiable set view of the map entries.
entryVertices() - Method in class jpaul.Graphs.SCComponent
Returns the entry vertices of this strongly connected component.
EqualityPredicate<T> - Class in jpaul.Misc
EqualityPredicate is a simple predicate that checks equality with a reference element.
EqualityPredicate(T) - Constructor for class jpaul.Misc.EqualityPredicate
Creates a EqualityPredicate.
equals(Object) - Method in class jpaul.Constraints.CtConstraint
 
equals(Object) - Method in class jpaul.Constraints.LtConstraint
 
equals(Object) - Method in class jpaul.Constraints.SetConstraints.CtDiffConstraint
 
equals(Object) - Method in class jpaul.Constraints.SetConstraints.IntersectConstraint
 
equals(Object) - Method in class jpaul.DataStructs.MapSetRelation
 
equals(Object) - Method in class jpaul.DataStructs.MapWrapper
 
equals(Object) - Method in class jpaul.DataStructs.NoCompTreeMap
 
equals(Object) - Method in class jpaul.DataStructs.Pair
 
equals(Object) - Method in class jpaul.DataStructs.Relation
Checks the equality of two relations
equals(Object) - Method in class jpaul.Misc.IdentityWrapper
 
equals(Object) - Method in class jpaul.Misc.UComp
Indicates whether some other object is "equal" to" this Comparator.
equals(Object) - Method in class jpaul.RegExps.RegExp.Atomic
 
equals(Object) - Method in class jpaul.RegExps.RegExp.Concat
 
equals(Object) - Method in class jpaul.RegExps.RegExp.EmptyStr
 
equals(Object) - Method in class jpaul.RegExps.RegExp.None
 
equals(Object) - Method in class jpaul.RegExps.RegExp.Star
 
equals(Object) - Method in class jpaul.RegExps.RegExp.Union
 
equivalenceClass(E) - Method in class jpaul.DataStructs.UnionFind
Returns the equivalence class that element e is part of, as an unmodifiable set containing all elements from that class (including e).
exitVertices() - Method in class jpaul.Graphs.SCComponent
Returns the exit vertices of this strongly connected component.
extract() - Method in class jpaul.DataStructs.VerboseWorkSet
 
extract() - Method in interface jpaul.DataStructs.WorkSet
Returns the first element of this workset (according to the order specific to this workset.
extractInOrder() - Method in class jpaul.DataStructs.WorkPriorityQueue
 

F

f(TArg) - Method in class jpaul.Misc.CachedFunction
 
f(TArg) - Method in class jpaul.Misc.Function
Takes a TRes and returns a TArg.
f(T) - Method in class jpaul.Misc.IdFunction
 
Factory<T> - Interface in jpaul.DataStructs
Factory for the factory pattern.
FALSE() - Static method in class jpaul.Misc.Predicate
Returns an always-false predicate.
filterColl(Iterable<E>, Predicate<E>, Collection<E>) - Static method in class jpaul.DataStructs.DSUtil
Put in newColl all elements of coll that satisfy the predicate pred.
FilterConstraint<T> - Class in jpaul.Constraints.SetConstraints
FilterConstraint models a filtering constraint.
FilterConstraint(SVar<T>, Predicate<T>, SVar<T>) - Constructor for class jpaul.Constraints.SetConstraints.FilterConstraint
Creates a FilterConstraint with the meaning vIn | pred <= vDest.
find(E) - Method in class jpaul.DataStructs.UnionFind
Returns the representative of the equivalence class of e.
findPath(Vertex, Vertex, ForwardNavigator<Vertex>) - Static method in class jpaul.Graphs.DiGraph
 
findPath(Vertex, Vertex) - Method in class jpaul.Graphs.DiGraph
 
findPath(Collection<Vertex>, Predicate<Vertex>) - Method in class jpaul.Graphs.DiGraph
 
forAllEntries(Relation.EntryVisitor<K, V>) - Method in class jpaul.DataStructs.Relation
Visits all the entries <key,value> of this relation and calls visitor.visit on each of them.
forAllVertices(Action<Vertex>) - Method in class jpaul.Graphs.DiGraph
Executes an action at most once for each vertex from this directed graph.
ForwardNavigator<Vertex> - Interface in jpaul.Graphs
ForwardNavigator is a forward-only graph navigator: given a vertex, it returns its successors in the graph.
fromAction(Action<T>, boolean) - Static method in class jpaul.Misc.ActionPredicate
Creates an ActionPredicate whose actionPredicate method first invokes the action from action and next returns the constant boolean value predicateResult.
fromPredicate(Predicate<T>) - Static method in class jpaul.Misc.ActionPredicate
Creates an ActionPredicate wrapper around a Predicate: it does not perform any side-effect, it just returns the boolean value of teh predicate.
FULL_AND(Predicate<T>, Predicate<T>) - Static method in class jpaul.Misc.Predicate
Complete AND operation.
FULL_OR(Predicate<T>, Predicate<T>) - Static method in class jpaul.Misc.Predicate
Complete OR operation.
Function<TArg,TRes> - Class in jpaul.Misc
Function is a wrapper around a function that takes a TArg and returns a TRes.
Function() - Constructor for class jpaul.Misc.Function
 

G

get(V) - Method in interface jpaul.Constraints.SolReader
 
get(Object) - Method in class jpaul.DataStructs.MapWithDefault
Returns the value to which this map maps the specified key.
get(Object) - Method in class jpaul.DataStructs.MapWrapper
 
get(Object) - Method in class jpaul.DataStructs.NoCompTreeMap
 
get(K) - Method in class jpaul.DataStructs.NonIterableMap
Returns the value associated with key in this association map, or null if no such value exists.
get(int) - Method in class jpaul.DataStructs.ReverseListView
Returns the ith element from the end of the original list.
get2ndValues(Ta) - Method in class jpaul.DataStructs.Relation3
Returns the elements that appear in the 2nd position of at least one triple that appears in this ternary relation and has a in its 1st position.
get2ndValues(Ta) - Method in class jpaul.DataStructs.Relation3MapRelImpl
 
get3rdValues(Ta, Tb) - Method in class jpaul.DataStructs.Relation3
Returns the elements that appear in the third position of at least one triple of the form <a,b,*%gt; that appears in this ternary relation.
get3rdValues(Ta, Tb) - Method in class jpaul.DataStructs.Relation3MapRelImpl
 
getBB(Vertex) - Method in class jpaul.Graphs.BasicBlockDiGraph
 
getBiDiNavigator() - Method in class jpaul.Graphs.BasicBlockDiGraph
 
getBiDiNavigator() - Method in class jpaul.Graphs.DiGraph
Returns the (bi-directional) navigator for this digraph.
getBiDiNavigator() - Method in class jpaul.Graphs.TopSortedCompDiGraph
 
getComponentDiGraph() - Method in class jpaul.Graphs.DiGraph
Returns the component graph for this graph.
getFirst(Iterable<E>) - Static method in class jpaul.DataStructs.DSUtil
 
getForwardNavigator() - Method in class jpaul.Graphs.ArcBasedDiGraph
 
getForwardNavigator() - Method in class jpaul.Graphs.DiGraph
Returns the forward navigator for this digraph.
getForwardNavigator() - Method in class jpaul.Graphs.LabeledDiGraph
Returns the forward navigator for this digraph.
getId() - Method in interface jpaul.Graphs.BasicBlock
 
getId() - Method in class jpaul.Graphs.SCComponent
Returns the numeric ID of this SCComponent.
getKeys() - Method in class jpaul.DataStructs.Relation3
Returns the elements that appear in the 1st position of at least one triple from this ternary relation.
getKeys() - Method in class jpaul.DataStructs.Relation3MapRelImpl
 
getLabeledBiDiNavigator() - Method in class jpaul.Graphs.LabeledDiGraph
Returns a bi-directional labeled navigator through LabeledDiGraph.
getLabeledForwardNavigator() - Method in class jpaul.Graphs.LabeledDiGraph
Returns a forward labeled navigator through this LabeledDiGraph.
getNavigator() - Method in class jpaul.Graphs.LabeledDiGraph
Returns the (bi-directional) navigator for this digraph.
getNoDefault(Object) - Method in class jpaul.DataStructs.MapWithDefault
Returns the value assigned to key, if any.
getRoots() - Method in class jpaul.Graphs.ArcBasedDiGraph
 
getRoots() - Method in class jpaul.Graphs.BasicBlockDiGraph
 
getRoots() - Method in class jpaul.Graphs.DiGraph
Returns the roots of this directed graph.
getRoots() - Method in class jpaul.Graphs.LabeledDiGraph
 
getRoots() - Method in class jpaul.Graphs.TopSortedCompDiGraph
 
getRoots() - Method in class jpaul.RegExps.NFA
Returns a singleton consisting of the start state, the single root of this NFA (a particular case of LabeledDiGraph).
getScc(Vertex) - Method in class jpaul.Graphs.TopSortedCompDiGraph
 
getSccBiDiNavigator() - Static method in class jpaul.Graphs.SCComponent
Default navigator through a component graph (a diGraph of strongly-connected components).
getStates() - Method in interface jpaul.RegExps.NFA.BigState
Returns the set of states that compose this big state.
getValues(K) - Method in class jpaul.DataStructs.Relation
Returns the image of key through this relation.
getVertex2SccMap() - Method in class jpaul.Graphs.TopSortedCompDiGraph
 
GraphUtil - Class in jpaul.Graphs
GraphUtil is a wrapper for various graph utilities.

H

hash() - Static method in class jpaul.DataStructs.MapFacts
Returns a map factory that generates LinkedHashMaps.
hash() - Static method in class jpaul.DataStructs.SetFacts
Returns a set factory that generates LinkedHashSets.
hashCode() - Method in class jpaul.Constraints.CtConstraint
 
hashCode() - Method in class jpaul.Constraints.LtConstraint
 
hashCode() - Method in class jpaul.Constraints.SetConstraints.CtDiffConstraint
 
hashCode() - Method in class jpaul.Constraints.SetConstraints.IntersectConstraint
 
hashCode() - Method in class jpaul.DataStructs.MapSetRelation
Complexity: linear in the number of (key,value) pairs from the relation.
hashCode() - Method in class jpaul.DataStructs.MapWrapper
 
hashCode() - Method in class jpaul.DataStructs.NoCompTreeMap
 
hashCode() - Method in class jpaul.DataStructs.Pair
 
hashCode() - Method in class jpaul.Misc.IdentityWrapper
 
hashCode() - Method in class jpaul.RegExps.RegExp
Computes the hashcode for this object.
hasNext() - Method in class jpaul.DataStructs.ArrayIterator
 
hasNext() - Method in class jpaul.DataStructs.ReverseListIterator
 
hasPrevious() - Method in class jpaul.DataStructs.ArrayIterator
 
hasPrevious() - Method in class jpaul.DataStructs.ReverseListIterator
 
HIGH_COST - Static variable in class jpaul.Constraints.Constraint
Possible constraint cost; see Constraint.cost()

I

id - Variable in class jpaul.Constraints.Var
 
IdentityWrapper<T> - Class in jpaul.Misc
IdentityWrapper is useful when you want to assign some information to each object, not to each class of equal objects.
IdentityWrapper(T) - Constructor for class jpaul.Misc.IdentityWrapper
Creates a IdentityWrapper.
IdFunction<T> - Class in jpaul.Misc
IdFunction - identity function
IdFunction() - Constructor for class jpaul.Misc.IdFunction
 
ImmutableCompoundIterable<A,B> - Class in jpaul.DataStructs
ImmutableCompoundIterable allows the construction of an IMMUTABLE Iterable by merging several smaller Iterables.
ImmutableCompoundIterable(Iterable<A>, Function<A, Iterable<B>>) - Constructor for class jpaul.DataStructs.ImmutableCompoundIterable
Creates an ImmutableCompoundIterable.
in() - Method in class jpaul.Constraints.Constraint
 
in() - Method in class jpaul.Constraints.CtConstraint
 
in() - Method in class jpaul.Constraints.LtConstraint
 
in() - Method in class jpaul.Constraints.SetConstraints.FilterConstraint
 
in() - Method in class jpaul.Constraints.SetConstraints.IntersectConstraint
 
incrOrder() - Method in class jpaul.Graphs.TopSortedCompDiGraph
 
inOrder(T, BinTreeNavigator<T>, Action<T>) - Static method in class jpaul.Graphs.BinTreeUtil
Executes an action on all nodes from a tree, in inorder.
inOrder(T2, BinTreeNavigator<T2>) - Static method in class jpaul.Graphs.BinTreeUtil
Returns an iterator that traverses all vertices of a binary tree in inorder.
InterruptTraversalException - Exception in jpaul.DataStructs
InterruptTraversalException is a special exception for prematurely terminating the traversal of a data structure.
InterruptTraversalException() - Constructor for exception jpaul.DataStructs.InterruptTraversalException
Creates a InterruptTraversalException.
InterruptTraversalException(String) - Constructor for exception jpaul.DataStructs.InterruptTraversalException
Creates a InterruptTraversalException with a certain message.
IntersectConstraint<T> - Class in jpaul.Constraints.SetConstraints
IntersectConstraint models a set intersection constraint.
IntersectConstraint(SVar<T>, SVar<T>, SVar<T>) - Constructor for class jpaul.Constraints.SetConstraints.IntersectConstraint
Creates a IntersectConstraint with the meaning vIn1 /\ vIn2 <= vDest.
IntMCell - Class in jpaul.Misc
IntMCell is a mutable cell with integer content.
IntMCell() - Constructor for class jpaul.Misc.IntMCell
Creates an IntMCell with initial content 0.
IntMCell(int) - Constructor for class jpaul.Misc.IntMCell
Creates an IntMCell with initial content initValue.
isEmpty() - Method in class jpaul.DataStructs.MapSetRelation
 
isEmpty() - Method in class jpaul.DataStructs.MapWrapper
 
isEmpty() - Method in class jpaul.DataStructs.NoCompTreeMap
 
isEmpty() - Method in class jpaul.DataStructs.NonIterableMap
Checks whether this association map is empty.
isEmpty() - Method in class jpaul.DataStructs.NonIterableSet
Checks whether this set is empty.
isEmpty() - Method in class jpaul.DataStructs.Relation
Tests if this relation is empty or not.
isEmpty() - Method in class jpaul.DataStructs.VerboseWorkSet
 
isEmpty() - Method in class jpaul.DataStructs.WorkQueue
 
isEmpty() - Method in interface jpaul.DataStructs.WorkSet
Checks whether this workset is empty.
Complexity: O(1).
isFunction() - Method in class jpaul.DataStructs.Relation
Checks whether this relation maps each key to a single value.
isLoop() - Method in class jpaul.Graphs.SCComponent
Checks whether this strongly connected component corresponds to a loop, ie it has at least one arc to itself.
iterable2coll(Iterable<E>) - Static method in class jpaul.DataStructs.DSUtil
Returns an immutable Collection view of an Iterable.
iterableContains(Iterable<E>, E) - Static method in class jpaul.DataStructs.DSUtil
Checks whether itrbl contains the element elem.
iterableSize(Iterable<E>) - Static method in class jpaul.DataStructs.DSUtil
Computes, in linear time, the length of an Iterable.
iterableSizeEq(Iterable<E>, int) - Static method in class jpaul.DataStructs.DSUtil
Checks whether the iterable itrbl has exactly k elements.
iterableSizeGt(Iterable<E>, int) - Static method in class jpaul.DataStructs.DSUtil
Checks whether the iterable itrbl has more than k elements.
iterableToString(Iterable<E>) - Static method in class jpaul.DataStructs.DSUtil
 
iterator() - Method in class jpaul.DataStructs.ArraySet
 
iterator() - Method in class jpaul.DataStructs.ImmutableCompoundIterable
 
iterator() - Method in class jpaul.DataStructs.ReverseListView
 
iterator() - Method in class jpaul.DataStructs.WorkQueue
 

J

join(Set<T>, Set<T>) - Method in class jpaul.Constraints.SetConstraints.SVar
Adds all the elements from s2 to s1.
join(V, Info) - Method in interface jpaul.Constraints.SolAccessor
Change the value attached to the variable v by joining delta to it.
join(Info, Info) - Method in class jpaul.Constraints.Var
Joins two values from the domain this variable takes values from.
jpaul - package jpaul
Contains only the release information.
jpaul.Constraints - package jpaul.Constraints
Generic solver for inequality constraints over lattices.
jpaul.Constraints.SetConstraints - package jpaul.Constraints.SetConstraints
Test of the generic constraint solver: set constraint solver.
jpaul.DataStructs - package jpaul.DataStructs
Data structures for program analysis and not only.
jpaul.Graphs - package jpaul.Graphs
Graph-related classes and algorithms.
jpaul.Misc - package jpaul.Misc
Miscellaneous useful classes.
jpaul.RegExps - package jpaul.RegExps
Classes that model regular expressions and NFAs.

K

keys() - Method in class jpaul.DataStructs.MapSetRelation
 
keys() - Method in class jpaul.DataStructs.Relation
Returns an IMMUTABLE view of all the keys appearing in this relation.
keySet() - Method in class jpaul.DataStructs.BijMap
 
keySet() - Method in class jpaul.DataStructs.MapWrapper
 
keySet() - Method in class jpaul.DataStructs.NoCompTreeMap
Returns an unmodifiable set view of the keys contained in this map.

L

LabeledDiGraph<Vertex,Label> - Class in jpaul.Graphs
LabeledDiGraph models a labeled directed graph.
LabeledDiGraph() - Constructor for class jpaul.Graphs.LabeledDiGraph
Creates a LabeledDiGraph.
LabeledDiGraph(boolean) - Constructor for class jpaul.Graphs.LabeledDiGraph
Creates a LabeledDiGraph.
LabeledDiGraph.LabeledBiDiNavigator<Vertex,Label> - Class in jpaul.Graphs
Bidirectional iterator into a labeled graph.
LabeledDiGraph.LabeledBiDiNavigator() - Constructor for class jpaul.Graphs.LabeledDiGraph.LabeledBiDiNavigator
 
LabeledDiGraph.LabeledForwardNavigator<Vertex,Label> - Class in jpaul.Graphs
Forward iterator into a labeled graph.
LabeledDiGraph.LabeledForwardNavigator() - Constructor for class jpaul.Graphs.LabeledDiGraph.LabeledForwardNavigator
 
left - Variable in class jpaul.DataStructs.Pair
 
left(T) - Method in class jpaul.Graphs.BinTreeNavigator
Returns the left son of node, if any, or null otherwise.
left - Variable in class jpaul.RegExps.RegExp.Concat
 
left - Variable in class jpaul.RegExps.RegExp.Union
 
leftProj() - Static method in class jpaul.DataStructs.Pair
 
listIterator() - Method in class jpaul.DataStructs.ReverseListView
 
lnext(Vertex) - Method in class jpaul.Graphs.LabeledDiGraph.LabeledForwardNavigator
Returns the list of the arcs that exit vertex v.
LONG_NAME - Static variable in class jpaul.Version
The long name of the jpaul project.
LongMCell - Class in jpaul.Misc
LongMCell is a mutable cell with long content.
LongMCell() - Constructor for class jpaul.Misc.LongMCell
Creates a LongMCell.
LongMCell(long) - Constructor for class jpaul.Misc.LongMCell
Creates a LongMCell with initial content initValue.
LOW_COST - Static variable in class jpaul.Constraints.Constraint
Possible constraint cost; see Constraint.cost()
lprev(Vertex) - Method in class jpaul.Graphs.LabeledDiGraph.LabeledBiDiNavigator
Returns the list of the arcs that enter into the vertex v.
LtConstraint<V extends Var<Info>,Info> - Class in jpaul.Constraints
LtConstraint models a "less than" constraint: the value of variable vs is smaller than the value of variable vd, according to the order relation from the corresponding lattice.
LtConstraint(V, V) - Constructor for class jpaul.Constraints.LtConstraint
Creates a LtConstraint with default cost Constraint.LOW_COST.
LtConstraint(V, V, int) - Constructor for class jpaul.Constraints.LtConstraint
Creates an LtConstraint with the meaning "value of variable vs is smaller than the value of the variable vd."

M

main(String[]) - Static method in class jpaul.Version
Prints a small informative message about the current release.
MAINTAINER - Static variable in class jpaul.Version
The person in charge of this jpaul release.
map - Variable in class jpaul.DataStructs.MapWrapper
Underlying map.
map2fun(Map<K, V>) - Static method in class jpaul.DataStructs.DSUtil
Construct a Function based on a map.
mapBased(MapFactory<E, Object>) - Static method in class jpaul.DataStructs.SetFacts
Returns a set factory that generates map-backed sets.
mapColl(Iterable<E1>, Function<E1, E2>, Collection<E2>) - Static method in class jpaul.DataStructs.DSUtil
Maps collection coll into a new collection (stored in newColl), according to the function func.
mapColl(Iterable<E1>, Map<E1, E2>, Collection<E2>) - Static method in class jpaul.DataStructs.DSUtil
Similar to teh other mapColl method, but the function is given as a map.
mapColl2(Iterable<E1>, Function<E1, E2>, Collection<E2>) - Static method in class jpaul.DataStructs.DSUtil
Similar to mapColl, but filters out all null elements produced by func.
MapFactory<K,V> - Class in jpaul.DataStructs
MapFactory is a map-specific instance of the factory pattern.
MapFactory() - Constructor for class jpaul.DataStructs.MapFactory
 
MapFacts - Class in jpaul.DataStructs
MapFacts contains several common map factories.
MapFacts() - Constructor for class jpaul.DataStructs.MapFacts
 
MapFacts.HashMapFactory<K,V> - Class in jpaul.DataStructs
Deprecated. As of jpaul 2.2, use MapFacts.hash() instead.
MapFacts.HashMapFactory() - Constructor for class jpaul.DataStructs.MapFacts.HashMapFactory
Deprecated.  
MapFacts.TreeMapFactory<K,V> - Class in jpaul.DataStructs
Deprecated. As of jpaul 2.2, use MapFacts.tree(Comparator) instead.
MapFacts.TreeMapFactory(Comparator<K>) - Constructor for class jpaul.DataStructs.MapFacts.TreeMapFactory
Deprecated. Creates a TreeMapFactory.
mapIterable(Iterable<A>, Function<A, B>) - Static method in class jpaul.DataStructs.DSUtil
 
mapIterator(Iterator<A>, Function<A, B>) - Static method in class jpaul.DataStructs.DSUtil
 
mapList(List<A>, Function<A, B>) - Static method in class jpaul.DataStructs.DSUtil
 
mapSet() - Static method in class jpaul.DataStructs.RelFacts
Returns a relation factory that generates Relations interface backed by a LinkedHashMap from keys to LinkedHashSets of values.
mapSet(MapFactory<K, Set<V>>, SetFactory<V>) - Static method in class jpaul.DataStructs.RelFacts
Returns a relation factory that generates Relations interface backed by a Map from keys to Sets of values.
MapSetRelation<K,V> - Class in jpaul.DataStructs
MapSetRelation is an implementation of the Relation interface based on a Map from keys to Sets of values.
MapSetRelation() - Constructor for class jpaul.DataStructs.MapSetRelation
Constructs a Relation represented using a LinkedHashMap from keys to LinkedHashSets of values.
MapSetRelation(MapFactory<K, Set<V>>, SetFactory<V>) - Constructor for class jpaul.DataStructs.MapSetRelation
Constructs a Relation represented by a Map from keys to Sets of values.
MapWithDefault<K,V> - Class in jpaul.DataStructs
MapWithDefault is a map that returns default values for unassigned keys.
MapWithDefault(Factory<V>, boolean) - Constructor for class jpaul.DataStructs.MapWithDefault
Creates a MapWithDefault, backed by a LinkedHashMap.
MapWithDefault(Map<K, V>, Factory<V>, boolean) - Constructor for class jpaul.DataStructs.MapWithDefault
Creates a MapWithDefault.
MapWrapper<K,V> - Class in jpaul.DataStructs
MapWrapper is a map backed by another map.
MapWrapper(Map<K, V>) - Constructor for class jpaul.DataStructs.MapWrapper
Creates a MapWrapper.
MCell<T> - Class in jpaul.Misc
MCell is a mutable cell with content of type T.
MCell(T) - Constructor for class jpaul.Misc.MCell
Creates a MutableCell.

N

newColl() - Method in interface jpaul.DataStructs.CollectionFactory
Creates an empty collection.
newColl(Collection<E>) - Method in interface jpaul.DataStructs.CollectionFactory
Creates a collection that contains all elements from c.
newColl() - Method in class jpaul.DataStructs.SetFactory
Default implementation: invokes Factory.create().
newColl(Collection<T>) - Method in class jpaul.DataStructs.SetFactory
Default implementation: uses create() to create an empty set, and next adds all elements from coll to the newly-created set.
newColl(Collection<E>) - Method in class jpaul.DataStructs.SetFacts.HashSetFactory
Deprecated.  
newColl(Collection<E>) - Method in class jpaul.DataStructs.SetFacts.TreeSetFactory
Deprecated.  
next() - Method in class jpaul.DataStructs.ArrayIterator
 
next() - Method in class jpaul.DataStructs.ReverseListIterator
 
next() - Method in interface jpaul.Graphs.BasicBlock
 
next(T) - Method in class jpaul.Graphs.BinTreeNavigator
Returns all (0, 1 or 2) sons of a node.
next(Vertex) - Method in interface jpaul.Graphs.ForwardNavigator
Returns the successors of vertex.
next(Vertex) - Method in class jpaul.Graphs.LabeledDiGraph.LabeledForwardNavigator
 
next() - Method in class jpaul.Graphs.SCComponent
Returns the SCCs that this SCC points to in the component digraph.
nextIndex() - Method in class jpaul.DataStructs.ArrayIterator
 
nextIndex() - Method in class jpaul.DataStructs.ReverseListIterator
 
NFA<State,A> - Class in jpaul.RegExps
NFA models a Non-deterministic Finite Automaton.
NFA() - Constructor for class jpaul.RegExps.NFA
Constructs a NFA.
NFA.BigState<State> - Interface in jpaul.RegExps
Certain NFA transformations (ex: NFA.simplify()) produce NFAs whose states are sets of original states.
noCompTree() - Static method in class jpaul.DataStructs.MapFacts
Returns a map factory that generates NoCompTreeMap.
noCompTree() - Static method in class jpaul.DataStructs.SetFacts
Returns a set factory that generates sets backed by NoCompTreeMaps.
NoCompTreeMap<K,V> - Class in jpaul.DataStructs
NoCompTreeMap is tree map that does not require any used-defined Comparator.
NoCompTreeMap() - Constructor for class jpaul.DataStructs.NoCompTreeMap
Creates a NoCompTreeMap.
NoCompTreeMap(Map<? extends K, ? extends V>) - Constructor for class jpaul.DataStructs.NoCompTreeMap
Creates a NoCompTreeMap with the same mappings as the given map.
NonIterableMap<K,V> - Class in jpaul.DataStructs
NonIterableMap is a very simple association map that CANNOT be traversed.
NonIterableMap() - Constructor for class jpaul.DataStructs.NonIterableMap
Creates a NonIterableMap backed by a private HashMap with the default initial capacity.
NonIterableMap(int) - Constructor for class jpaul.DataStructs.NonIterableMap
Creates a NonIterableMap backed by a private HashMap of a certain initial capacity.
NonIterableSet<T> - Class in jpaul.DataStructs
NonIterableSet is a very simple set that CANNOT be traversed.
NonIterableSet() - Constructor for class jpaul.DataStructs.NonIterableSet
Creates a NonIterableSet backed by a private HashSet with the default initial capacity.
NonIterableSet(int) - Constructor for class jpaul.DataStructs.NonIterableSet
Creates a NonIterableSet backed by a private HashSet of a certain initial capacity.
NOT(Predicate<T>) - Static method in class jpaul.Misc.Predicate
Predicate negation.
numArcs() - Method in class jpaul.Graphs.DiGraph
Returns the number of arcs in this directed graph.
numVertices() - Method in class jpaul.Graphs.DiGraph
Returns the number of vertices in this directed graph.

O

obj - Variable in class jpaul.Misc.IdentityWrapper
 
offer(T) - Method in class jpaul.DataStructs.WorkQueue
 
OR(Predicate<T>, Predicate<T>) - Static method in class jpaul.Misc.Predicate
Short-circuited OR operation.
out() - Method in class jpaul.Constraints.Constraint
 
out() - Method in class jpaul.Constraints.CtConstraint
 
out() - Method in class jpaul.Constraints.LtConstraint
 
out() - Method in class jpaul.Constraints.SetConstraints.FilterConstraint
 
out() - Method in class jpaul.Constraints.SetConstraints.IntersectConstraint
 

P

Pair<A,B> - Class in jpaul.DataStructs
Pair is an immutable pair of two values.
Pair(A, B) - Constructor for class jpaul.DataStructs.Pair
 
peek() - Method in class jpaul.DataStructs.WorkQueue
 
poll() - Method in class jpaul.DataStructs.WorkQueue
 
postOrder(T, BinTreeNavigator<T>, Action<T>) - Static method in class jpaul.Graphs.BinTreeUtil
Executes an action on all nodes from a tree, in postorder.
postOrder(T2, BinTreeNavigator<T2>) - Static method in class jpaul.Graphs.BinTreeUtil
Returns an iterator that traverses all vertices of a binary tree in postorder.
pred - Variable in class jpaul.Constraints.SetConstraints.FilterConstraint
 
Predicate<T> - Class in jpaul.Misc
Predicate wraps a boolean predicate.
Predicate() - Constructor for class jpaul.Misc.Predicate
 
preOrder(T, BinTreeNavigator<T>, Action<T>) - Static method in class jpaul.Graphs.BinTreeUtil
Executes an action on all nodes from a tree, in preorder.
preOrder(T2, BinTreeNavigator<T2>) - Static method in class jpaul.Graphs.BinTreeUtil
Returns an iterator that traverses all vertices of a binary tree in preorder.
prev() - Method in interface jpaul.Graphs.BasicBlock
 
prev(Vertex) - Method in interface jpaul.Graphs.BiDiNavigator
Returns the predecessors of vertex.
prev(Vertex) - Method in class jpaul.Graphs.LabeledDiGraph.LabeledBiDiNavigator
 
prev() - Method in class jpaul.Graphs.SCComponent
Returns the SCCs that point to this SCC in the component digraph.
previous() - Method in class jpaul.DataStructs.ArrayIterator
 
previous() - Method in class jpaul.DataStructs.ReverseListIterator
 
previousIndex() - Method in class jpaul.DataStructs.ArrayIterator
 
previousIndex() - Method in class jpaul.DataStructs.ReverseListIterator
 
put(A, B) - Method in class jpaul.DataStructs.BijMap
 
put(K, V) - Method in class jpaul.DataStructs.MapWrapper
 
put(K, V) - Method in class jpaul.DataStructs.NoCompTreeMap
Associates the specified value with the specified key in this map.
put(K, V) - Method in class jpaul.DataStructs.NonIterableMap
Associates the key key with the value value in this association map.
putAll(Map<? extends A, ? extends B>) - Method in class jpaul.DataStructs.BijMap
 
putAll(Map<? extends K, ? extends V>) - Method in class jpaul.DataStructs.MapWrapper
 
putAll(Map<? extends K, ? extends V>) - Method in class jpaul.DataStructs.NoCompTreeMap
Copies all of the mappings from the specified map to this map.

R

RegExp<A> - Class in jpaul.RegExps
RegExp models a regular expression.
RegExp() - Constructor for class jpaul.RegExps.RegExp
 
RegExp.Atomic<A> - Class in jpaul.RegExps
Regular expression that matches only the 1-length string consisting of exactly one specific symbol.
RegExp.Atomic(A) - Constructor for class jpaul.RegExps.RegExp.Atomic
Creates an Atomic regular expression that matches only the 1-length string consisting of the symbol a.
RegExp.Concat<A> - Class in jpaul.RegExps
Regular expression produced by concatenating two regular expressions.
RegExp.Concat(RegExp<A>, RegExp<A>) - Constructor for class jpaul.RegExps.RegExp.Concat
Creates a Concat regular expression that matches any string of As consisting of a string matched by left followed by a string matched by right.
RegExp.EmptyStr<A> - Class in jpaul.RegExps
Regular expressions that matches only the empty string.
RegExp.EmptyStr() - Constructor for class jpaul.RegExps.RegExp.EmptyStr
 
RegExp.None<A> - Class in jpaul.RegExps
Regular expression that does not match any string.
RegExp.None() - Constructor for class jpaul.RegExps.RegExp.None
 
RegExp.Star<A> - Class in jpaul.RegExps
The star regular expression.
RegExp.Star(RegExp<A>) - Constructor for class jpaul.RegExps.RegExp.Star
Creates a RegExp that matches any string that is obtained by the concatenation of a finite number of strings (possibly none), each matched by the regular expression regExp.
RegExp.Union<A> - Class in jpaul.RegExps
The regular expression that matches any string matched by at least one of two specific regular expression.
RegExp.Union(RegExp<A>, RegExp<A>) - Constructor for class jpaul.RegExps.RegExp.Union
Creates a Union regular expression that matches any string that is matched by (at least one of) left and right.
RegExp.Visitor<A,Res> - Class in jpaul.RegExps
Instance of the visitor pattern for RegExps.
RegExp.Visitor() - Constructor for class jpaul.RegExps.RegExp.Visitor
 
Relation<K,V> - Class in jpaul.DataStructs
Relation is a binary relation, accepting one to many and many to one mappings.
Relation() - Constructor for class jpaul.DataStructs.Relation
 
Relation.EntryVisitor<Key,Value> - Interface in jpaul.DataStructs
Relation.EntryVisitor is a wrapper for a function that is called on a relation entry of the form <key,value>.
Relation3<Ta,Tb,Tc> - Class in jpaul.DataStructs
Relation3 models a simple ternary relation.
Relation3() - Constructor for class jpaul.DataStructs.Relation3
 
Relation3MapRelImpl<Ta,Tb,Tc> - Class in jpaul.DataStructs
Relation3MapRelImpl is a simple implementation of Relation3, backed by a Map from Ta keys to RelationTb,Tc between Tb and Tc.
Relation3MapRelImpl(MapFactory<Ta, Relation<Tb, Tc>>, RelationFactory<Tb, Tc>) - Constructor for class jpaul.DataStructs.Relation3MapRelImpl
Creates a Relation3MapRelImpl.
Relation3MapRelImpl() - Constructor for class jpaul.DataStructs.Relation3MapRelImpl
Creates a Relation3MapRelImpl object using a factory of LinkedHashMaps and a factory of MapSetRelations.
RelationFactory<K,V> - Class in jpaul.DataStructs
RelationFactory is a relation-specific instance of the factory pattern.
RelationFactory() - Constructor for class jpaul.DataStructs.RelationFactory
 
RELEASE - Static variable in class jpaul.Version
The release number of the jpaul library.
RelFacts - Class in jpaul.DataStructs
RelFacts contains common relation factories.
RelFacts() - Constructor for class jpaul.DataStructs.RelFacts
 
RelFacts.COWRelationFactory<K,V> - Class in jpaul.DataStructs
Deprecated. As of jpaul 2.2, use RelFacts.cow(RelationFactory) instead.
RelFacts.COWRelationFactory(RelationFactory<K, V>) - Constructor for class jpaul.DataStructs.RelFacts.COWRelationFactory
Deprecated. Creates a COWRelationFactory.
RelFacts.MapSetRelationFactory<K,V> - Class in jpaul.DataStructs
Deprecated. As of jpaul 2.2, use RelFacts.mapSet() or RelFacts.mapSet(MapFactory,SetFactory) instead.
RelFacts.MapSetRelationFactory() - Constructor for class jpaul.DataStructs.RelFacts.MapSetRelationFactory
Deprecated. Default constructor: creates a MapSetRelationFactory that generates relations whose representation uses LinkedHashMaps and LinkedHashSets.
RelFacts.MapSetRelationFactory(MapFactory<K, Set<V>>, SetFactory<V>) - Constructor for class jpaul.DataStructs.RelFacts.MapSetRelationFactory
Deprecated. Creates a MapSetRelationFactory that generates relations whose representation uses maps generated by mapFact and sets generated by setFact.
remove() - Method in class jpaul.DataStructs.ArrayIterator
 
remove(Object) - Method in class jpaul.DataStructs.BijMap
 
remove(K, V) - Method in class jpaul.DataStructs.MapSetRelation
 
remove(Object) - Method in class jpaul.DataStructs.MapWrapper
 
remove(Object) - Method in class jpaul.DataStructs.NoCompTreeMap
Removes the mapping previously attached to key.
remove(K) - Method in class jpaul.DataStructs.NonIterableMap
Remove any association for the key key.
remove(T) - Method in class jpaul.DataStructs.NonIterableSet
Removes the element elem from this set.
remove(K, V) - Method in class jpaul.DataStructs.Relation
Removes the relation between key and value.
remove(Ta, Tb, Tc) - Method in class jpaul.DataStructs.Relation3
Removes the triple <a,b,c> from this ternary relation.
remove(Ta, Tb, Tc) - Method in class jpaul.DataStructs.Relation3MapRelImpl
 
remove() - Method in class jpaul.DataStructs.ReverseListIterator
 
removeAll(K, Collection<V>) - Method in class jpaul.DataStructs.MapSetRelation
 
removeAll(K, Collection<V>) - Method in class jpaul.DataStructs.Relation
Removes the relation between key and any element from values.
removeKey(K) - Method in class jpaul.DataStructs.MapSetRelation
 
removeKey(K) - Method in class jpaul.DataStructs.Relation
Removes all the relations attached to key.
removeKeys(Predicate<K>) - Method in class jpaul.DataStructs.MapSetRelation
 
removeKeys(Predicate<K>) - Method in class jpaul.DataStructs.Relation
Removes all the keys that satisfy predicate.check().
removeValues(Predicate<V>) - Method in class jpaul.DataStructs.MapSetRelation
 
removeValues(Predicate<V>) - Method in class jpaul.DataStructs.Relation
Removes all the values that satisfy predicate.check().
rev() - Method in class jpaul.DataStructs.BijMap
Returns a reverse view of this BijMap.
reverseBiDiNavigator(BiDiNavigator<Vertex>) - Static method in class jpaul.Graphs.GraphUtil
Returns the reverse of a given navigator.
reverseDiGraph() - Method in class jpaul.Graphs.DiGraph
Returns a reverse form of this directed graph: a directed graph with the same set of vertices, that contains an arc from v1 to v2 iff this graph contains an arc from v2 to v1.
ReverseListIterator<E> - Class in jpaul.DataStructs
ReverseListIterator takes a List and produces a ListIterator that traverses the list in reverse order.
ReverseListIterator(List<E>) - Constructor for class jpaul.DataStructs.ReverseListIterator
Creates a ReverseListIterator.
ReverseListView<E> - Class in jpaul.DataStructs
ReverseViewList is an immutable, reverse view of a List.
ReverseListView(List<E>) - Constructor for class jpaul.DataStructs.ReverseListView
Creates a reverse view of origList.
revert() - Method in class jpaul.DataStructs.Relation
Return a relation that is the reverse of this relation.
revert(Relation<V, K>) - Method in class jpaul.DataStructs.Relation
Revert this relation and store the result into the relation result.
rewrite(UnionFind<V>) - Method in class jpaul.Constraints.Constraint
Rewrites this constraint by replacing each variable with the representative of its equivalence class.
rewrite(UnionFind<V>) - Method in class jpaul.Constraints.CtConstraint
 
rewrite(UnionFind<V>) - Method in class jpaul.Constraints.LtConstraint
 
rewrite(UnionFind<SVar<T>>) - Method in class jpaul.Constraints.SetConstraints.CtDiffConstraint
We implemented CtDiffConstraint.rewrite(jpaul.DataStructs.UnionFind>), CtDiffConstraint.equals(java.lang.Object), and CtDiffConstraint.hashCode, such that constraints that are identical after variable unification are not duplicated needlessly.
rewrite(UnionFind<SVar<T>>) - Method in class jpaul.Constraints.SetConstraints.IntersectConstraint
We implemented IntersectConstraint.rewrite(jpaul.DataStructs.UnionFind>), IntersectConstraint.equals(java.lang.Object), and IntersectConstraint.hashCode, such that constraints that are identical after variable unification are not duplicated needlessly.
right - Variable in class jpaul.DataStructs.Pair
 
right(T) - Method in class jpaul.Graphs.BinTreeNavigator
Returns the right son of node, if any, or null otherwise.
right - Variable in class jpaul.RegExps.RegExp.Concat
 
right - Variable in class jpaul.RegExps.RegExp.Union
 
rightProj() - Static method in class jpaul.DataStructs.Pair
 

S

SCComponent<Vertex> - Class in jpaul.Graphs
SCComponent models a strongly-connected component of a directed graph: a set of vertices such that there is a path between any two of them.
select(List<E>, List<Integer>, List<E>) - Static method in class jpaul.DataStructs.DSUtil
 
set(T) - Method in class jpaul.DataStructs.ArrayIterator
 
set(E) - Method in class jpaul.DataStructs.ReverseListIterator
 
SetConstraints<T> - Class in jpaul.Constraints.SetConstraints
SetConstraints is a collection of set constraints.
SetConstraints() - Constructor for class jpaul.Constraints.SetConstraints.SetConstraints
 
SetFactory<T> - Class in jpaul.DataStructs
SetFactory is a set-instance of the factory pattern.
SetFactory() - Constructor for class jpaul.DataStructs.SetFactory
 
SetFacts - Class in jpaul.DataStructs
SetFacts contains common set factories.
SetFacts.COWSetFactory<E> - Class in jpaul.DataStructs
Deprecated. As of jpaul 2.2, use SetFacts.cow(SetFactory) instead.
SetFacts.COWSetFactory(SetFactory<E>) - Constructor for class jpaul.DataStructs.SetFacts.COWSetFactory
Deprecated. Creates a COWSetFactory.
SetFacts.HashSetFactory<E> - Class in jpaul.DataStructs
Deprecated. As of jpaul 2.2, use SetFacts.hash() instead.
SetFacts.HashSetFactory() - Constructor for class jpaul.DataStructs.SetFacts.HashSetFactory
Deprecated.  
SetFacts.TreeSetFactory<E> - Class in jpaul.DataStructs
Deprecated. As of jpaul 2.2, use SetFacts.tree(Comparator) instead.
SetFacts.TreeSetFactory(Comparator<E>) - Constructor for class jpaul.DataStructs.SetFacts.TreeSetFactory
Deprecated. Creates a TreeSetFactory.
SetMembership<T> - Class in jpaul.Misc
SetMembership is a predicate that checks whether an element is member of a specific set.
SetMembership(Collection<T>) - Constructor for class jpaul.Misc.SetMembership
Creates a SetMembership that checks membership in the set set.
simplify() - Method in class jpaul.RegExps.NFA
Returns a simplified NFA that accepts the same strings as this NFA.
simplify() - Method in class jpaul.RegExps.RegExp
Returns a simplified, equivalent version of this regular expression.
size() - Method in class jpaul.DataStructs.ArraySet
 
size() - Method in class jpaul.DataStructs.BijMap
 
size() - Method in class jpaul.DataStructs.MapWrapper
 
size() - Method in class jpaul.DataStructs.NoCompTreeMap
 
size() - Method in class jpaul.DataStructs.Relation
Returns the number of <key,value> pairs in this relation.
size() - Method in class jpaul.DataStructs.Relation3
Returns the number of <a,b,c> triples in this ternary relation.
size() - Method in class jpaul.DataStructs.ReverseListView
Returns the size of the original list.
size() - Method in class jpaul.DataStructs.VerboseWorkSet
 
size() - Method in class jpaul.DataStructs.WorkQueue
 
size() - Method in interface jpaul.DataStructs.WorkSet
Returns the size of this workset.
Invariant: isEmpty() iff size() == 0.
Complexity: O(1).
size() - Method in class jpaul.Graphs.SCComponent
Returns the number of vertices in this strongly connected component.
SolAccessor<V extends Var<Info>,Info> - Interface in jpaul.Constraints
SolAccessor provides access to the values of the variables from a system of constraints.
SolReader<V extends Var<Info>,Info> - Interface in jpaul.Constraints
SolReader provides read-only access to the (possibly partial) solution of a system of constraints.
solve() - Method in class jpaul.Constraints.ConstraintSystem
Solves this system of constraints.
sortedCollection(Collection<T>) - Static method in class jpaul.Misc.Debug
Returns a list containing all the objects from a collection, in increasing lexicographic order of their string representations.
starred - Variable in class jpaul.RegExps.RegExp.Star
 
startState() - Method in class jpaul.RegExps.NFA
Returns the starting state of this NFA.
states() - Method in class jpaul.RegExps.NFA
Returns all states from this NFA.
stringImg(Collection<T>) - Static method in class jpaul.Misc.Debug
Returns a string representation of all elements from a collection, in increasing lexicographic order of their string representations.
stringImg(T[]) - Static method in class jpaul.Misc.Debug
Returns a string representation of all elements from an array, in increasing lexicographic order of their string representations.
subDiGraph(Collection<Vertex>) - Method in class jpaul.Graphs.DiGraph
Returns a subgraph of this directed graph containing only the vertices from verts.
SVar<T> - Class in jpaul.Constraints.SetConstraints
SVar is a variable whose values are sets of Ts.
SVar(SetFactory<T>) - Constructor for class jpaul.Constraints.SetConstraints.SVar
Creates an SVar.
SVar() - Constructor for class jpaul.Constraints.SetConstraints.SVar
Creates an SVar using a HashSet factory (SetFacts.hash)
synchronizedRelation(Relation<K, V>) - Static method in class jpaul.DataStructs.Relation
Returns a synchronized (thread-safe) relation wrapper backed by the given relation rel.

T

TopSortedCompDiGraph<Vertex> - Class in jpaul.Graphs
TopSortedCompDiGraph is a topologically-sorted component digraph.
TopSortedCompDiGraph(DiGraph<Vertex>) - Constructor for class jpaul.Graphs.TopSortedCompDiGraph
Constructs the topologically sorted component digraph of digraph.
toRegExp() - Method in class jpaul.RegExps.NFA
Returns a regular expression over the alphabet A, representing all strings accepted by this NFA.
toString() - Method in class jpaul.Constraints.CtConstraint
 
toString() - Method in class jpaul.Constraints.LtConstraint
 
toString() - Method in class jpaul.Constraints.SetConstraints.CtDiffConstraint
 
toString() - Method in class jpaul.Constraints.SetConstraints.FilterConstraint
 
toString() - Method in class jpaul.Constraints.SetConstraints.IntersectConstraint
 
toString() - Method in class jpaul.Constraints.SetConstraints.SVar
 
toString() - Method in class jpaul.Constraints.Var
String representation of this variable.
toString(Object) - Static method in class jpaul.DataStructs.DSUtil
Returns "null" if the argument o is null, and o.toString() otherwise.
toString() - Method in class jpaul.DataStructs.ImmutableCompoundIterable
 
toString() - Method in class jpaul.DataStructs.NoCompTreeMap
 
toString() - Method in class jpaul.DataStructs.Pair
 
toString() - Method in class jpaul.DataStructs.Relation
Pretty-print function for debug.
toString() - Method in class jpaul.DataStructs.Relation3
 
toString() - Method in class jpaul.DataStructs.UnionFind
Returns a human-readable representation of the UnionFind.
toString() - Method in class jpaul.DataStructs.VerboseWorkSet
 
toString() - Method in class jpaul.Graphs.DiGraph
Returns a string representation of this DiGraph.
toString() - Method in class jpaul.Graphs.LabeledDiGraph
 
toString() - Method in class jpaul.Graphs.SCComponent
Pretty-print method for debugging.
toString() - Method in class jpaul.Misc.BoolMCell
Returns a string description containing both the value and the address of this BoolMCell: "BoolMCell{" + value + "}@" + System.identityHashCode(this).
toString() - Method in class jpaul.Misc.IdentityWrapper
 
toString() - Method in class jpaul.Misc.IntMCell
Returns a string description containing both the value and the address of this IntMCell: "IntMCell{" + value + "}@" + System.identityHashCode(this).
toString() - Method in class jpaul.Misc.LongMCell
Returns a string description containing both the value and the address of this LongMCell: "LongMCell{" + value + "}@" + System.identityHashCode(this).
toString() - Method in class jpaul.Misc.MCell
Returns a string description containing both the value and the address of this MCell: "MCell{" + value + "}@" + System.identityHashCode(this).
toString() - Method in class jpaul.RegExps.NFA
Returns a pretty rough text representation for debugging pruposes.
toString() - Method in class jpaul.RegExps.RegExp.Atomic
 
toString() - Method in class jpaul.RegExps.RegExp.Concat
 
toString() - Method in class jpaul.RegExps.RegExp.EmptyStr
 
toString() - Method in class jpaul.RegExps.RegExp.None
 
toString() - Method in class jpaul.RegExps.RegExp.Star
 
toString() - Method in class jpaul.RegExps.RegExp.Union
 
transitivePred(Vertex) - Method in class jpaul.Graphs.DiGraph
 
transitivePred(Collection<Vertex>) - Method in class jpaul.Graphs.DiGraph
 
transitivePredWithFrontier(Collection<Vertex>, Predicate<Vertex>, boolean) - Method in class jpaul.Graphs.DiGraph
 
transitiveSucc(Vertex) - Method in class jpaul.Graphs.DiGraph
 
transitiveSucc(Collection<Vertex>) - Method in class jpaul.Graphs.DiGraph
 
transitiveSuccWithFrontier(Collection<Vertex>, Predicate<Vertex>, boolean) - Method in class jpaul.Graphs.DiGraph
 
tree(Comparator<K>) - Static method in class jpaul.DataStructs.MapFacts
Returns a map factory that generates TreeMaps.
tree(Comparator<E>) - Static method in class jpaul.DataStructs.SetFacts
Returns a set factory that generates TreeSets.
TRUE() - Static method in class jpaul.Misc.Predicate
Returns an always-true predicate.

U

UComp<T> - Class in jpaul.Misc
UComp is an universal comparator, which compares any two objecs by simply comparing their string representation.
UComp() - Constructor for class jpaul.Misc.UComp
 
underlyingOrder() - Method in class jpaul.DataStructs.WorkPriorityQueue
 
union(Relation<K, V>) - Method in class jpaul.DataStructs.MapSetRelation
 
union(Relation<K, V>) - Method in class jpaul.DataStructs.Relation
Combines this relation with relation rel.
union(E, E) - Method in class jpaul.DataStructs.UnionFind
Unifies the elements e1 and e2 and returns the representative of the resulting equivalence class.
union(DiGraph<V>, DiGraph<V>) - Static method in class jpaul.Graphs.DiGraph
Computes the union of two directed graphs.
unionColl(Collection<E>, Collection<E>) - Static method in class jpaul.DataStructs.DSUtil
Returns the immutable union of two collections.
unionColl(Collection<E>, Collection<E>, Collection<E>) - Static method in class jpaul.DataStructs.DSUtil
Returns the immutable union of three collections.
UnionFind<E> - Class in jpaul.DataStructs
UnionFind is a datastructure for performing unification and lookup operations.
UnionFind() - Constructor for class jpaul.DataStructs.UnionFind
Creates a UnionFind.
unionFwdNav(ForwardNavigator<V>, ForwardNavigator<V>) - Static method in class jpaul.Graphs.GraphUtil
Unions two ForwardNavigator.
unionIterable(Iterable<E>, Iterable<E>) - Static method in class jpaul.DataStructs.DSUtil
Returns an immutable Iterable that is the union of two Iterables.
unionIterable(Iterable<Iterable<E>>) - Static method in class jpaul.DataStructs.DSUtil
Returns an immutable Iterable that is the union of several Iterables (in the order thet are given in its).
unionList(List<E>, List<E>) - Static method in class jpaul.DataStructs.DSUtil
Returns an immutable List that is the union of two lists: it contains first the elements from l1, and next the elements from l2.
unionNav(BiDiNavigator<V>, BiDiNavigator<V>) - Static method in class jpaul.Graphs.GraphUtil
Unions two BiDiNavigator.
unmodifiableIterable(Iterable<E>) - Static method in class jpaul.DataStructs.DSUtil
Transforms a normal Iterable into an unmodifiable one.
unmodifiableIterator(Iterator<E>) - Static method in class jpaul.DataStructs.DSUtil
Transforms a normal Iterator into an unmodifiable one.
unmodifiableRelation(Relation<K, V>) - Static method in class jpaul.DataStructs.Relation
Returns an unmodifiable wrapper backed by the given relation rel.
unUnified(E) - Method in class jpaul.DataStructs.UnionFind
Returns true if the element e has not been unified yet with any DIFFERENT element.

V

value - Variable in class jpaul.Misc.BoolMCell
The current boolean content of this cell.
value - Variable in class jpaul.Misc.IntMCell
The current int content of this cell.
value - Variable in class jpaul.Misc.LongMCell
The current long content of this cell.
value - Variable in class jpaul.Misc.MCell
The current content of this cell.
values() - Method in class jpaul.DataStructs.BijMap
Returns a collection view of the values from this BijMap.
values() - Method in class jpaul.DataStructs.MapSetRelation
 
values() - Method in class jpaul.DataStructs.MapWrapper
 
values() - Method in class jpaul.DataStructs.NoCompTreeMap
Returns an unmodifiable collection view of the values from this map.
values() - Method in class jpaul.DataStructs.Relation
Returns an IMMUTABLE view of all the values appearing in this relation.
Var<Info> - Class in jpaul.Constraints
Var models a variable from a system of constraints.
Var() - Constructor for class jpaul.Constraints.Var
 
vars() - Method in class jpaul.Constraints.ConstraintSystem
Returns the set of all variables from this constraint system.
vd - Variable in class jpaul.Constraints.CtConstraint
 
vd - Variable in class jpaul.Constraints.LtConstraint
 
vDest - Variable in class jpaul.Constraints.SetConstraints.FilterConstraint
 
VerboseWorkSet<T> - Class in jpaul.DataStructs
VerboseWorkSet - Debugging wrapper for a WorkSet.
VerboseWorkSet(WorkSet<T>, String) - Constructor for class jpaul.DataStructs.VerboseWorkSet
Creates a VerboseWorkSet.
Version - Class in jpaul
Version contains fields naming the current jpaul version.
Version() - Constructor for class jpaul.Version
 
vertices() - Method in class jpaul.Graphs.DiGraph
Returns the set of all vertices from this digraph: vertices that are (trasitively and reflexively) reachable from the root vertices by following the forward arcs provided by the navigator.
vertices() - Method in class jpaul.Graphs.SCComponent
Returns the vertices of this strongly connected component.
VERY_LOW_COST - Static variable in class jpaul.Constraints.Constraint
Possible constraint cost; see Constraint.cost()
vIn - Variable in class jpaul.Constraints.SetConstraints.FilterConstraint
 
visit(Key, Value) - Method in interface jpaul.DataStructs.Relation.EntryVisitor
Visits a <key,value> entry of a relation.
visit(RegExp.None<A>) - Method in class jpaul.RegExps.RegExp.Visitor
Subclasses should override this method to define special processing for a None regular expression.
visit(RegExp.Atomic<A>) - Method in class jpaul.RegExps.RegExp.Visitor
Subclasses should override this method to define special processing for an Atomic regular expression.
visit(RegExp.EmptyStr<A>) - Method in class jpaul.RegExps.RegExp.Visitor
Subclasses should override this method to define special processing for an EmptyStr regular expression.
visit(RegExp.Union<A>) - Method in class jpaul.RegExps.RegExp.Visitor
Subclasses should override this method to define special processing for a Union regular expression.
visit(RegExp.Concat<A>) - Method in class jpaul.RegExps.RegExp.Visitor
Subclasses should override this method to define special processing for a Concat regular expression.
visit(RegExp.Star<A>) - Method in class jpaul.RegExps.RegExp.Visitor
Subclasses should override this method to define special processing for a Star regular expression.
visit(RegExp<A>) - Method in class jpaul.RegExps.RegExp.Visitor
Default code to execute for a regular expression.
vs - Variable in class jpaul.Constraints.LtConstraint
 

W

WEBSITE - Static variable in class jpaul.Version
The project website (with Javadoc, info, etc.)
WorkList<T> - Class in jpaul.DataStructs
WorkList is a WorkSet with FIFO order.
WorkList() - Constructor for class jpaul.DataStructs.WorkList
 
WorkPriorityQueue<T> - Class in jpaul.DataStructs
WorkPriorityQueue is a WorkSet whose elements are extracted in the increasing order of their priorities.
WorkPriorityQueue(Comparator<T>) - Constructor for class jpaul.DataStructs.WorkPriorityQueue
Creates a WorkPriorityQueue.
WorkQueue<T> - Class in jpaul.DataStructs
WorkQueue
WorkQueue() - Constructor for class jpaul.DataStructs.WorkQueue
 
WorkQueue(int) - Constructor for class jpaul.DataStructs.WorkQueue
Creates a WorkQueue.
WorkSet<T> - Interface in jpaul.DataStructs
WorkSet is an ordered set-like data structure.
WorkStack<T> - Class in jpaul.DataStructs
WorkStack is a WorkSet with LIFO order.
WorkStack() - Constructor for class jpaul.DataStructs.WorkStack
 

_

_acceptStates() - Method in class jpaul.RegExps.NFA
Needs to be implemented by subclasses to return the accepting states.
_getValues(K) - Method in class jpaul.DataStructs.MapSetRelation
 
_getValues(K) - Method in class jpaul.DataStructs.Relation
Method used by the internal implementation of the Relation or its subclasses.
_hashCode() - Method in class jpaul.RegExps.RegExp
Does the real work behing hashCode.
_hashCode() - Method in class jpaul.RegExps.RegExp.Atomic
 
_hashCode() - Method in class jpaul.RegExps.RegExp.Concat
 
_hashCode() - Method in class jpaul.RegExps.RegExp.EmptyStr
 
_hashCode() - Method in class jpaul.RegExps.RegExp.None
 
_hashCode() - Method in class jpaul.RegExps.RegExp.Star
 
_hashCode() - Method in class jpaul.RegExps.RegExp.Union
 

A B C D E F G H I J K L M N O P R S T U V W _

Copyright 2005 Alexandru Salcianu - salcianu@alum.mit.edu