#+begin_src elisp (require 'radix-tree) (defun my-compare-string-arrays (xs1 start1 end1 xs2 start2 end2) (let* ((i 0) (s1 (or start1 0)) (e1 (or end1 (length xs1))) (s2 (or start2 0)) (e2 (or end2 (length xs2))) (l1 (- e1 s1)) (l2 (- e2 s2)) (cmp t)) (while (and (< i l1) (< i l2) (eq t cmp)) (setq cmp (compare-strings (elt xs1 (+ s1 i)) nil nil (elt xs2 (+ s2 i)) nil nil)) (setq i (1+ i))) (cond ((and (numberp cmp) (< cmp 0)) (- i)) ((and (numberp cmp) (> cmp 0)) i) ((= l1 l2) t) ((< l1 l2) (- i)) (t i)))) (defun my-radix-tree-from-list () (goto-char (point-min)) (let ((result radix-tree-empty) (radix-tree-compare-function 'my-compare-string-arrays)) (while (not (eobp)) (let ((line (vconcat (split-string (buffer-substring-no-properties (point) (progn (forward-line 1) (1- (point)))) "/")))) (setq result (radix-tree-insert result line t)))) result)) (defun my-kill-radix-tree-from-list () (interactive) (let ((max-lisp-eval-depth 8000)) (kill-new (pp (my-radix-tree-from-list))))) #+end_src Best, Yuchen -- PGP Key: 47F9 D050 1E11 8879 9040 4941 2126 7E93 EF86 DFD0