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%. This seems a bit optimistic (e. g. java.util.Hashtable uses 75% > as default).
Ack. > * 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 hurd_ihash *hurd_ihash_t; > /* Construction and destruction of hash tables. */ > > /* The default value for the maximum load factor in percent. */ > -#define HURD_IHASH_MAX_LOAD_DEFAULT 80 > +#define HURD_IHASH_MAX_LOAD_DEFAULT 75 > > /* The LOCP_OFFS to use if no location pointer is available. */ > #define HURD_IHASH_NO_LOCP INTPTR_MIN > -- > 2.0.0.rc0 > -- Samuel ***e trouve un .xls ***e passe un moment à se demander quelle version de xml c'est ça, le .xls e: donc j'ai fait un file.... -+- #sos - on n'a pas forcément les mêmes références que tout le monde -+-
