Changes to Trunk (
http://source.squeak.org/trunk.html) in the last 24 hours:
http://lists.squeakfoundation.org/pipermail/packages/2009-November/001730.htmlName: Collections-ar.183
Ancestors: Collections-ul.179, Collections-ul.180, Collections-ul.181, Collections-ul.182
Merging Collections-ul.179, Collections-ul.180, Collections-ul.181, Collections-ul.182:
- added: String >> #hashWithInitialHash: which lets the string to decide which hash implementation to use, this way ByteStrings can use the primitive implementation instead of the general one
- speed up mergesort for the general case (using <= for comparison), sacrificing < 1% performance for other cases
- allow symbols to be evaluated as comparison blocks. For example: sorting an Array in descening order can be as simple as: array sort: #>=, it's also faster than using a block.
- simplified Dictionary >> #keysSortedSafely
- simplified WeakRegistry >> #keys
- save a few bytecodes in #scanFor: of identity based collections when their size is between 4097 and 8191
- fix: WeakKeyDictionary >> #finalizeValues: (increment the tally, and make sure that we don't lose the key)
- collect the objects which should be finalized into an IdentitySet instead of an OrderedCollection in WeakRegistry >> #finalizeValues this should give better performance in WeakKeyDictionary >> #finalizeValues:
=============================================
http://lists.squeakfoundation.org/pipermail/packages/2009-November/001731.htmlName: Kernel-ul.287
Ancestors: Kernel-nice.286
- simplified ClassDescription >> #organization
=============================================
http://lists.squeakfoundation.org/pipermail/packages/2009-November/001732.htmlName: Monticello-ul.331
Ancestors: Monticello-nice.330
- faster hashing with String >> #hashWithInitialHash:. Load Collections-ul.179 before this package.
=============================================