SortedSet is much slower than Hash #3476
Closed
Labels
Milestone
Comments
MRI also suffers from this problem. |
while I did not run the specified benchmarks I have confirmed that using Set/SortedSet (in 9.2) operations are very close to native Java collection Set/SortedSet speed. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Hello,
after some discussion over at #jruby, I decided to open an issue here.
A recent benchmark shows that SortedSet is much much slower than using a Hash (Mapping the set value to
nil
) when deleting items from it.Full story: https://www.reddit.com/r/ruby/comments/3thkmk/doing_things_quite_fast_or_mixing_languages_or_an/
Benchmark: https://gist.github.com/Papierkorb/ab7bd6c5fdce12e3fc6c
Times from the benchmark (Taken from here)
Test machine:
The text was updated successfully, but these errors were encountered: