





Synopsis 




Imperative control structure




for' :: Monad m => a > (a > Bool) > (a > a) > b > (a > b > m b) > m b  Source 


Usefull list functions


map_ :: (a > b) > [a] > [b]  Source 

a pseudostrict map version. does not touch the elements but reconstructs the whole list
structure before the function is applied to the value


foldr_ :: (a > b > b) > b > [a] > b  Source 

a pseudostrict foldr version. does not touch the elements but reconstructs the whole list
structure before the function is applied to the values.


merge :: (a > a > a) > [a] > [a] > [a]  Source 

Similar to zipWith, but the result has the length of the longer input list.


mergeSet :: ([a] > b) > [[a]] > [b]  Source 




walk :: ([a] > [b]) > [a] > ([a], [b])  Source 


appendmaps :: [[a] > [b]] > [a] > [b]  Source 


appendmaps' :: [[a] > [b]] > [a] > [[b]]  Source 






More usefull functions


head_opt :: a > [a] > a  Source 



the given function must create a filepath using the Intargument. The filepath must be
different for different arguments. newFilePath works like Gdels muoperator and terminates
only if the filepath does not exist.


Embedding IO in a list (map)






















Produced by Haddock version 2.4.2 