Interface PartiallyBalancedTabulationProblem<T,P,F>

Type Parameters:

T - type of node in the supergraph

P - type of a procedure (like a box in an RSM)

F - type of factoids propagated when solving this problem

All Superinterfaces:

TabulationProblem<T,P,F>

All Known Implementing Classes:

Slicer.SliceProblem

public interface PartiallyBalancedTabulationProblem<T,P,F>
extends TabulationProblem<T,P,F>

A TabulationProblem with additional support for computing with partially balanced parentheses.

Method Summary

Modifier and Type	Method	Description
T	getFakeEntry(T n)	If n is reached by a partially balanced parenthesis, what is the entry node we should use as the root of the PathEdge to n? Note that the result must in fact be an entry node of the procedure containing n.
IPartiallyBalancedFlowFunctions<T>	getFunctionMap()

Methods inherited from interface TabulationProblem

getDomain, getMergeFunction, getSupergraph, initialSeeds

Modifier and Type	Method	Description
TabulationDomain<F,T>	getDomain()
IMergeFunction	getMergeFunction()	Special case: if supportsMerge(), then the problem is not really IFDS anymore.
ISupergraph<T,P>	getSupergraph()
Collection<PathEdge<T>>	initialSeeds()	Define the set of path edges to start propagation with.

Method Details

getFunctionMap

IPartiallyBalancedFlowFunctions<T> getFunctionMap()

Specified by:

getFunctionMap in interface TabulationProblem<T,P,F>

getFakeEntry

T getFakeEntry(T n)

If n is reached by a partially balanced parenthesis, what is the entry node we should use as the root of the PathEdge to n? Note that the result must in fact be an entry node of the procedure containing n.