From 91fc05b1ae036442400f51ba8a492cb91001e3e2 Mon Sep 17 00:00:00 2001 From: Stefan Monnier Date: Tue, 18 Jun 2002 21:52:42 +0000 Subject: [PATCH] (regexp-opt-group): Don't cons uselessly. --- lisp/emacs-lisp/regexp-opt.el | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/lisp/emacs-lisp/regexp-opt.el b/lisp/emacs-lisp/regexp-opt.el index e46ad2ca3e5..b746c8a22f3 100644 --- a/lisp/emacs-lisp/regexp-opt.el +++ b/lisp/emacs-lisp/regexp-opt.el @@ -192,7 +192,7 @@ so we can use character sets rather than grouping parenthesis." ;; ;; We have a list of different length strings. (t - (let ((prefix (try-completion "" (mapcar 'list strings)))) + (let ((prefix (try-completion "" strings))) (if (> (length prefix) 0) ;; common prefix: take it and recurse on the suffixes. (let* ((n (length prefix)) @@ -205,7 +205,7 @@ so we can use character sets rather than grouping parenthesis." (let* ((sgnirts (mapcar (lambda (s) (concat (nreverse (string-to-list s)))) strings)) - (xiffus (try-completion "" (mapcar 'list sgnirts)))) + (xiffus (try-completion "" sgnirts))) (if (> (length xiffus) 0) ;; common suffix: take it and recurse on the prefixes. (let* ((n (- (length xiffus))) @@ -222,7 +222,7 @@ so we can use character sets rather than grouping parenthesis." ;; Otherwise, divide the list into those that start with a ;; particular letter and those that do not, and recurse on them. (let* ((char (char-to-string (string-to-char (car strings)))) - (half1 (all-completions char (mapcar 'list strings))) + (half1 (all-completions char strings)) (half2 (nthcdr (length half1) strings))) (concat open-group (regexp-opt-group half1) -- 2.11.4.GIT