Title new hash table implementation
Priority feature Status reviewing
Superseder Nosy List jendrik, malte
Assigned To jendrik Keywords
Optional summary

Created on 2016-12-14.15:40:43 by jendrik, last changed by jendrik.

msg6458 (view) Author: jendrik Date: 2017-07-17.13:09:08
Here are the results of the experiment:

I think the memory, time and coverage scores look good. One important parameter is the maximum 
distance between an entry's ideal and actual bucket. In the experiment above the maximum distance 
is 32. I also ran an experiment where the maximum distance is 64:

While the memory scores are slightly higher than for maximum_distance=32, the time scores drop. 
Coverage scores are almost unaffected.

I propose to stick with maximum_distance=32 for now.
msg6426 (view) Author: jendrik Date: 2017-07-09.14:50:58
I copied the code for the new hash table from issue213, dusted it off and prepared a new 
pull request at . 
Experiments for blind() and lmcut() are running. I'll add this to the review queue.
msg5880 (view) Author: jendrik Date: 2016-12-14.15:40:43
Split off from issue213.
Date User Action Args
2017-07-17 13:09:08jendriksetmessages: + msg6458
summary: Status: wait for issue693 to be merged ->
2017-07-09 14:50:58jendriksetstatus: unread -> reviewing
messages: + msg6426
2017-04-27 23:25:05jendriksetsummary: Status: wait for issue693 to be merged
2016-12-14 15:40:43jendrikcreate