ruby/benchmark/bm_hash_aref_sym_long.rb

h = {}
syms = %w[puts warn syswrite write stat bacon lettuce tomato
some symbols in this array may already be interned  others should not be
hash browns make good breakfast but not cooked using prime numbers
shift for division entries delete_if keys exist?
].map!(&:to_sym)
syms.each { |s| h[s] = s }
200_000.times { syms.each { |s| h[s] } }
st.c: use power-of-two sizes to avoid slow modulo ops * st.c (hash_pos): use bitwise AND to avoid slow modulo op (new_size): power-of-two sizes for hash_pos change (st_numhash): adjust for common keys due to lack of prime modulo [Feature #9425] * hash.c (rb_any_hash): right shift for symbols * benchmark/bm_hash_aref_miss.rb: added to show improvement * benchmark/bm_hash_aref_sym_long.rb: ditto * benchmark/bm_hash_aref_str.rb: ditto * benchmark/bm_hash_aref_sym.rb: ditto * benchmark/bm_hash_ident_num.rb: added to prevent regression * benchmark/bm_hash_ident_obj.rb: ditto * benchmark/bm_hash_ident_str.rb: ditto * benchmark/bm_hash_ident_sym.rb: ditto git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@45384 b2dd03c8-39d4-4d8f-98ff-823fe69b080e 2014-03-23 03:34:21 +04:00			`h = {}`
			`syms = %w[puts warn syswrite write stat bacon lettuce tomato`
			`some symbols in this array may already be interned others should not be`
			`hash browns make good breakfast but not cooked using prime numbers`
			`shift for division entries delete_if keys exist?`
			`].map!(&:to_sym)`
			`syms.each { \|s\| h[s] = s }`
			`200_000.times { syms.each { \|s\| h[s] } }`