63 lines
2.0 KiB
Scheme
63 lines
2.0 KiB
Scheme
|
;;; DESTRUC -- Destructive operation benchmark.
|
||
|
|
|
||
|
|
(define (append-to-tail! x y)
|
||
|
|
(if (null? x)
|
||
|
|
y
|
||
|
|
(let loop ((a x) (b (cdr x)))
|
||
|
|
(if (null? b)
|
||
|
|
(begin
|
||
|
|
(set-cdr! a y)
|
||
|
|
x)
|
||
|
|
(loop b (cdr b))))))
|
||
|
|
|
||
|
|
(define (destructive n m)
|
||
|
|
(let ((l (do ((i 10 (- i 1)) (a '() (cons '() a)))
|
||
|
|
((= i 0) a))))
|
||
|
|
(do ((i n (- i 1)))
|
||
|
|
((= i 0) l)
|
||
|
|
(cond ((null? (car l))
|
||
|
|
(do ((l l (cdr l)))
|
||
|
|
((null? l))
|
||
|
|
(if (null? (car l)) (set-car! l (cons '() '())))
|
||
|
|
(append-to-tail! (car l)
|
||
|
|
(do ((j m (- j 1)) (a '() (cons '() a)))
|
||
|
|
((= j 0) a)))))
|
||
|
|
(else
|
||
|
|
(do ((l1 l (cdr l1)) (l2 (cdr l) (cdr l2)))
|
||
|
|
((null? l2))
|
||
|
|
(set-cdr! (do ((j (quotient (length (car l2)) 2) (- j 1))
|
||
|
|
(a (car l2) (cdr a)))
|
||
|
|
((zero? j) a)
|
||
|
|
(set-car! a i))
|
||
|
|
(let ((n (quotient (length (car l1)) 2)))
|
||
|
|
(cond ((= n 0)
|
||
|
|
(set-car! l1 '())
|
||
|
|
(car l1))
|
||
|
|
(else
|
||
|
|
(do ((j n (- j 1)) (a (car l1) (cdr a)))
|
||
|
|
((= j 1)
|
||
|
|
(let ((x (cdr a)))
|
||
|
|
(set-cdr! a '())
|
||
|
|
x))
|
||
|
|
(set-car! a i))))))))))))
|
||
|
|
|
||
|
|
(define (main . args)
|
||
|
|
(run-benchmark
|
||
|
|
"destruc"
|
||
|
|
destruc-iters
|
||
|
|
(lambda (result)
|
||
|
|
(equal? result
|
||
|
|
'((1 1 2)
|
||
|
|
(1 1 1)
|
||
|
|
(1 1 1 2)
|
||
|
|
(1 1 1 1)
|
||
|
|
(1 1 1 1 2)
|
||
|
|
(1 1 1 1 2)
|
||
|
|
(1 1 1 1 2)
|
||
|
|
(1 1 1 1 2)
|
||
|
|
(1 1 1 1 2)
|
||
|
|
(1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 3))))
|
||
|
|
(lambda (n m) (lambda () (destructive n m)))
|
||
|
|
600
|
||
|
|
50))
|