2009/10/22 Andres Valloud <[email protected]>: > The nice way of doing this would be to have a layer of indirection so > that the storage strategy decides how to use the hashed storage. > However, compared to the current Set/Dictionary implementation, that may > be a bit slower. It would not be a terrific idea to have multiple > subclasses of Set/Dictionary depending on the storage strategy, as that > would result in an explosion of classes. > Not necessary it should lead to explosion.
We already having a storage in Set - array slot. So, its easy to imagine that this slot may change the class which implements the storage, while from outside you still seeing a Set. > John M McIntosh wrote: >> In the far past Visual Age would become the implementation logic for >> Sets depending >> on how big the set was, so for example with 10 elements it would be >> linear list. Of course >> it's been 14 years, perhaps I'm remembering it wrong. >> >> On 2009-10-22, at 6:46 AM, Lukas Renggli wrote: >> >> > -- Best regards, Igor Stasenko AKA sig. _______________________________________________ Pharo-project mailing list [email protected] http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project
