From: Joel VanderWerf <vjoel@...>
Date: 2006-08-22T07:32:01+09:00
Subject: Re: Why Does Hash Apparently Reorder Its Internal Representation And Other Associated Ponderings

Austin Ziegler wrote:
> On 8/21/06, Just Another Victim of the Ambient Morality
> <ihatespam@rogers.com> wrote:
>>     I think what you are thinking of is a red black tree (or just a 
>> binary
>> tree, in general) and not a hash...
> 
> No, people are thinking of an associative array or an association list
> as someone else called it in this thread. I'm not sure about r/b
> trees, but binary trees are most *definitely* not what is wanted since
> what is wanted is insertion order in most cases, not an arbitrary
> sorted order.

Red-black trees are (like binary trees) sorted by keys, rather than 
insertion order (but you could use the insertion ordinal as the key to 
get insertion order behavior). But they don't scale as well as Hash.

-- 
       vjoel : Joel VanderWerf : path berkeley edu : 510 665 3407