From faf603f3a31f016be3ff8876dee60e63ca4c9a15 Mon Sep 17 00:00:00 2001 From: "Richard M. Stallman" Date: Tue, 1 Jun 1993 20:35:33 +0000 Subject: [PATCH] (sort-fold-case): New variable. (sort-subr): Bind case-fold-search from sort-fold-case. --- lisp/sort.el | 6 +++++- 1 file changed, 5 insertions(+), 1 deletion(-) diff --git a/lisp/sort.el b/lisp/sort.el index 0ee90121ae0..93c8f2171be 100644 --- a/lisp/sort.el +++ b/lisp/sort.el @@ -29,6 +29,9 @@ ;;; Code: +(defvar sort-fold-case nil + "*Non-nil if the buffer sort functions should ignore case.") + (defun sort-subr (reverse nextrecfun endrecfun &optional startkeyfun endkeyfun) "General text sorting routine to divide buffer into records and sort them. Arguments are REVERSE NEXTRECFUN ENDRECFUN &optional STARTKEYFUN ENDKEYFUN. @@ -69,7 +72,8 @@ same as ENDRECFUN." (if messages (message "Finding sort keys...")) (let* ((sort-lists (sort-build-lists nextrecfun endrecfun startkeyfun endkeyfun)) - (old (reverse sort-lists))) + (old (reverse sort-lists)) + (case-fold-search sort-fold-case)) (if (null sort-lists) () (or reverse (setq sort-lists (nreverse sort-lists)))