summaryrefslogtreecommitdiff
path: root/lisp/char-fold.el
diff options
context:
space:
mode:
authorPaul Eggert <eggert@cs.ucla.edu>2017-11-25 22:45:41 -0800
committerPaul Eggert <eggert@cs.ucla.edu>2017-11-25 22:48:12 -0800
commita89f0b6f33f9eb8910a1fceda9028d76ef50b05d (patch)
tree7055882872b7cad587e5d5e9ac706056f04ff777 /lisp/char-fold.el
parent8be3aee2813f528b02bc913ca4d79e34e72b1754 (diff)
downloademacs-a89f0b6f33f9eb8910a1fceda9028d76ef50b05d.tar.gz
maint: shorten https://lists.gnu.org/archive/html/... links
Diffstat (limited to 'lisp/char-fold.el')
-rw-r--r--lisp/char-fold.el2
1 files changed, 1 insertions, 1 deletions
diff --git a/lisp/char-fold.el b/lisp/char-fold.el
index 18ce5bea4f6..b24363530f3 100644
--- a/lisp/char-fold.el
+++ b/lisp/char-fold.el
@@ -196,7 +196,7 @@ from which to start."
;;; If N suffixes match, we "branch" out into N+1 executions for the
;;; length of the longest match. This means "fix" will match "fix" but
;;; not "fⅸ", but it's necessary to keep the regexp size from scaling
-;;; exponentially. See https://lists.gnu.org/archive/html/emacs-devel/2015-11/msg02562.html
+;;; exponentially. See https://lists.gnu.org/r/emacs-devel/2015-11/msg02562.html
(let ((subs (substring string (1+ i) (+ i 1 max-length))))
;; `i' is still going to inc by 1 below.
(setq i (+ i max-length))