Hi, Am Montag, den 09.02.2009, 16:41 -0700 schrieb Luke Palmer: > 2009/2/9 Joachim Breitner <[email protected]> > Now while this works, and while ST is still somewhat pure, I'm > wondering > if there is no better way of expressing "This piece of > information came > from the point in a data structure, so something else can be > put here > easily". > > You might want to look into zippers: > http://haskell.org/haskellwiki/Zipper
I thought about Zippers, but I understand that they improve _navigating_ in a Tree-like structure, or to refrence _one_ position in a tree. But if I would deconstruct my tree to the list of _all_ locations, with > type Loc a = (Tree a, Cxt a) and then run my algorithm that returns [(Loc a, Info)], it’s still not clear to me how I can combine all of these locations to get back my original Tree, annotated with the Info returned. Thanks nevertheless, Joachim -- Joachim "nomeata" Breitner mail: [email protected] | ICQ# 74513189 | GPG-Key: 4743206C JID: [email protected] | http://www.joachim-breitner.de/ Debian Developer: [email protected]
signature.asc
Description: Dies ist ein digital signierter Nachrichtenteil
_______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
