anchor.diff:        ; 3. If width is 0, remove node into new trie to be returned.
         (when (equal 0 (trie-width node))
           (remove-node node key)))))
  -
  -; (defun remove-key-broken (trie key)
  -;   "###"
  -;   (let ((node (find-key trie key))
  -;       (branches (trie-branches trie)))
  -;     (when node
  -;       (decf (trie-width node)) ; FIXME
  -;       (when (<= 0 trie-width node)
  -;         (setf branches (remove-if #'(lambda (x) (equal x key)) branches))))))
  -
   
   ; (defun remove-seq (trie seq &optional (count 1))
   ;   "### Remove a sequence from trie"
  
positive.code: ;;; Sorting
  
  (defun sort-trie (trie predicate &key (key #'trie-key) (stable nil))
    "Sort a trie recursively with a predicate function suitable for sorting."
    (let ((root trie))
      (sort-trie-branch root predicate :key key :stable stable)
      (unless (leafp trie)
  
negative.code: ;;; -*- Mode: Lisp; Syntax: Common-Lisp; Package: ptrie -*-
  ;;;
  ;;; -------------------------------------------------------------------------
  ;;; P-TRIE - probability trie (with branch widths)
  ;;; -------------------------------------------------------------------------
  ;;;
  ;;; Author:
  ;;;   Peter Hillerström
  