1. Re: Umm,
- Posted by Robert Craig <rds at EMAIL.MSN.COM>
Mar 24, 1998
-
Last edited Mar 25, 1998
Robert B. Pilkington writes:
> Oh great, I just learn about and how to use hashing and
> now I'm told I'm gonna need binary trees.... so I go to
> TREE.EX and try to see how a binary tree works. I
> happen to feel like running on it my spelling
> dictionary and a couple seconds later......
> a EX.ERR and CW.ERR appear
That bug has been fixed already in the 2.0
Official release (coming in the next day or two).
What happens is that you are building a tree by
feeding in 50000 words *in sorted order*. This
makes a tree 50000 levels deep (sequences nested
within sequences nested within sequences ...) and crashes
2.0 beta ex or exw. (I know - I did *exactly* the same thing
myself a month ago.) It will work in 2.0 Official Release.
(But it's *extremely* inefficient to have a tree with that shape.)
Regards,
Rob Craig
Rapid Deployment Software
