Faster dictionaries?

sig siguctua at gmail.com
Thu Jul 19 21:34:57 UTC 2007


On 20/07/07, nicolas cellier <ncellier at ifrance.com> wrote:
> stephane ducasse a écrit :
> > did you check the hashtable implementation on squeaksource.
> > t is better than Squeak dictionary since it does lineary degrades.
> > in your tests did you try to have large dictionaries? Because this has
> > also an
> > impact on the performance.
> >
> > Stef
> >
>
> sig's work is essentially same as HashTable...
>
> Except some details:
> HashTable has lot of message indirections to ease subclassing (Weak,
> Identity...)
> HashTable stores hash code instead of re-computing (memory/speed compromise)
> HashTable optimize link list enumeration with [...
> (item := item next) isNil] whileFalse loop rather than using recursive
> message send
>

Interesting, why its not included to kernel classes?

> Nicolas
>
>
>



More information about the Squeak-dev mailing list