mirror of
https://github.com/ruby/ruby.git
synced 2022-11-09 12:17:21 -05:00
benchmark: drop all bm_ prefix for legacy driver.rb
benchmark/*.rb is only benchmarks now. We don't need prefixes. git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@63928 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
This commit is contained in:
parent
f992f42518
commit
433af16167
127 changed files with 0 additions and 0 deletions
43
benchmark/so_nsieve_bits.rb
Normal file
43
benchmark/so_nsieve_bits.rb
Normal file
|
|
@ -0,0 +1,43 @@
|
|||
#!/usr/bin/ruby
|
||||
#coding: us-ascii
|
||||
#
|
||||
# The Great Computer Language Shootout
|
||||
# http://shootout.alioth.debian.org/
|
||||
#
|
||||
# nsieve-bits in Ruby
|
||||
# Contributed by Glenn Parker, March 2005
|
||||
|
||||
CharExponent = 3
|
||||
BitsPerChar = 1 << CharExponent
|
||||
LowMask = BitsPerChar - 1
|
||||
|
||||
def sieve(m)
|
||||
items = "\xFF" * ((m / BitsPerChar) + 1)
|
||||
masks = ""
|
||||
BitsPerChar.times do |b|
|
||||
masks << (1 << b).chr
|
||||
end
|
||||
|
||||
count = 0
|
||||
pmax = m - 1
|
||||
2.step(pmax, 1) do |p|
|
||||
if items[p >> CharExponent][p & LowMask] == 1
|
||||
count += 1
|
||||
p.step(pmax, p) do |mult|
|
||||
a = mult >> CharExponent
|
||||
b = mult & LowMask
|
||||
items[a] -= masks[b] if items[a][b] != 0
|
||||
end
|
||||
end
|
||||
end
|
||||
count
|
||||
end
|
||||
|
||||
n = 9 # (ARGV[0] || 2).to_i
|
||||
n.step(n - 2, -1) do |exponent|
|
||||
break if exponent < 0
|
||||
m = 2 ** exponent * 10_000
|
||||
count = sieve(m)
|
||||
printf "Primes up to %8d %8d\n", m, count
|
||||
end
|
||||
|
||||
Loading…
Add table
Add a link
Reference in a new issue