17 May
2016
17 May
'16
5:18 p.m.
Hi, Am Dienstag, den 17.05.2016, 17:03 -0400 schrieb David Feuer:
Daniel Wagner would like to add the following straightforward function to Data.Tree. I think this is a grand idea.
foldTree :: (a -> [b] -> b) -> Tree a -> b foldTree f = go where go (Node x ts) = f x (map go ts)
LGTM Joachim -- Joachim “nomeata” Breitner mail@joachim-breitner.de • https://www.joachim-breitner.de/ XMPP: nomeata@joachim-breitner.de • OpenPGP-Key: 0xF0FBF51F Debian Developer: nomeata@debian.org