[examples
martin.hofmann@uni-bamberg.de**20091201103416] hunk ./expl/Examples.hs 4
+data NTree a = NilT | Branch a (NTree a)(NTree a) -- deriving (Show)
hunk ./expl/Examples.hs 41
--- add Z x = x
--- add x Z = x
+add Z x = x
+add x Z = x
hunk ./expl/Examples.hs 44
-add Z (S Z) = (S Z)
+-- add Z (S Z) = (S Z)
hunk ./expl/Examples.hs 49
--- add (S (S Z)) (S Z) = S (S (S Z))
+add (S (S Z)) (S Z) = S (S (S Z))
hunk ./expl/Examples.hs 268
-insert x [] = [x]	
+insert x [] = [x]        
hunk ./expl/Examples.hs 276
-insert (S(S Z)) [S Z] = [S Z, S(S Z)]	
+insert (S(S Z)) [S Z] = [S Z, S(S Z)]        
hunk ./expl/Examples.hs 357
+mem 3 [] = False
hunk ./expl/Examples.hs 359
-mem 1 [2] = False
hunk ./expl/Examples.hs 360
+mem 3 [1] = False
+mem 1 [2] = False
hunk ./expl/Examples.hs 363
---member 1 [1,2] = [1,2]
+mem 3 [2] = False
+mem 1 [3] = False
+mem 2 [3] = False
+mem 3 [3] = True
+
hunk ./expl/Examples.hs 369
---member 2 [1,2] = [2]
hunk ./expl/Examples.hs 409
+mirror :: (NTree a) -> (NTree a)
+mirror NilT = NilT
+mirror (Branch a NilT NilT) = (Branch a NilT NilT)
+mirror (Branch b
+        (Branch a NilT NilT)
+        (Branch c NilT NilT)) = (Branch b 
+                                 (Branch c NilT NilT) 
+                                 (Branch a NilT NilT))
+mirror (Branch d
+        (Branch b 
+         (Branch a NilT NilT)
+         (Branch c NilT NilT))
+        (Branch f 
+         (Branch e NilT NilT)
+         (Branch g NilT NilT))) = (Branch d
+                                   (Branch f 
+                                    (Branch g NilT NilT)
+                                    (Branch e NilT NilT))
+                                   (Branch b 
+                                    (Branch c NilT NilT)
+                                    (Branch a NilT NilT)))
hunk ./expl/Examples.hs 431
-
+flatten :: (NTree a) -> [a]
+flatten NilT = []
+flatten (Branch a NilT NilT) = [a]
+flatten (Branch a
+        (Branch b NilT NilT)
+        (Branch c NilT NilT)) = [a,b,c]
+flatten (Branch a
+        (Branch b 
+         (Branch c NilT NilT)
+         (Branch d NilT NilT))
+        (Branch e 
+         (Branch f NilT NilT)
+         (Branch g NilT NilT))) = [a,b,c,d,e,f,g]
+         
+flatapp :: [a] -> [a] -> [a]
+flatapp [] [] = []
+flatapp [a] [b] = [a,b]
+flatapp [a,b,c][d,e,f] = [a,b,c,d,e,f]
+       
hunk ./expl/Examples.hs 522
---sort [S(S Z)]   = [S(S Z)]	
+sort [S(S Z)]   = [S(S Z)]        
+
hunk ./expl/Examples.hs 525
---sort [Z,S(S Z)]     = [Z,S(S Z)]
+sort [Z,S(S Z)]     = [Z,S(S Z)]
hunk ./expl/Examples.hs 527
---sort [S Z,S(S Z)]   = [S Z,S(S Z)]
---sort [S(S Z), Z]    = [Z,S(S Z)]
---sort [S(S Z),S Z]   = [S Z,S(S Z)]	
+sort [S Z,S(S Z)]   = [S Z,S(S Z)]
+sort [S(S Z), Z]    = [Z,S(S Z)]
+sort [S(S Z),S Z]   = [S Z,S(S Z)]        
hunk ./expl/Examples.hs 537
+sortIns :: Peano -> [Peano] -> [Peano]
+sortIns      Z        [] = [Z]
+sortIns   (S Z)       [] = [S Z]
+sortIns (S(S Z))      [] = [S(S Z)]
+sortIns   (S Z)      [Z] = [Z,S Z]
+sortIns (S(S Z))     [Z] = [Z,S(S Z)]
+sortIns      Z     [S Z] = [Z,S Z]
+sortIns (S(S Z))   [S Z] = [S Z,S(S Z)]
+sortIns      Z  [S(S Z)] = [Z,S(S Z)]
+sortIns   (S Z) [S(S Z)] = [S Z,S(S Z)]
+sortIns      Z    [S Z,S(S Z)] = [Z,S Z,S(S Z)]
+sortIns   (S Z)     [Z,S(S Z)] = [Z,S Z,S(S Z)]
+sortIns (S(S Z))       [Z,S Z] = [Z,S Z,S(S Z)]
+