On Tue, Jan 11, 2005 at 12:33:42AM +0200, Simo Melenius wrote: > "John Lenton" <[EMAIL PROTECTED]> writes: > > > you probably want to look into building set-like objects ontop of > > tries, given the homogeneity of your language. You should see > > imrpovements both in size and speed. > > Ternary search trees give _much_ better space-efficiency compared to > tries, at the expense of only slightly slower build and search time. > This is especially essential as the OP mentioned he could have huge > sets of data.
hmm! sounds like *some*body needs to go read up on ternary trees,
then.
Ok, ok, I'm going...
--
John Lenton ([EMAIL PROTECTED]) -- Random fortune:
Fortune finishes the great quotations, #6
"But, soft! What light through yonder window breaks?"
It's nothing, honey. Go back to sleep.
signature.asc
Description: Digital signature
-- http://mail.python.org/mailman/listinfo/python-list
