Re: Maintaing the insertion order of an N-tier hash

I think you should look at XML::Smart. Any point in the tree parsed by XML::Smart can be accessed as an array, or as a tree - whichever is convenient for you at that point.

In addition, XML::Smart already has methods for writing out the tree (in the original order), and for parsing the XML (with pluggable parsers), so it would seem you would be able to concentrate on the important stuff (like what to do with the data once you have it parsed).

Comment on Re: Maintaing the insertion order of an N-tier hash Select or Download Code

Replies are listed 'Best First'.
Re: Re: Maintaing the insertion order of an N-tier hash by dwhitney (Beadle) on Mar 05, 2004 at 23:32 UTC
Thanks for all of your help. Take a look at the code I came up with. I know it's not quite what I said, but it gives me what I need! Thanks all!!!!!	[reply]