Large Collections (was: [ENH] WeakIdentityDictionary hashing)
Stephen Pair
stephen at pairhome.net
Tue Jul 1 13:33:22 UTC 2003
Andreas Raab wrote:
>"Change Set: WeakIDHash-ar
>Date: 1 July 2003
>Author: Andreas Raab
>
>The CS makes weak identity dictionaries hash the same way as
>IdentityDictionary, spreading out hash values to reduce the number of
>collisions."
>
>
I'd like to take this opportunity to remind people of the
LargeCollections package on SqueakMap. It is a minor refactoring of the
growth related aspects of the collection framework along with a couple
new types of collections. It is designed to aid in working with large
collections (particularly the case where those large collections start
to noticeably impact the performance of incremental GC). At its core is
a LargeArray class which can be used as a drop in replacement for Array
(thus enabling any collection based on Array to grow very large without
degrading the performance of IGC). Hashed collections are also
refactored such that everything is defined in terms of a hash getter
method and a comparison method (which eliminates a lot of redundant code
in the collection hierarchy).
- Stephen
More information about the Squeak-dev
mailing list
|