zipper for rose trees? (Data.Tree)
Hi folks, Is there a common zipper implementation for the "Tree a" datatype, defined in Data.Tree? The wiki gives examples for binary trees and B-trees, but not for these. Thanks, Graham
Hi Graham, There is one implementation here: http://code.haskell.org/yi/Data/Tree/ I wrote it for Yi but it is quite general. It is a pity that we don't have it in the standard libraries. It is not completely tested but it seems to work for me. Regards, Krasimir 2008/4/23 Graham Fawcett <graham.fawcett@gmail.com>:
Hi folks,
Is there a common zipper implementation for the "Tree a" datatype, defined in Data.Tree? The wiki gives examples for binary trees and B-trees, but not for these.
Thanks, Graham
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
On Wed, Apr 23, 2008 at 4:40 PM, Krasimir Angelov <kr.angelov@gmail.com> wrote:
Hi Graham,
There is one implementation here:
http://code.haskell.org/yi/Data/Tree/
I wrote it for Yi but it is quite general. It is a pity that we don't have it in the standard libraries. It is not completely tested but it seems to work for me.
Thank very much, Krasimir! I agree, it would be a good addition to the standard library. I've added a link to your implementation from the Zipper page in the Haskell wiki. Regards, Graham
participants (2)
-
Graham Fawcett -
Krasimir Angelov