Re: Pear::Tree - Questions and feature requests

Simon H wrote:

Sorry about the delay in getting back to you but I have been trying out these methods. The memory method you suggest is cool, but the only problem I have found is that it creates a huge array, where [parent] and [children] create full arrays of the tree also. Is it possible to remove the [parent] bit and only have [children] display its children and their children etc, building a simple nested tree from the top down only, instead of walking up and down through the whole tree for each child node? Maybe I'm still missing something?

Actually there are no copies. All the elements in there are only references, so the array is really only as big as the sum of all elements! does that answer it all? -- Wolfram http://opensource.visionp.de ... authentication system .... http://sf.net/projects/auth