suzanne.soy/tock-mirror
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fixed a few comments in FlowAlgorithms

Browse Source
This commit is contained in:
Neil Brown 2008-02-26 14:24:33 +00:00
parent 9ba8d30aa0
commit b4ee07a3a7
1 changed files with 1 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
common/FlowAlgorithms.hs
View File

@ -28,13 +28,10 @@ data GraphFuncs n e a = GF {
nodeFunc :: (n,e) -> a -> Maybe a -> a
,prevNodes :: n -> [(n,e)]
,nextNodes :: n -> [(n,e)]
-- defVal should be the unit of the aggregation. That is, if (nodeFunc a b) == defVal, then (nodeFunc a b defVal) == defVal too
-- TODO not sure if the above is still true
-- defVal is the default starting value for all the nodes (except the entry node)
,defVal :: a
}
-- TODO further in the future, consider making this work nicely with the inductive graph rather than using node lists
-- | Given the graph functions, a list of nodes and an entry node, performs
-- an iterative data-flow analysis. All the nodes in the list should be connected to
-- the entry node, and there should be no nodes without predecessors in the list.