Re: Data structure question: Directory-in-memory ?

[stephen]

You could do the standard tree-thing and use a more standard linked_list solution. Something like:

my $dir = { name => '.',
            contents => [
                { name => 'subdir 1', contents => [...] },
                { name => 'subdir 2', contents => [...] } 
            ],
          };

Note: untested

Then you'd have a real tree-structure, which you could iterate recursively. You don't get the ease of the quick solution, but you get some robustness and flexibility. Plus, you can wrap this in a class structure and write accessor methods.

Best of all, you could use Class::Tree, which provides a premade OO interface to treelike structures of this kind... Haven't used it myself, but the docs list methods for reading directory trees directly from the filesystem.

stephen

[mr.nick]

That's sort of the direction I was going with the anonymous array. I was trying to accomplish this using Perl internals; only relying on it's own hashing and array functions. Using a btree would be too easy :)

mr.nick ...