summaryrefslogtreecommitdiff
path: root/benchmark
diff options
context:
space:
mode:
authorJohn Hawthorn <john@hawthorn.email>2021-09-28 19:13:24 -0700
committerAaron Patterson <aaron.patterson@gmail.com>2021-09-30 13:06:53 -0700
commitbb488a1a7f844bb4f2b9fd561b29a0560a7bf06a (patch)
tree559e0a301906ca542427db626ee230573a68890b /benchmark
parent529fc204af84f825f98f83c34b004acbaa802615 (diff)
Use faster any_hash logic in rb_hash
From the documentation of rb_obj_hash: > Certain core classes such as Integer use built-in hash calculations and > do not call the #hash method when used as a hash key. So if you override, say, Integer#hash it won't be used from rb_hash_aref and similar. This avoids method lookups in many common cases. This commit uses the same optimization in rb_hash, a method used internally and in the C API to get the hash value of an object. Usually this is used to build the hash of an object based on its elements. Previously it would always do a method lookup for 'hash'. This is primarily intended to speed up hashing of Arrays and Hashes, which call rb_hash for each element. compare-ruby: ruby 3.0.1p64 (2021-04-05 revision 0fb782ee38) [x86_64-linux] built-ruby: ruby 3.1.0dev (2021-09-29T02:13:24Z fast_hash d670bf88b2) [x86_64-linux] # Iteration per second (i/s) | |compare-ruby|built-ruby| |:----------------|-----------:|---------:| |hash_aref_array | 1.008| 1.769| | | -| 1.76x|
Notes
Notes: Merged: https://github.com/ruby/ruby/pull/4916
Diffstat (limited to 'benchmark')
-rw-r--r--benchmark/hash_aref_array.rb5
1 files changed, 5 insertions, 0 deletions
diff --git a/benchmark/hash_aref_array.rb b/benchmark/hash_aref_array.rb
new file mode 100644
index 0000000000..ac7a683d95
--- /dev/null
+++ b/benchmark/hash_aref_array.rb
@@ -0,0 +1,5 @@
+h = {}
+arrays = (0..99).each_slice(10).to_a
+#STDERR.puts arrays.inspect
+arrays.each { |s| h[s] = s }
+200_000.times { arrays.each { |s| h[s] } }