On 24 February 2014 22:17, Tobias Florek
hi,
But to be honest, I don't have strong feelings about this, I'm willing to drop this particular function (length) from the proposal, if there is no consensus.
then what about the arguably better name `size`?
Huh, I thought we already had that. Some things I missed when I last used Data.Tree: * An Ord instance (achievable via standalone deriving, though this isn't ideal) * A function to take the mirror-image of a tree (name not that important): mirror :: Tree a -> Tree a mirror (Node a ts) = Node a . reverse $ map mirror ts * Functions to take/drop so many levels of the tree (take is relatively easy; drop would result in a Forest).
cheers, tobias florek
_______________________________________________ Libraries mailing list Libraries@haskell.org http://www.haskell.org/mailman/listinfo/libraries
-- Ivan Lazar Miljenovic Ivan.Miljenovic@gmail.com http://IvanMiljenovic.wordpress.com