Added a couple of notes about replicators

checks/UsageCheckAlgorithms.hs

@@ -39,6 +39,8 @@ joinCheckParFunctions f g x = seqPair (f x, g x)
 checkPar :: forall m a b. Monad m => ((Meta, ParItems a) -> m b) -> FlowGraph m a -> [m b]
 checkPar f g = map f allParItems
   where
+    -- TODO deal with replicators
+  
     allStartParEdges :: Map.Map Int [(Node,Node)]
     allStartParEdges = foldl (\mp (s,e,n) -> Map.insertWith (++) n [(s,e)] mp) Map.empty $ mapMaybe tagStartParEdge $ labEdges g
   

common/FlowGraph.hs

@@ -287,6 +287,7 @@ buildFlowGraph funcs s
            addEdge ESeq n s
            addEdge ESeq e n'
            return (n,n')
+    -- TODO replicator
     buildStructured _ s _ = do n <- addDummyNode (findMeta s)
                                return (n,n)