suzanne.soy/racket
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Got rid the the mandelbrot-unsafe benchmark, to reflect Eli's

Browse Source 
changes.
This commit is contained in:
Vincent St-Amour 2010-06-21 16:25:35 -04:00
parent 6e1954d79b
commit dd858bc11f
5 changed files with 0 additions and 78 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
collects/tests/racket/benchmarks/shootout/auto.rkt
View File

@ -122,7 +122,6 @@ exec racket -qu "$0" ${1+"$@"}
lists
mandelbrot
mandelbrot-generic
mandelbrot-unsafe
matrix
meteor
moments

1
collects/tests/racket/benchmarks/shootout/run.rkt
View File

@ -21,7 +21,6 @@
("lists" "2000")
("mandelbrot" "3000")
("mandelbrot-generic" "3000")
("mandelbrot-unsafe" "3000")
("matrix" "12000")
("meteor" "25000")
("moments" #f ,(lambda () (mk-sumcol-input 2000)))

2
collects/tests/racket/benchmarks/shootout/typed/mandelbrot-unsafe-non-optimizing.rkt
View File

@ -1,2 +0,0 @@
(module mandelbrot-unsafe-non-optimizing "wrap-typed-non-optimizing.ss")

2
collects/tests/racket/benchmarks/shootout/typed/mandelbrot-unsafe-optimizing.rkt
View File

@ -1,2 +0,0 @@
(module mandelbrot-unsafe-optimizing "wrap-typed-optimizing.ss")

72
collects/tests/racket/benchmarks/shootout/typed/mandelbrot-unsafe.rktl
View File

@ -1,72 +0,0 @@
;; The Computer Language Benchmarks Game
;; http://shootout.alioth.debian.org/
;;
;; Derived from the Chicken variant, which was
;; Contributed by Anthony Borla
;;
;; This version uses unsafe operations
(require racket/cmdline
racket/require (for-syntax racket/base)
(filtered-in
(lambda (name) (regexp-replace #rx"unsafe-" name ""))
racket/unsafe/ops))
(define +limit-sqr+ 4.0)
(define +iterations+ 50)
;; -------------------------------
(: mandelbrot (Integer Integer Integer Float -> (U 0 1)))
(define (mandelbrot x y n ci)
(let ((cr (fl- (fl/ (fl* 2.0 (fx->fl x)) (fx->fl n)) 1.5)))
(let loop ((i 0) (zr 0.0) (zi 0.0))
(if (fx> i +iterations+)
1
(cond
((fl> (fl+ (fl* zr zr) (fl* zi zi)) +limit-sqr+) 0)
(else (loop (fx+ 1 i)
(fl+ (fl- (fl* zr zr) (fl* zi zi)) cr)
(fl+ (fl* 2.0 (fl* zr zi)) ci))))))))
;; -------------------------------
(: main (Integer -> Void))
(define (main n)
(let ((out (current-output-port)))
(fprintf out "P4\n~a ~a\n" n n)
(let loop-y ((y 0))
(when (fx< y n)
(let ([ci (fl- (fl/ (fl* 2.0 (fx->fl y)) (fx->fl n)) 1.0)])
(let: loop-x : Void ((x : Integer 0) (bitnum : Integer 0) (byteacc : Integer 0))
(if (fx< x n)
(let ([bitnum (fx+ 1 bitnum)]
[byteacc (fx+ (fxlshift byteacc 1)
(mandelbrot x y n ci))])
(cond
((fx= bitnum 8)
(write-byte byteacc out)
(loop-x (fx+ 1 x) 0 0))
[else (loop-x (fx+ 1 x) bitnum byteacc)]))
(begin
(when (positive? bitnum)
(write-byte (arithmetic-shift byteacc
(- 8 (bitwise-and n #x7)))
out))
(loop-y (add1 y))))))))))
;; -------------------------------
(command-line #:args (n)
(main (assert (string->number (assert n string?)) exact-integer?)))