Talk:Lazy deletion
From Wikipedia, the free encyclopedia
[edit] eager deletion
Is eager deletion where the delete just happens straight up, and you're left with lost elements? Fresheneesz 06:04, 31 October 2007 (UTC)
- Actually, I think eager deletion involves with filling the hole with a value previously gotten, that matches the chain sequence. This would involve testing the next element found by probing and checking if its key would map to that spot.. etc... that would take foreeeever. Fresheneesz 06:30, 31 October 2007 (UTC)
[edit] Not Complete
Lazy deletion can happen in a lot of data structure, not only in hashing. so this article should better be updated. Visame (talk) 19:45, 7 June 2008 (UTC)