>So, OrderedCollections are an order of magnitude faster (which I
>expected), but IdentityDictionarys are consistently slower than
>ictionarys, which surprised me. I wonder if that's because of using
>SmallIntegers for the keys.
Is there an implementation of LookupTable (is this name correct?)
for Squeak. This is supposed to be a Dictionary which does not use
associations, and I understand it is speedier. Maybe an
implementation of IdentityDictionary would also be helpfully
speedier done this way.
-Carl Gundel
