| 1 |
;;; Taken from srfi-190 repo |
| 2 |
;;; https://github.com/scheme-requests-for-implementation/srfi-190/test.scm |
| 3 |
|
| 4 |
(import (scheme base) |
| 5 |
(srfi 158) |
| 6 |
(srfi 190) |
| 7 |
(srfi 64)) |
| 8 |
|
| 9 |
(test-begin "SRFI 190") |
| 10 |
|
| 11 |
(test-group "Coroutine Generators" |
| 12 |
(define g |
| 13 |
(coroutine-generator |
| 14 |
(do ((i 0 (+ i 1))) |
| 15 |
((<= 3 i)) |
| 16 |
(yield i)))) |
| 17 |
|
| 18 |
(define-coroutine-generator (h n) |
| 19 |
(do ((i 0 (+ i 1))) |
| 20 |
((<= 3 i)) |
| 21 |
(yield i))) |
| 22 |
|
| 23 |
(define gg |
| 24 |
(let-syntax ((yield-square (syntax-rules () ((_ i) (yield (* i i)))))) |
| 25 |
(coroutine-generator |
| 26 |
(do ((i 0 (+ i 1))) |
| 27 |
((<= 3 i)) |
| 28 |
(yield-square i))))) |
| 29 |
|
| 30 |
(test-equal '(0 1 2) (generator->list g)) |
| 31 |
(test-equal '(0 1 2) (generator->list (h 3))) |
| 32 |
(test-equal '(0 1 4) (generator->list gg)) |
| 33 |
) |
| 34 |
|
| 35 |
(test-end) |