I'm leaning towards it not being worth doing. Something like that is trivial to do with File::Find. Specify the desired data format to produce more closely and someone will likely scribble some code to spit that out in all of a half dozen lines.

I'm not sure it makes a lot of sense, either.. both the directory structure and the resultant data structure are trees, so you need to write tree-traversal code to do anything with either. Why do whatever it is you need to do while traversing a data structure created by traversing the directory structure, and not do the work right as you're traversing the directory structure, with no intermediate data structure involved?

On the other hand, if it's the interface of File::Find you don't like - have you looked for an alternative? Tie::Dir lets you treat directories as hashes on the fly, f.ex; it's trivial to write a few lines of wrapper code around it to traverse directory trees. Or to subclass it to return tied hashes when you look at an entry that represents a directory. Or..

Makeshifts last the longest.

Tie::Dir doesn't seem to return a recursive data structure, which is what I am looking for. I've run into a few odd circumstances where changing the contents of a directory (creating new files, for example) did strange things to File::Find.

--
negativespace.net - all things inbetween.

As I said, it should be rather simple to subclass it so that it does.

Makeshifts last the longest.

1. If you're going to do something more than twice, make it a function
2. If you're going to use it in more than two programs, make it a module
3. If doing it even once made your head hurt, throw it in a module
4. If it has data you don't want to change yourself, make it work from template files
5. If the code is could be generated from some sort of parameters, use a templating code generator for it
6. If it feels like a monkey could do it, check the above list to see what you missed

perl -le 'print+unpack("N",pack("B32","00000000000000000000001000111110"))'

update: Fond another relevant node ( How to map a directory tree to a perl hash tree )

MJD says you can't just make shit up and expect the computer to know what you mean, retardo! I run a Win32 PPM repository for perl 5.6x+5.8x. I take requests. ** The Third rule of perl club is a statement of fact: pod is sexy.