Attempting to learn Scheme, and what better way than by writing code to test my other code :P

ax-ut.ss

(define test-base
  (lambda (passed? result message)
    (if passed?
      (begin
        (display "  passed: ")
        (display message)
      )
      (begin
        (display "  failed: ")
        (display message)
        (display "\n    got: ")
        (display result)
      )
    )
    (newline)
    passed?
  )
)

(define-syntax test-define-unary
  (syntax-rules ()
    ((_ name operation)
     (define name (lambda (o m) (test-base (operation o) o m))))))

(define-syntax test-define-comparison
  (syntax-rules ()
    ((_ name comparison)
     (define name (lambda (o e m) (test-base (comparison o e) o m))))))

(test-define-unary test-true? (lambda (v) (not (eqv? #f v))))
(test-define-unary test-false? (lambda (v) (eqv? #f v)))
(test-define-unary test-null? null?)

;;; (test-true? #t "(true? #t) => #t")
;;; => passed: (true? #t) => #t

(test-define-comparison test-eqv? eqv?)
(test-define-comparison test=? =)
(test-define-comparison test-char=? char=?)
(test-define-comparison test-string=? string=?)

;;; (test-eqv? (+ 1 9) 10 "(1+9) eqv? 10 => #t")
;;; => passed: (1+9) eqv? 10 => #t

;;; (test-eqv? (make10) 10 "(make10) eqv? 10 => #t")
;;; => failed: (make10) eqv? 10 => #t
;;;      got: 2042