I finally released my first project to the www.squeaksource.com repository. Its called FasterSets. It makes sets faster by not doing compares during grow operations which makes adding to sets use about 14% fewer compares on average during an add: operation assuming no deletions or preallocation of space before adding elements. Code for measuring performance is included. See Class FastSetsComment.
Comments welcome.
I consider the project complete but am willing to make changes as required or give permissions for others to do so or to take over the project.
My hope is that this code will be incorporated into Squeak someday. I have not signed any release forms to allow this but am willing to do so.
The project runs in Squeak 3.10.2 but can be easily modified to work in previous versions of Squeak.
Regards
Ralph Boland