Funny Benchmark with Julia (no longer) at the bottom

[Palli]

Do you mean like LitteDict? It’s often much faster, if your Dict is small. But note it’s O(n), why not the default (I think that might though be ok for Julia itself, i.e. what does Julia need when e.g. compiling?).

I did think up a hybrid, LittleDict + regular, I or someone should implement, then it’s back to O(1), first scanning a limited n for LittleDict before the fallback. I could be ok for Base, or not…

Ordered Dict in Base: Is LittleDict not thread safe, and possibly the reason I can't add it to Base?

Also note that LittleDict has O(n) lookup cost compared to O(1) for the current Dict implementation. This means hat if the collection isn’t super small, LittleDict will perform much, much worse than the current implementation. For dicts that are small, Base already has ImmutableDict, which has similar performance characteristics for lookup as LittleDict, so places where you would really see a benefit of using LittleDict should already be using ImmutableDict instead of Dict.

@algunion

The Dictionaries.jl supports a size hint, but in the current scenario, seems slower than the native implementation.

That’s not the same, it seems then, though I guess helpful for something.