in reply to Perl Trees

If you want to construct a set of nested ULs out of the data, I'm assuming you'd only need values, not the key/value pairs of a hash. I'd recommend using arrays of arrays, for which there is a very helpful manpage, perllol

Replies are listed 'Best First'.
RE: Re: Perl Trees
by Anonymous Monk on Feb 25, 2000 at 01:01 UTC
    hmmm... I was going to respond that no, these UL's would be text and URL pairs but your response made me think more about it. each item in the array could itself contain the entire a href tag, it's text and the /a as well. no need to maintain them seperately. easier than i had previously been thinking. thanks for simplifying my thoughts.