anchor.diff:  		     bench-new-qcolor/4
   		     bench-call-parent
   		     bench-call-setparent0
  -		     bench-call-setparent
  -		     ;; bench-call-parent/naive
  -		     ))
  -	(format t "(~A ~30T~D)~%" fun (best-of-3-funcall fun)))
  +		     bench-call-setparent))
  +	(format t "(~A ~30T~7D)~%" fun (best-of-3-funcall fun)))
  +      ;; give the interpreted functions their own repeat count to avoid
  +      ;; long delays:
  +      (let ((*repeat* (choose-repeat-count 'bench-interpret-call-parent)))
  +	(dolist (fun '(bench-interpret-new-qobject
  +		       bench-interpret-delete-qobject
  +		       bench-interpret-new-qcolor
  +		       bench-interpret-new-qcolor/3
  +		       bench-interpret-new-qcolor/4
  +		       bench-interpret-call-parent
  +		       bench-interpret-call-setparent0
  +		       bench-interpret-call-setparent))
  +	  (format t "(~A ~30T~6D)~%" fun (best-of-3-funcall fun))))
         ;;
         ;; The /CFFI tests do not benchmark CommonQt as such; they show
         ;; how fast we "would" be able to run if we had "optimal"
  
positive.code: 
  (defun microbench
      (&optional (name (lisp-implementation-type)))
    (with-open-file (s (make-pathname :name name
  				    :type "bench-txt"
  				    :defaults (commonqt-directory))
  
negative.code: 	   #+sbcl sb-sys:without-gcing
  	   (dotimes (i repeat)
  	     (funcall fun i)))
      (let* ((run1 (get-internal-run-time))
  	   (q
  	    (float (* (- run1 run0)
  		      (/ 1000000000 internal-time-units-per-second)
  		      (/ repeat)))))
        (if (< q 10)
  	  q
  	  (round q)))))
  
  (defparameter *repeat*
    50000)
  