File: hash_aref_dsym_long.rb

package info (click to toggle)
ruby3.3 3.3.8-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 153,620 kB
  • sloc: ruby: 1,244,308; ansic: 836,474; yacc: 28,074; pascal: 6,748; sh: 3,913; python: 1,719; cpp: 1,158; makefile: 742; asm: 712; javascript: 394; lisp: 97; perl: 62; awk: 36; sed: 23; xml: 4
file content (21 lines) | stat: -rw-r--r-- 474 bytes parent folder | download | duplicates (10) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
 
# [ruby-core:70129] [Bug #11396]
collection_size = 200000
sample_size = 10000

values = (1..collection_size).to_a.map do |x|
  "THIS IS A LONGER STRING THAT IS ALSO UNIQUE #{x}"
end

symbol_hash = {}

values.each do |x|
  symbol_hash[x.to_sym] = 1
end

# use the same samples each time to minimize deviations
rng = Random.new(0)
symbol_sample_array = values.sample(sample_size, random: rng).map(&:to_sym)

3000.times do
  symbol_sample_array.each { |x| symbol_hash[x] }
end