Re:Crit-bit Trees: the best way to store sets
by jakab922 on Tuesday September 20, 2011 @12:03PM
(#3018087)
You might find this interesting as a testbed -> http://www.facebook.com/careers/puzzles.php?puzzle_id=17
The data structure for the mealy recognizer described in the paper can very easily be changed to support minimal perfect hash numbers for all elements, without using more space (my implementation uses less space because of it, because the same information can be used to calculate the number of strings with a prefix in O(1) time).