mandelbrot Racket #2 program
source code
#lang racket/base
;;; The Computer Language Benchmarks Game
;;; https://salsa.debian.org/benchmarksgame-team/benchmarksgame/
;;
;;; Derived from the Chicken Scheme variant by Anthony Borla
;;; contributed by Matthew Flatt
;;
;; 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)
;; -------------------------------
(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))))))))
;; -------------------------------
(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 ((x 0) (bitnum 0) (byteacc 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 (string->number n)))
notes, command-line, and program output
NOTES:
64-bit Ubuntu quad core
Racket v8.14 [cs].
Fri, 06 Sep 2024 18:47:31 GMT
MAKE:
make: *** No rule to make target 'mandelbrot.racket-2.racket_run'. Stop.
0.06s to complete and log all make actions
COMMAND LINE:
/opt/src/./racket-8.14/bin/racket mandelbrot.racket-2.racket 16000
(BINARY) PROGRAM OUTPUT NOT SHOWN