1 files changed, 4 insertions, 0 deletions

diff --git a/AufgabeFFP6.hs b/AufgabeFFP6.hs
index 1fde756..c60053d 100644
--- a/AufgabeFFP6.hs
+++ b/AufgabeFFP6.hs
@@ -91,22 +91,26 @@ yield_bt f w = map (\(_, _, _, g) -> listArray (1, length g) g) nodes
 yield_gtf :: F -> W -> [G]
 yield_gtf = filt . transform . generate
 
+-- produce [G] by using get_combinations
 generate :: F -> W -> (F, W, [G])
 generate f w =  (f, w, [ array (1,n) entries | entries <- get_combinations n ] )
         where 
         n = (snd $ bounds f) - 1
 
+-- provide all selections of length n, work recursively and attach index for level (convenient for creating arrays)
 get_combinations :: Int -> [[(Int, Op)]]
 get_combinations 1 = [[(1,(+))], [(1, (-))], [(1, (*))], [(1,(./.))]]
 get_combinations n = [ (up i) ++ entr  | entr <- get_combinations (n-1), i <- get_combinations 1 ]
         where 
         up = map (\(num, x) -> ((num+n-1), x))
 
+-- attaches a list of results 
 transform ::  (W -> (F,W,[G])) -> W -> ((F, W, [G]), [W])
 transform fun w = ((f, w, g), map (eval f) g )
         where 
         (f, w, g) = fun w
 
+-- take those, where the entry in the result list corresponds to 
 filt :: (W -> ((F,W,[G]),[W]) ) -> W -> [G]
 filt fun w = [ g!!i | i <- [0..n], res!!i == w ]
         where