> Let's just leave the current implementation alone, please. It is a-ok.

+1

/*—————————————————-*/
Sent from my iPhone
https://boincstats.com/signature/-1/user/51616339056/sig.png
See https://objectnets.net and https://objectnets.org
https://datascilv.com and https://datascilv.org

> On Jan 25, 2020, at 02:50, Tobias Pape <Das.Linux at gmx.de> wrote:
> 
> 
>> On 25.01.2020, at 10:23, Jakob Reschke <forums.jakob at resfarm.de> wrote:
>> 
>> But we should not break #new: 1 and #new: 2 for HashedCollections, please.
>> 
>> Couldn't it be faster to use an OrderedCollection instead of a hashed one for such small numbers of elements? If the hash computation outweighs the linear search...
>> 
> As I said.
> This is just too much premature optimization of everything.
> It worked well before. If you need really small key-value-mappings, you should make one yourself.
> 
> Let's just leave the current implementation alone, please. It is a-ok.
> 
> Best regards
>    -Tobias
> 
> 
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.squeakfoundation.org/pipermail/squeak-dev/attachments/20200126/af7aacd1/attachment.html>