[renaming danglingFuns to annexCandidates, change return type of simplifiedBindings
martin.hofmann@uni-bamberg.de**20091014090212] hunk ./src/Data/CallDependencies.hs 6
-        admissible, allowedMaxCall, cycles, danglingFuns
+        admissible, allowedMaxCall, cycles, loops, annexCandidates
hunk ./src/Data/CallDependencies.hs 154
-danglingFuns :: CallDep -> [Name]
-danglingFuns cd  = 
+{- | Computes all nodes in the call graph which may be annectable w.r.t. the 
+     call graph, i.e. functions which do not call any other function or only 
+     one other function. All functions/nodes with indegree of 0, i.e., those 
+     which are not called by any other (the target functions) are removed.
+-}
+annexCandidates :: CallDep -> [Name]
+annexCandidates cd  = 
hunk ./src/Data/Hypotheses.hs 102
-simplifiedBindings :: Hypo -> [(Name,Rules)]
-simplifiedBindings h = sbnds [] (callings h) (allBindings h)
+simplifiedBindings :: Hypo -> (CallDep, [(Name,Rules)])
+simplifiedBindings h =  (sbnds [])(callings h)(allBindings h)
hunk ./src/Data/Hypotheses.hs 106
-    sbnds blckl cd bnds = 
-        case (danglingFuns $ cd) \\ blckl of
+    sbnds blckl cd bnds =  
+        case (annexCandidates $ cd) \\ blckl of
hunk ./src/Data/Hypotheses.hs 110
-            []      -> bnds
+            []      -> (cd,bnds)
hunk ./src/SynthesisEngine.hs 59
-    simplify b = map $ concatMap $ if b then simplifiedBindings else allBindings
+    simplify b = map $ concatMap $ if b then snd . simplifiedBindings else allBindings