anchor.diff:      root))
   
   (defun sort-trie-branch (trie predicate &key (key #'trie-key) (stable nil))
  -  "Sort a trie node’s branches with a predicate function suitable for sorting."
  +  "Sort a trie node’s branches with a predicate function."
     (let ((branches (copy-list (trie-branches trie)))
           (sort (if stable #'stable-sort #'sort)))
       (setf (trie-branches trie)
  
positive.code:   "Trie data structure, see package documentation for more info."
    (key "" :read-only t)       ; Generic type -- could be :type char
    (width 0 :type integer)
    (branches nil :type list))  ; Could a vector for optimization, but complicates things!
  
  (defun test-trie (&optional (lst *banana*))
    "Simple utility function to build a test trie."
  
negative.code:       (let ((branches (pprint-pop)))
          (when branches
              (loop as branch in branches do
                (unless (equal compact (car branch))    ; Else previous level
                  (when *debug* (write :^))
                  (write-char #\Space)                  ; Space before branches
                  (unless (only-terminal-p trie)
  