From 393e36b6da91c45465d0ffb2eb8c040665768ba0 Mon Sep 17 00:00:00 2001 From: Thomas Waldmann Date: Sun, 13 Dec 2015 19:58:32 +0100 Subject: [PATCH] updated internals docs: hash table max. load factor is 0.75 now --- docs/internals.rst | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/docs/internals.rst b/docs/internals.rst index 2ebed0c5a..5f3e96ec9 100644 --- a/docs/internals.rst +++ b/docs/internals.rst @@ -276,10 +276,10 @@ buckets. As a consequence the hash is just a start position for a linear search, and if the element is not in the table the index is linearly crossed until an empty bucket is found. -When the hash table is almost full at 90%, its size is doubled. When it's -almost empty at 25%, its size is halved. So operations on it have a variable +When the hash table is filled to 75%, its size is doubled. When it's +emptied to 25%, its size is halved. So operations on it have a variable complexity between constant and linear with low factor, and memory overhead -varies between 10% and 300%. +varies between 33% and 300%. Indexes / Caches memory usage