-
Notifications
You must be signed in to change notification settings - Fork 39
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Benchmarking the performance of dictionaries #35
Comments
Yes, that would be great. The current code for benchmarking in DataStructures.jl is nice a setup using PkgBenchmarks.jl |
Please do, or I will... for the OrderedDict and variants, OrderedRobinDict, LittleDict (that is ordered and fastest, but only for small dicts) etc. |
@PallHaraldsson I'd written a benchmark suite for |
Hi @eulerkochy, I ran your code, thanks! I'm not sure which operation is most important, maybe pop! or find-failure: find-failure OrderedRobinDict{Int64,Int64}() 10^4 elem Int64 minimum time TrialEstimate(40.000 ns) It's good to know OrderedRobinDict isn't slower (for this) than Base. Would you recommend that or something else, e.g. your new OrderedGeneralDict, I just discovered (as not merged), to replace Dict in Base? I thought one of the objection to change to ordered by default would be some new unordered might be even faster, and your SwissDict, should be the go to option to look into?
|
Benchmarking code for the dictionaries is not present at the moment. I'll be happy to write a benchmark for the dictionaries. A sign of approval/necessity is all that I am waiting for !
The text was updated successfully, but these errors were encountered: