From: Johnicholas Hines (johnicholas.hines_at_[hidden])
Date: 2008-04-22 11:56:02
On Mon, Apr 21, 2008 at 4:39 AM, Thorsten Ottosen
> My typical use case is that I will fill the container once
> (and I know how many elements that will be put in there). Then this
> object is used again and again for lookup. In this case, allocating room
> for 2-3 times the need seems like overkill, and perhaps only allocating
> 20%-30% extra would be more fair.
Would there be interest in a perfect_hash object to handle this use
My impression is that perfect hashes are well understood and routinely
used, which might make them a candidate for boost.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk