----- Original Message -----
From: "David McNab" <[EMAIL PROTECTED]>
> Perhaps this is way ancient, but in case it's not, here goes.
Exponential insertion is dearly needed, so definitely not ancient. I don't
really see what you need to simulate here though =;-)
> Algorithm is to start at a guess of 1, and keep doubling the guess till
the
> key request fails, then binary search till the next empty key slot is
found.
You should always add a random value in the doubling phase; otherwise, the
indices will be as easy to spam as they are now - just fill slots 1, 2, 4,
8, 16, ... with your bogus values.
-Stefan
_______________________________________________
Devl mailing list
[EMAIL PROTECTED]
http://lists.freenetproject.org/mailman/listinfo/devl
