At 06:10 PM 8/8/00 -0400, Uri Guttman wrote:
>wacko idea:
>
>combine a generic data tree traverse engine with damian's switch op.
>
>you pass this new smart traverse a ref and it will scan the tree. at
>every node it sees, it can call callbacks or methods. it can do the
>callbacks in pre, in or post ordering to get useful effects. if a node
>is an object, the optional method can be called (e.g. CLONE).
>
>each node could also be handled by a switch on its type.
>
>so this traverse engine could be shared by GC, clone, Data::Dumper,
>Storable, etc.
I like it.
Can you tell me what semantics you use with something like this to get
behavior like clone's, where the reult of a node depends on the results of
other nodes? Whether they've been visited already or not, how do you
parcel all the results of, say, a ref-to-array together?
--
Peter Scott
Pacific Systems Design Technologies
