-;; -*- lisp -*-
+;;;; -*- Mode: Lisp; indent-tabs-mode: nil -*-
-(in-package :it.bese.FiveAM)
+(in-package :it.bese.fiveam)
;;;; ** Random (QuickCheck-ish) testing
(for-all (((a b) (gen-two-integers)))
(is (integerp a))
(is (integerp b)))"
- (with-unique-names (test-lambda-args)
+ (with-gensyms (test-lambda-args)
`(perform-random-testing
(list ,@(mapcar #'second bindings))
(lambda (,test-lambda-args)
(throw 'run-once
(list :guard-conditions-failed))))))))
-;;;; *** Implementation
+;;;; *** Implementation
;;;; We could just make FOR-ALL a monster macro, but having FOR-ALL be
;;;; a preproccessor for the perform-random-testing function is
(double-float most-positive-double-float)
(long-float most-positive-long-float)))
(bound (or bound (max most-positive (- most-negative)))))
- (coerce
+ (coerce
(ecase (random 2)
(0 ;; generate a positive number
(random (min most-positive bound)))
non-NIL, limits the returned chars to those which pass
alphanumericp."
(lambda ()
- (if alphanumericp
- (loop
- for count upfrom 0
- for char = (code-char (funcall code))
- until (alphanumericp char)
- when (= 1000 count)
- do (error "After 1000 iterations ~S has still not generated an alphanumeric character :(."
- code)
- finally (return char))
- (code-char (funcall code)))))
+ (loop
+ for count upfrom 0
+ for char = (code-char (funcall code))
+ until (and char
+ (or (not alphanumericp)
+ (alphanumericp char)))
+ when (= 1000 count)
+ do (error "After 1000 iterations ~S has still not generated ~:[a valid~;an alphanumeric~] character :(."
+ code alphanumericp)
+ finally (return char))))
(defun gen-string (&key (length (gen-integer :min 0 :max 80))
(elements (gen-character))