Exactly like that, thank you! :-)
PS: It's really elegant, I don't think I would have gotten it so cool (and now I see the 'proper' stack unwinding returning values... silly me... Thanks for the great leson!)
--
our $Perl6 is Fantastic;
In reply to Re^2: trees and depth-first search
by Excalibor
in thread trees and depth-first search
by Excalibor
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |