On Wed, Nov 14, 2012 at 6:30 AM, Charles Hixson
wrote:
> I've measured it in several languages, and occasionally implemented the hash
> algorithm from scratch in C (two or three different ways of handling
> collisions...but Unicode means that I don't want to use C, though pointers
> was my origina
On Mon, Nov 12, 2012 at 10:12 PM, Charles Hixson
wrote:
> Brian Candler wrote:
>> As others have said: using a Hash may be more efficient, if there are
>> large gaps - but then you may have to sort the keys if you want to
>> iterate over it in order. It depends on your use case.
>>
> Hashes are s
