2009/7/14 Stéphane Ducasse <
[hidden email]>:
> Hi guys
>
> what is the conclusion for the faster sets?
>
> Stef
>
I am not quite sure what the conclusion was but based on the
comments I suggest that I release a new version of FasterSets
with the following changes:
1) change method name noCompareAdd: to noCompareOrGrowAdd:
This helps emphasize that it can't be used publicly.
2) Add methods addNew: and nastyAddNew:
I tried to generate a discussion on these methods but none was
forthcoming.
I am inclined to add them to FasterSets so that anybody who
wants to can
use them. I assume they will NOT be added to Pharo.
The method noCompareAdd: currently updates the tally value and it has been
proposed to move this step outside of noCompareAdd: or create a method
noCompareAddAll: or both. I can do this or someone else can.
If someone else does this then I strongly encourage that that they
release the change to FasterSets first. I will add whoever does
this to the list
of those able to modify FasterSets.
Note that I want to incorporate FasterSets to any version of Smalltalk that
would benefit from it so I want it to contain the final code that Pharo uses.
Also note that I was recently told that GNU Smalltalk already does what
FasterSets does.
Regards,
Ralph Boland
_______________________________________________
Pharo-project mailing list
[hidden email]
http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project
Locked
