From: Gary Wright <gwtmp01@...>
Date: 2007-12-12T17:40:44+09:00
Subject: Re: Dynamically generate a symbol name


On Dec 12, 2007, at 2:29 AM, Eivind Eklund wrote:
> The memory footprint will increase.

Yes. I said that.

> "Hash table performance is not affected by size" is a simplification
> that hold when you have a pre-90s microprocessor or a microcontroller
> and the entire hash table is in memory to start with and you have no
> two entries that hash to the same slot.  This is a restricted case.
> Assuming some speed loss for increased size is a good assumption.

Of course.  But your observations are true of any data structure that
indexes arbitrary data and so isn't all that helpful in understanding
what differentiates a Hash with O(1) lookup from a Tree with O(log n)
lookup from an Array with O(n) lookup.

Gary Wright