Rich Morin wrote:
I think that one of the things that Perl6 will bring is continuations. This will enable you to treat a tree traversal in the same way as any other list.is not something I want to try in XSLT. I can do it in Perl, of course, but I end up writing a lot of code. Am I missing something? And, to bring the posting back on topic, will Perl6 bring anything new to the campfire?
For example:
for $tree.depth_first_traversal("process") -> $node
{
...
}
There would be no need to obscure the client-code with the details of hierarchical navigation. (Question: can I use C<yield> inside a recursive implementation of the iterator?)
Dave.