0.7.1.24:
[sbcl.git] / src / pcl / cpl.lisp
index 8fdd038..f834b1a 100644 (file)
@@ -23,8 +23,8 @@
 
 (in-package "SB-PCL")
 \f
-;;; compute-class-precedence-list
-;;;
+;;;; COMPUTE-CLASS-PRECEDENCE-LIST and friends
+
 ;;; Knuth section 2.2.3 has some interesting notes on this.
 ;;;
 ;;; What appears here is basically the algorithm presented there.
                 (format nil "named ~S" (class-name class))
                 class))))
     (mapcar
-      #'(lambda (reason)
-         (ecase (caddr reason)
-           (:super
-             (format
-               nil
-               "The class ~A appears in the supers of the class ~A."
-               (class-or-name (cadr reason))
-               (class-or-name (car reason))))
-           (:in-supers
-             (format
-               nil
-               "The class ~A follows the class ~A in the supers of the class ~A."
-               (class-or-name (cadr reason))
-               (class-or-name (car reason))
-               (class-or-name (cadddr reason))))))
+      (lambda (reason)
+       (ecase (caddr reason)
+         (:super
+          (format
+           nil
+           "The class ~A appears in the supers of the class ~A."
+           (class-or-name (cadr reason))
+           (class-or-name (car reason))))
+         (:in-supers
+          (format
+           nil
+           "The class ~A follows the class ~A in the supers of the class ~A."
+           (class-or-name (cadr reason))
+           (class-or-name (car reason))
+           (class-or-name (cadddr reason))))))
       reasons)))
 
 (defun find-cycle-reasons (all-cpds)