22 Apr
2008
22 Apr
'08
3:56 p.m.
On Mon, Apr 21, 2008 at 4:39 AM, Thorsten Ottosen <thorsten.ottosen@dezide.com> wrote:
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 case specifically? My impression is that perfect hashes are well understood and routinely used, which might make them a candidate for boost. Johnicholas