anchor.diff:  (defgeneric (setf object-name) (new-value object))
   
   (defclass associative-object ()
  +  ;; FIXME - used in AFFTA, may be of some limited use in any "elsewhere"
  +  ;;
  +  ;; see also: ../mop/aclass.lisp
     ((name
       :accessor object-name
       :type symbol
  +    ;; ED. NB: Note that this proposes a slot with type SYMBOL as an "Index Key" slot
       :initarg :name))
  -  (:documentation
  -   "Analogy of an associatve list element, onto CLOS"))
  +  (:documentation "Prototype"))
  +
  +;; Ed. NB: These generalized methods were defined to use PRINC, in lieu
  +;; of making nested calls to PRINT-NAME or PRINT-LABEL for an object-name
  +;; known to be of type SYMBOL (FIXME: Cheap decision)
   
   (defmethod print-name ((object associative-object) (stream stream))
     (princ (object-name object) stream))
  
positive.code: 	(cond
  	  (keyword-p
  	   (write-char #\: stream))
  	  (pkg (princ (object-print-name pkg) stream))
  	  (t (write-char #\# stream)
  	     (write-char #\: stream)))
  
negative.code:   (:method ((object string))
      (values object))
    (:method ((object package))
      ;; NB return the shortest string from the set of the package name
      ;; and any pacakge nicknames.
      ;;
      ;; In an estimate that that would typically comprise a short set,
      ;; this methodology produces some "Consing," for using a simple
      ;; "Sort a List" form, rather than developing any more per se
      ;; tedious iteration for computing the shortest string.
      (let ((name (package-name object))
  	  (nicknames (package-nicknames object)))
        (car (sort (cons name (copy-list nicknames))
  