Justus Winter, le Mon 12 May 2014 12:35:08 +0200, a écrit :
> The performance of hash tables depend critically on a low number of
> hash collisions. As the table fills up, the chance of collisions
> necessarily raises.
>
> Previously, libihash resized the hash table when the load exceeded
> 80%.
The performance of hash tables depend critically on a low number of
hash collisions. As the table fills up, the chance of collisions
necessarily raises.
Previously, libihash resized the hash table when the load exceeded
80%. This seems a bit optimistic (e. g. java.util.Hashtable uses 75%
as defa
Well, why? :)
Justus Winter, le Mon 12 May 2014 12:05:46 +0200, a écrit :
> * libihash/ihash.h (HURD_IHASH_MAX_LOAD_DEFAULT): Set to 75.
> ---
> libihash/ihash.h | 2 +-
> 1 file changed, 1 insertion(+), 1 deletion(-)
>
> diff --git a/libihash/ihash.h b/libihash/ihash.h
> index 3ca5ec3..6bdc925
* libihash/ihash.h (HURD_IHASH_MAX_LOAD_DEFAULT): Set to 75.
---
libihash/ihash.h | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/libihash/ihash.h b/libihash/ihash.h
index 3ca5ec3..6bdc925 100644
--- a/libihash/ihash.h
+++ b/libihash/ihash.h
@@ -94,7 +94,7 @@ typedef struct hur
