anchor.diff:    (: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))
  
positive.code: (defgeneric (setf object-name) (new-value object))
  
  (defclass associative-object ()
    ((name
      :accessor object-name
      :type symbol
      :initarg :name))
    (:documentation
     "Analogy of an associatve list element, onto CLOS"))
  
  (defmethod print-name ((object associative-object) (stream stream))
    (princ (object-name object) stream))
  
negative.code:       (print-name object s)))
    (:method ((object string))
      (values object))
    (:method ((object package)) ;; NB: Simple package name form
      (package-name object))
    (:method ((object symbol))
      (with-output-to-string (s)
  