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.
Hi Simo and John,
would you please point me to some docs so I learn what are you talking about?
;)
Many thanks!
Martin
--
http://mail.python.org/mailman/listinfo/python-list
