I think it's a dictionary implementation based on buckets (as any other decent
On 2013-02-10, at 16:34, stephane ducasse <stephane.ducasse@free.fr> wrote:
>
> On Feb 10, 2013, at 4:22 PM, Sven Van Caekenberghe <sven@stfx.eu> wrote:
>
>>
>> On 10 Feb 2013, at 15:16, St�phane Ducasse <stephane.ducasse@inria.fr> wrote:
>>
>>> - migrated all the history
>>> - defined configurationOf
>>> - All tests are green under 1.4 and 2.0
>>>
>>> Stef
>>
>> Dear I ask: what is HastTable and how it is different from Dictionary ?
dictionary implementation does...)
I've shown in my master thesis that a simple bucket-based dictionary can outperform
our poor-mans single array collection dictionary in almost every operation. The only
drawback is the slightly bigger size in memory.
http://scg.unibe.ch/archive/masters/Brun11a.pdf