Igor et al, > That's why each of implementations (Dictionary and HashTable) having own > niche. > For small sizes, dictionaries in their current state is best. > For bigger sizes, one could choose to use HashTable, or any other > implementation, which may fit better. >
As long as this refers to objects that implement #hash as #identityHash, yes. If you can produce a (reasonably efficient) hash function that has very few collisions, then open addressing with linear probing (the usual implementation of Set/Dictionary) tends to be the most efficient. Andres. _______________________________________________ Pharo-project mailing list [email protected] http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project
