anholt / hash_table Goto Github PK

Hi,

The readme says that:

When an insert collides, the insert
steps through the table using the reprobe stride until a free or dead entry is
found. 

But reading the code is my understanding correct that deleted entries are only reused if a free slot is not found?
If so, I am curious why.

Hi,

I am not sure if random() is available on Windows. I had no problem using the library on Linux, but on Windows I am getting undefined reference. Also random() is not standard C. Can it be replaced by standard C function such as rand()?

Thanks and Regards