I don't see why it wouldn't be. At worst, you would need to do a breadth-first search through the whole datastructure (which, in the general case, is likely to be a graph rather than a tree). Of course, this may be terribly slow, but surely it's implementable.
--
print "Just Another Perl Adept\n";
In reply to Re^3: [Perl 6] Any provision for a "dereferencing object"?
by vrk
in thread [Perl 6] Any provision for a "dereferencing object"?
by blazar
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |