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

Corrected a comment in FlowAlgorithms

Browse Source
This commit is contained in:
Neil Brown 2008-01-29 12:44:06 +00:00
parent 48384746d0
commit 0a1270f109
1 changed files with 2 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
common/FlowAlgorithms.hs
View File

@ -37,7 +37,8 @@ data GraphFuncs n e a = GF {
-- 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.
-- 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.
flowAlgorithm :: forall n e a. (Ord n, Show n, Eq a) => GraphFuncs n e a -> [n] -> n -> Either String (Map.Map n a)
flowAlgorithm funcs nodes startNode
= iterate