Re: [tlug] Are ordered hashes useful?

[Marty Pauley <marty.pauley@example.com>]

On Sat, Feb 12, 2011 at 3:42 PM, Jun-Dai Bates-Kobashigawa
<jd.lists@example.com> wrote:
>
> Then there are cases where you want a data structure that provides both
> dictionary access and ordered list access.

That data structure is called a "tree".  It's very common.

> If there were such a construct in the language I was working in, I'm guessing I would use it.

Maybe time to find a better language? :-)

-- 
Marty