> 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