edu.neu.ccs.demeter.aplib
Interface SimpleStrategyI

All Superinterfaces:

StrategyI

All Known Implementing Classes:

StrategyGraph

public interface SimpleStrategyI

extends StrategyI

An encapsulated strategy consisting of a strategy graph S, sets of source and target nodes s and t (subsets of nodes in S), a name relation N from nodes in S to symbolic names (strings), and a constraint map B from edges in S to predicates over symbolic elements.

Method Summary

ConstraintMapI	getConstraintMap() The constraint map B.
Collection	getNames(Object v) The set N(v), a collection of symbolic names (strings) corresponding to node v in the strategy graph S.
Collection	getSources() The source set s, a collection of nodes in the strategy graph S.
StrategyGraphI	getStrategyGraph() The strategy graph S.
Collection	getTargets() The target set t, a collection of nodes in the strategy graph S.

Methods inherited from interface edu.neu.ccs.demeter.aplib.StrategyI

isSimpleStrategy, isStrategyCombination, toSimpleStrategy, toStrategyCombination

Method Detail

getStrategyGraph

public StrategyGraphI getStrategyGraph()

The strategy graph S.

getSources

public Collection getSources()

The source set s, a collection of nodes in the strategy graph S.

getTargets

public Collection getTargets()

The target set t, a collection of nodes in the strategy graph S.

getNames

public Collection getNames(Object v)

The set N(v), a collection of symbolic names (strings) corresponding to node v in the strategy graph S. Return null if v is a wildcard node, intended to map to all class graph nodes.

getConstraintMap

public ConstraintMapI getConstraintMap()

The constraint map B. Return null for B_true, in which all predicates return true.