That is (again) really interesting/informative. Thanks - this is one of those co... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		AlisdairO on April 5, 2010 \| parent \| context \| favorite \| on: Trees, Hash Tables and Tries That is (again) really interesting/informative. Thanks - this is one of those conversations that really restores my faith in communicating over the web :-).

elblanco on April 5, 2010 [–]

Actually, your idea of just sticking in the strlen on the hash nodes as a heuristic to prevent unnecessary collision checks is pretty good.

I too am glad to engage in this topic!

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact