OpenEuphoria

Re: contest #2

• Posted by euman at bellsouth.net Mar 17, 2002
• 347 views

From: <bensler at mail.com>

> Contest#2 only requires the routine to be able to match a pattern 
> against words.txt, why add more words ?:P
> 
> Chris

I was commenting on the routine in general because it seem'd to be
under the microscope for speed. Im not writing for #2 either.

EumsHash( ) is versitile and very fast!

It will be hard to beat in the dictionary hash arena!
Load time is slightly slower than most but lookup
is extremely powerfull and fast because of the key
returned based on strings being so individual.

Chris hit on something earlier that changing the multiplier
will create values that will be different. The higher the value
the more unique the hash value will be but the slower the
EumsHash( ) algorithm will be. At present the multiplier of 3
is the fastest method (based on profile and profile_time)

Euman
euman at bellsouth.net