From b4ee07a3a705ca01e4895815699c0ad217a98aa4 Mon Sep 17 00:00:00 2001 From: Neil Brown Date: Tue, 26 Feb 2008 14:24:33 +0000 Subject: [PATCH] Fixed a few comments in FlowAlgorithms --- common/FlowAlgorithms.hs | 5 +---- 1 file changed, 1 insertion(+), 4 deletions(-) diff --git a/common/FlowAlgorithms.hs b/common/FlowAlgorithms.hs index f43da52..e12e5fe 100644 --- a/common/FlowAlgorithms.hs +++ b/common/FlowAlgorithms.hs @@ -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.