Created
March 22, 2012 07:02
-
-
Save bitemyapp/2156770 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# The Computer Language Benchmarks Game | |
# http://shootout.alioth.debian.org/ | |
# | |
# contributed by Karl von Laudermann | |
# modified by Jeremy Echols | |
# modified by Detlef Reichl | |
# modified by Joseph LaFata | |
# modified by Peter Zotov | |
size = ARGV.shift.to_i | |
puts "P4\n#{size} #{size}" | |
byte_acc = 0 | |
bit_num = 0 | |
y = 0 | |
while y < size | |
ci = (2.0*y/size)-1.0 | |
x = 0 | |
while x < size | |
zrzr = zr = 0.0 | |
zizi = zi = 0.0 | |
cr = (2.0*x/size)-1.5 | |
escape = 0b1 | |
z = 0 | |
while z < 50 | |
tr = zrzr - zizi + cr | |
ti = 2.0*zr*zi + ci | |
zr = tr | |
zi = ti | |
# preserve recalculation | |
zrzr = zr*zr | |
zizi = zi*zi | |
if zrzr+zizi > 4.0 | |
escape = 0b0 | |
break | |
end | |
z += 1 | |
end | |
byte_acc = (byte_acc << 1) | escape | |
bit_num += 1 | |
# Code is very similar for these cases, but using separate blocks | |
# ensures we skip the shifting when it's unnecessary, which is most cases. | |
if (bit_num == 8) | |
print byte_acc.chr | |
byte_acc = 0 | |
bit_num = 0 | |
elsif (x == size - 1) | |
byte_acc <<= (8 - bit_num) | |
print byte_acc.chr | |
byte_acc = 0 | |
bit_num = 0 | |
end | |
x += 1 | |
end | |
y += 1 | |
end |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment