You can handle cyclic blocks, that is, blocks with contain themselves at some point. You just maintain a list of visited blocks. If you run into one that has already been visited (in the list already) then don't process it (that would lead to infinite loop). If not already visited, add it to the list and the process it.
All the containers could be supported this way; blocks, lists, objects, parens. Anyway, for reduce/deep I suppose you would just do blocks... Anton. > Maarten wrote: > > I think I can do this by recursively traversing a block and its > subblocks > and reducing them on the mezzanine level. Anybody interested and having > feature requests for this? > > I'm assuming that this would work on tree structured blocks, not > blocks that > are are recursively 'insert-ed into each other? > > Andrew J Martin -- To unsubscribe from this list, just send an email to [EMAIL PROTECTED] with unsubscribe as the subject.
