How is the eCLR Dictionary implemented, under the hood?
Are dictionary lookups O(1) / O(logn) / linear?
How is the eCLR Dictionary implemented, under the hood?
Are dictionary lookups O(1) / O(logn) / linear?
Related question: when you iterate over Dictionary keys, are they guaranteed to be in insertion order?
Hello Josh,
I got some answers regarding this:
ContainsKeyExample:
"
Most parts are implemented like mono.
Dicitonarie entries are found by Hash tables.
As long as there are no Kollisions it should be O(1).
"
some functions are O(1) some O(n).Please lookup the mono implementation of these functions:
http://download.mono-project.com/sources/mono/kind regards,
Oliver