T
- type of node in the supergraphP
- type of a procedure (like a box in an RSM)F
- type of factoids propagated when solving this problempublic interface PartiallyBalancedTabulationProblem<T,P,F> extends TabulationProblem<T,P,F>
TabulationProblem
with additional support for computing with partially balanced parentheses.Modifier and Type | Method and 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() |
getDomain, getMergeFunction, getSupergraph, initialSeeds
IPartiallyBalancedFlowFunctions<T> getFunctionMap()
getFunctionMap
in interface TabulationProblem<T,P,F>