anchor.diff:                (time-string 0-arg-cost)
                 (time-string slope)))))
   
  +(defmacro n-arg-defmethod (name n)
  +  (let ((args (loop for i below n collect (gensym))))
  +    `(defgeneric ,name (,@args)
  +       (:method (,@args) (declare (ignore ,@args))))))
  +
  +(n-arg-defmethod 0-arg-defmethod 0)
  +
  +(n-arg-defmethod 50-arg-defmethod 50)
  +
   ;; TODO more CLOS benchmarks
   
   ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
   ;;;
   ;;; lists and sequences
  -
  -(defun find-runtime (sequence)
  -  (let ((item #\!))
  -    (runtime
  -     (lambda (invocations)
  -       (dotimes (i invocations)
  -         (find item sequence))))))
   
   (answer |What is the cost of FINDing things?|
     (let* ((length 100)
  
positive.code:                        ((complex double-float) #'crunch-c64))))
                (funcall f length a1 a1 a2)
                (funcall f length a2 a2 a1)))))))))
  
  (answer |How many floating-point operations can this system do per second?|
    (format t "~a in single precision and ~a in double precision.~%"
            (flops-string (max (flops 'single-float)
                               (flops '(complex single-float))))
            (flops-string (max (flops 'double-float)
                               (flops '(complex double-float))))))
  
negative.code: ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
  ;;;
  ;;; core functionality
  
  (answer |What Lisp system is this?|
    (format t "~:[Something weird~;~:*~a~]"
  