Re^2: Eliminating Recursive Tree Walking by using MJD-style Infinite Streams?

I'm sure your code is much faster than mine, but speed really isn't an issue here, its the memory used by generating all these paths...

Comment on Re^2: Eliminating Recursive Tree Walking by using MJD-style Infinite Streams?

Replies are listed 'Best First'.
Re^3: Eliminating Recursive Tree Walking by using MJD-style Infinite Streams? by dragonchild (Archbishop) on Jun 17, 2008 at 00:46 UTC
My code is also a stateful iterator that is very conscious of RAM usage. This is why I pointed it to you. The name Tree::Fast is more that it's the leanest implementation of a tree in Perl that I could find. My criteria for good software: Does it work? Can someone else come in, make a change, and be reasonably certain no bugs were introduced?	[reply]