OpenEuphoria

Re: print.e and Other Questions

• Posted by euman at bellsouth.net Mar 04, 2002
• 375 views

----- Original Message ----- 
From: "C. K. Lester" <cklester at yahoo.com>
To: "EUforum" <EUforum at topica.com>
> 
> C. K. Lester wrote:
> > Where can I get print.e?
> 
> Nevermind. I found it.
> 
> > How do I use Euman's hash table? Or, rather, what structure is it?
> > I'll be looking at it tonight, but maybe somebody can give me a
> > general idea about hash tables.
> 
> Okay, it looks like it's an index to the dictionary... is that right?
> 
> How is it sorted?!

CK,

I guess you can get away with saying "index to the dictionary" and that be
right.
The "word.txt" file is already sorted so when I read in the file it steps thru
it from
top to bottom (in alphabetical order) the next part is that it also "sorts" by
the
length of the text that its hashed and just appends to existing words of equal
length.

I just optimized my original routine to be almost as fast as Dereks optimized
version
he's still beating me by 0.11 sec. I just might be able to make Dereks version
faster.
I should know by tommorow.

If we keep this up Junko might have to retire her spellchecker. ;) just pickin
Junko

Euman