Commit | Line | Data |
---|---|---|
c88ab9ce ER |
1 | ;;; sort.el --- commands to sort text in an Emacs buffer. |
2 | ||
f8c25f1b | 3 | ;; Copyright (C) 1986, 1987, 1994, 1995 Free Software Foundation, Inc. |
eea8d4ef | 4 | |
e5167999 ER |
5 | ;; Author: Howie Kaye |
6 | ;; Maintainer: FSF | |
d7b4d18f | 7 | ;; Keywords: unix |
e5167999 | 8 | |
d32200ac RS |
9 | ;; This file is part of GNU Emacs. |
10 | ||
11 | ;; GNU Emacs is free software; you can redistribute it and/or modify | |
12 | ;; it under the terms of the GNU General Public License as published by | |
e5167999 | 13 | ;; the Free Software Foundation; either version 2, or (at your option) |
d32200ac RS |
14 | ;; any later version. |
15 | ||
16 | ;; GNU Emacs is distributed in the hope that it will be useful, | |
17 | ;; but WITHOUT ANY WARRANTY; without even the implied warranty of | |
18 | ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
19 | ;; GNU General Public License for more details. | |
20 | ||
21 | ;; You should have received a copy of the GNU General Public License | |
b578f267 EN |
22 | ;; along with GNU Emacs; see the file COPYING. If not, write to the |
23 | ;; Free Software Foundation, Inc., 59 Temple Place - Suite 330, | |
24 | ;; Boston, MA 02111-1307, USA. | |
d32200ac | 25 | |
d9ecc911 ER |
26 | ;;; Commentary: |
27 | ||
b578f267 EN |
28 | ;; This package provides the sorting facilities documented in the Emacs |
29 | ;; user's manual. | |
d9ecc911 | 30 | |
e5167999 | 31 | ;;; Code: |
d32200ac | 32 | |
ab1c7f35 RS |
33 | (defgroup sort nil |
34 | "Commands to sort text in an Emacs buffer." | |
35 | :group 'data) | |
36 | ||
37 | (defcustom sort-fold-case nil | |
38 | "*Non-nil if the buffer sort functions should ignore case." | |
39 | :group 'sort | |
40 | :type 'boolean) | |
faf603f3 | 41 | |
32033024 | 42 | ;;;###autoload |
d32200ac RS |
43 | (defun sort-subr (reverse nextrecfun endrecfun &optional startkeyfun endkeyfun) |
44 | "General text sorting routine to divide buffer into records and sort them. | |
45 | Arguments are REVERSE NEXTRECFUN ENDRECFUN &optional STARTKEYFUN ENDKEYFUN. | |
46 | ||
a08caf95 | 47 | We divide the accessible portion of the buffer into disjoint pieces |
fbfed6f0 JB |
48 | called sort records. A portion of each sort record (perhaps all of |
49 | it) is designated as the sort key. The records are rearranged in the | |
50 | buffer in order by their sort keys. The records may or may not be | |
51 | contiguous. | |
d32200ac RS |
52 | |
53 | Usually the records are rearranged in order of ascending sort key. | |
54 | If REVERSE is non-nil, they are rearranged in order of descending sort key. | |
469b44cb RS |
55 | The variable `sort-fold-case' determines whether alphabetic case affects |
56 | the sort order. | |
d32200ac RS |
57 | |
58 | The next four arguments are functions to be called to move point | |
59 | across a sort record. They will be called many times from within sort-subr. | |
60 | ||
61 | NEXTRECFUN is called with point at the end of the previous record. | |
62 | It moves point to the start of the next record. | |
63 | It should move point to the end of the buffer if there are no more records. | |
64 | The first record is assumed to start at the position of point when sort-subr | |
65 | is called. | |
66 | ||
13f4b6b3 | 67 | ENDRECFUN is called with point within the record. |
d32200ac RS |
68 | It should move point to the end of the record. |
69 | ||
13f4b6b3 RS |
70 | STARTKEYFUN moves from the start of the record to the start of the key. |
71 | It may return either a non-nil value to be used as the key, or | |
a08caf95 | 72 | else the key is the substring between the values of point after |
d9a55d32 RS |
73 | STARTKEYFUN and ENDKEYFUN are called. If STARTKEYFUN is nil, the key |
74 | starts at the beginning of the record. | |
d32200ac RS |
75 | |
76 | ENDKEYFUN moves from the start of the sort key to the end of the sort key. | |
77 | ENDKEYFUN may be nil if STARTKEYFUN returns a value or if it would be the | |
78 | same as ENDRECFUN." | |
a08caf95 RS |
79 | ;; Heuristically try to avoid messages if sorting a small amt of text. |
80 | (let ((messages (> (- (point-max) (point-min)) 50000))) | |
81 | (save-excursion | |
82 | (if messages (message "Finding sort keys...")) | |
83 | (let* ((sort-lists (sort-build-lists nextrecfun endrecfun | |
84 | startkeyfun endkeyfun)) | |
faf603f3 RS |
85 | (old (reverse sort-lists)) |
86 | (case-fold-search sort-fold-case)) | |
a08caf95 RS |
87 | (if (null sort-lists) |
88 | () | |
89 | (or reverse (setq sort-lists (nreverse sort-lists))) | |
90 | (if messages (message "Sorting records...")) | |
91 | (setq sort-lists | |
92 | (if (fboundp 'sortcar) | |
93 | (sortcar sort-lists | |
94 | (cond ((numberp (car (car sort-lists))) | |
95 | ;; This handles both ints and floats. | |
96 | '<) | |
97 | ((consp (car (car sort-lists))) | |
4f1b6c54 RS |
98 | (function |
99 | (lambda (a b) | |
100 | (> 0 (compare-buffer-substrings | |
b5ff8004 RS |
101 | nil (car a) (cdr a) |
102 | nil (car b) (cdr b)))))) | |
a08caf95 RS |
103 | (t |
104 | 'string<))) | |
fbfed6f0 JB |
105 | (sort sort-lists |
106 | (cond ((numberp (car (car sort-lists))) | |
c71ff001 | 107 | 'car-less-than-car) |
fbfed6f0 JB |
108 | ((consp (car (car sort-lists))) |
109 | (function | |
110 | (lambda (a b) | |
4f1b6c54 | 111 | (> 0 (compare-buffer-substrings |
b5ff8004 RS |
112 | nil (car (car a)) (cdr (car a)) |
113 | nil (car (car b)) (cdr (car b))))))) | |
fbfed6f0 JB |
114 | (t |
115 | (function | |
116 | (lambda (a b) | |
117 | (string< (car a) (car b))))))))) | |
a08caf95 RS |
118 | (if reverse (setq sort-lists (nreverse sort-lists))) |
119 | (if messages (message "Reordering buffer...")) | |
120 | (sort-reorder-buffer sort-lists old))) | |
121 | (if messages (message "Reordering buffer... Done")))) | |
d32200ac RS |
122 | nil) |
123 | ||
124 | ;; Parse buffer into records using the arguments as Lisp expressions; | |
e453d35a | 125 | ;; return a list of records. Each record looks like (KEY STARTPOS . ENDPOS) |
d32200ac RS |
126 | ;; where KEY is the sort key (a number or string), |
127 | ;; and STARTPOS and ENDPOS are the bounds of this record in the buffer. | |
128 | ||
129 | ;; The records appear in the list lastmost first! | |
130 | ||
131 | (defun sort-build-lists (nextrecfun endrecfun startkeyfun endkeyfun) | |
132 | (let ((sort-lists ()) | |
133 | (start-rec nil) | |
134 | done key) | |
135 | ;; Loop over sort records. | |
136 | ;(goto-char (point-min)) -- it is the caller's responsibility to | |
137 | ;arrange this if necessary | |
138 | (while (not (eobp)) | |
139 | (setq start-rec (point)) ;save record start | |
140 | (setq done nil) | |
141 | ;; Get key value, or move to start of key. | |
142 | (setq key (catch 'key | |
143 | (or (and startkeyfun (funcall startkeyfun)) | |
144 | ;; If key was not returned as value, | |
145 | ;; move to end of key and get key from the buffer. | |
146 | (let ((start (point))) | |
147 | (funcall (or endkeyfun | |
148 | (prog1 endrecfun (setq done t)))) | |
4f1b6c54 | 149 | (cons start (point)))))) |
d32200ac RS |
150 | ;; Move to end of this record (start of next one, or end of buffer). |
151 | (cond ((prog1 done (setq done nil))) | |
152 | (endrecfun (funcall endrecfun)) | |
153 | (nextrecfun (funcall nextrecfun) (setq done t))) | |
154 | (if key (setq sort-lists (cons | |
155 | ;; consing optimization in case in which key | |
156 | ;; is same as record. | |
157 | (if (and (consp key) | |
158 | (equal (car key) start-rec) | |
159 | (equal (cdr key) (point))) | |
160 | (cons key key) | |
d9a55d32 RS |
161 | (cons key (cons start-rec (point)))) |
162 | sort-lists))) | |
d32200ac RS |
163 | (and (not done) nextrecfun (funcall nextrecfun))) |
164 | sort-lists)) | |
165 | ||
166 | (defun sort-reorder-buffer (sort-lists old) | |
167 | (let ((inhibit-quit t) | |
168 | (last (point-min)) | |
169 | (min (point-min)) (max (point-max))) | |
170 | ;; Make sure insertions done for reordering | |
171 | ;; do not go after any markers at the end of the sorted region, | |
172 | ;; by inserting a space to separate them. | |
173 | (goto-char (point-max)) | |
174 | (insert-before-markers " ") | |
175 | (narrow-to-region min (1- (point-max))) | |
176 | (while sort-lists | |
177 | (goto-char (point-max)) | |
178 | (insert-buffer-substring (current-buffer) | |
179 | last | |
180 | (nth 1 (car old))) | |
181 | (goto-char (point-max)) | |
182 | (insert-buffer-substring (current-buffer) | |
183 | (nth 1 (car sort-lists)) | |
d9a55d32 RS |
184 | (cdr (cdr (car sort-lists)))) |
185 | (setq last (cdr (cdr (car old))) | |
d32200ac RS |
186 | sort-lists (cdr sort-lists) |
187 | old (cdr old))) | |
188 | (goto-char (point-max)) | |
189 | (insert-buffer-substring (current-buffer) | |
190 | last | |
191 | max) | |
192 | ;; Delete the original copy of the text. | |
193 | (delete-region min max) | |
194 | ;; Get rid of the separator " ". | |
195 | (goto-char (point-max)) | |
196 | (narrow-to-region min (1+ (point))) | |
197 | (delete-region (point) (1+ (point))))) | |
198 | ||
f9f9507e | 199 | ;;;###autoload |
d32200ac RS |
200 | (defun sort-lines (reverse beg end) |
201 | "Sort lines in region alphabetically; argument means descending order. | |
202 | Called from a program, there are three arguments: | |
469b44cb RS |
203 | REVERSE (non-nil means reverse order), BEG and END (region to sort). |
204 | The variable `sort-fold-case' determines whether alphabetic case affects | |
205 | the sort order." | |
d32200ac RS |
206 | (interactive "P\nr") |
207 | (save-excursion | |
208 | (save-restriction | |
209 | (narrow-to-region beg end) | |
210 | (goto-char (point-min)) | |
211 | (sort-subr reverse 'forward-line 'end-of-line)))) | |
212 | ||
f9f9507e | 213 | ;;;###autoload |
d32200ac RS |
214 | (defun sort-paragraphs (reverse beg end) |
215 | "Sort paragraphs in region alphabetically; argument means descending order. | |
216 | Called from a program, there are three arguments: | |
469b44cb RS |
217 | REVERSE (non-nil means reverse order), BEG and END (region to sort). |
218 | The variable `sort-fold-case' determines whether alphabetic case affects | |
219 | the sort order." | |
d32200ac RS |
220 | (interactive "P\nr") |
221 | (save-excursion | |
222 | (save-restriction | |
223 | (narrow-to-region beg end) | |
224 | (goto-char (point-min)) | |
225 | (sort-subr reverse | |
ee5a3408 KH |
226 | (function |
227 | (lambda () | |
228 | (while (and (not (eobp)) (looking-at paragraph-separate)) | |
229 | (forward-line 1)))) | |
d32200ac RS |
230 | 'forward-paragraph)))) |
231 | ||
f9f9507e | 232 | ;;;###autoload |
d32200ac RS |
233 | (defun sort-pages (reverse beg end) |
234 | "Sort pages in region alphabetically; argument means descending order. | |
235 | Called from a program, there are three arguments: | |
469b44cb RS |
236 | REVERSE (non-nil means reverse order), BEG and END (region to sort). |
237 | The variable `sort-fold-case' determines whether alphabetic case affects | |
238 | the sort order." | |
d32200ac RS |
239 | (interactive "P\nr") |
240 | (save-excursion | |
241 | (save-restriction | |
242 | (narrow-to-region beg end) | |
243 | (goto-char (point-min)) | |
244 | (sort-subr reverse | |
245 | (function (lambda () (skip-chars-forward "\n"))) | |
246 | 'forward-page)))) | |
247 | \f | |
248 | (defvar sort-fields-syntax-table nil) | |
249 | (if sort-fields-syntax-table nil | |
250 | (let ((table (make-syntax-table)) | |
251 | (i 0)) | |
252 | (while (< i 256) | |
253 | (modify-syntax-entry i "w" table) | |
254 | (setq i (1+ i))) | |
255 | (modify-syntax-entry ?\ " " table) | |
256 | (modify-syntax-entry ?\t " " table) | |
257 | (modify-syntax-entry ?\n " " table) | |
258 | (modify-syntax-entry ?\. "_" table) ; for floating pt. numbers. -wsr | |
259 | (setq sort-fields-syntax-table table))) | |
260 | ||
f9f9507e | 261 | ;;;###autoload |
d32200ac RS |
262 | (defun sort-numeric-fields (field beg end) |
263 | "Sort lines in region numerically by the ARGth field of each line. | |
264 | Fields are separated by whitespace and numbered from 1 up. | |
265 | Specified field must contain a number in each line of the region. | |
2af3a0e3 | 266 | With a negative arg, sorts by the ARGth field counted from the right. |
d32200ac | 267 | Called from a program, there are three arguments: |
4138e600 | 268 | FIELD, BEG and END. BEG and END specify region to sort." |
d32200ac RS |
269 | (interactive "p\nr") |
270 | (sort-fields-1 field beg end | |
271 | (function (lambda () | |
220eb88b | 272 | (sort-skip-fields field) |
a4b13e10 | 273 | (string-to-number |
d32200ac RS |
274 | (buffer-substring |
275 | (point) | |
276 | (save-excursion | |
277 | ;; This is just wrong! Even without floats... | |
278 | ;; (skip-chars-forward "[0-9]") | |
279 | (forward-sexp 1) | |
280 | (point)))))) | |
281 | nil)) | |
282 | ||
4138e600 RS |
283 | ;;;;;###autoload |
284 | ;;(defun sort-float-fields (field beg end) | |
285 | ;; "Sort lines in region numerically by the ARGth field of each line. | |
286 | ;;Fields are separated by whitespace and numbered from 1 up. Specified field | |
287 | ;;must contain a floating point number in each line of the region. With a | |
288 | ;;negative arg, sorts by the ARGth field counted from the right. Called from a | |
289 | ;;program, there are three arguments: FIELD, BEG and END. BEG and END specify | |
290 | ;;region to sort." | |
291 | ;; (interactive "p\nr") | |
292 | ;; (sort-fields-1 field beg end | |
293 | ;; (function (lambda () | |
294 | ;; (sort-skip-fields field) | |
295 | ;; (string-to-number | |
296 | ;; (buffer-substring | |
297 | ;; (point) | |
298 | ;; (save-excursion | |
299 | ;; (re-search-forward | |
300 | ;; "[+-]?[0-9]*\.?[0-9]*\\([eE][+-]?[0-9]+\\)?") | |
301 | ;; (point)))))) | |
302 | ;; nil)) | |
2af3a0e3 | 303 | |
f9f9507e | 304 | ;;;###autoload |
d32200ac RS |
305 | (defun sort-fields (field beg end) |
306 | "Sort lines in region lexicographically by the ARGth field of each line. | |
307 | Fields are separated by whitespace and numbered from 1 up. | |
2af3a0e3 | 308 | With a negative arg, sorts by the ARGth field counted from the right. |
d32200ac | 309 | Called from a program, there are three arguments: |
469b44cb RS |
310 | FIELD, BEG and END. BEG and END specify region to sort. |
311 | The variable `sort-fold-case' determines whether alphabetic case affects | |
312 | the sort order." | |
d32200ac RS |
313 | (interactive "p\nr") |
314 | (sort-fields-1 field beg end | |
315 | (function (lambda () | |
220eb88b | 316 | (sort-skip-fields field) |
d32200ac RS |
317 | nil)) |
318 | (function (lambda () (skip-chars-forward "^ \t\n"))))) | |
319 | ||
320 | (defun sort-fields-1 (field beg end startkeyfun endkeyfun) | |
2af3a0e3 | 321 | (let ((tbl (syntax-table))) |
322 | (if (zerop field) (setq field 1)) | |
d32200ac RS |
323 | (unwind-protect |
324 | (save-excursion | |
325 | (save-restriction | |
326 | (narrow-to-region beg end) | |
327 | (goto-char (point-min)) | |
328 | (set-syntax-table sort-fields-syntax-table) | |
2af3a0e3 | 329 | (sort-subr nil |
d32200ac RS |
330 | 'forward-line 'end-of-line |
331 | startkeyfun endkeyfun))) | |
332 | (set-syntax-table tbl)))) | |
333 | ||
220eb88b RS |
334 | ;; Position at the beginning of field N on the current line, |
335 | ;; assuming point is initially at the beginning of the line. | |
d32200ac | 336 | (defun sort-skip-fields (n) |
220eb88b RS |
337 | (if (> n 0) |
338 | ;; Skip across N - 1 fields. | |
339 | (let ((i (1- n))) | |
340 | (while (> i 0) | |
341 | (skip-chars-forward " \t") | |
342 | (skip-chars-forward "^ \t\n") | |
343 | (setq i (1- i))) | |
344 | (skip-chars-forward " \t") | |
220eb88b RS |
345 | (if (eolp) |
346 | (error "Line has too few fields: %s" | |
347 | (buffer-substring | |
348 | (save-excursion (beginning-of-line) (point)) | |
349 | (save-excursion (end-of-line) (point)))))) | |
350 | (end-of-line) | |
351 | ;; Skip back across - N - 1 fields. | |
352 | (let ((i (1- (- n)))) | |
353 | (while (> i 0) | |
354 | (skip-chars-backward " \t") | |
355 | (skip-chars-backward "^ \t\n") | |
356 | (setq i (1- i))) | |
357 | (skip-chars-backward " \t")) | |
358 | (if (bolp) | |
d32200ac | 359 | (error "Line has too few fields: %s" |
220eb88b RS |
360 | (buffer-substring |
361 | (save-excursion (beginning-of-line) (point)) | |
362 | (save-excursion (end-of-line) (point))))) | |
363 | ;; Position at the front of the field | |
364 | ;; even if moving backwards. | |
365 | (skip-chars-backward "^ \t\n"))) | |
d32200ac | 366 | \f |
387f3b21 RS |
367 | (defvar sort-regexp-fields-regexp) |
368 | (defvar sort-regexp-record-end) | |
369 | ||
370 | ;; Move to the beginning of the next match for record-regexp, | |
371 | ;; and set sort-regexp-record-end to the end of that match. | |
372 | ;; If the next match is empty and does not advance point, | |
373 | ;; skip one character and try again. | |
374 | (defun sort-regexp-fields-next-record () | |
375 | (let ((oldpos (point))) | |
376 | (and (re-search-forward sort-regexp-fields-regexp nil 'move) | |
377 | (setq sort-regexp-record-end (match-end 0)) | |
378 | (if (= sort-regexp-record-end oldpos) | |
379 | (progn | |
380 | (forward-char 1) | |
381 | (re-search-forward sort-regexp-fields-regexp nil 'move) | |
382 | (setq sort-regexp-record-end (match-end 0))) | |
383 | t) | |
384 | (goto-char (match-beginning 0))))) | |
385 | ||
f9f9507e | 386 | ;;;###autoload |
d32200ac | 387 | (defun sort-regexp-fields (reverse record-regexp key-regexp beg end) |
eb8c3be9 | 388 | "Sort the region lexicographically as specified by RECORD-REGEXP and KEY. |
d32200ac RS |
389 | RECORD-REGEXP specifies the textual units which should be sorted. |
390 | For example, to sort lines RECORD-REGEXP would be \"^.*$\" | |
391 | KEY specifies the part of each record (ie each match for RECORD-REGEXP) | |
392 | is to be used for sorting. | |
8e5b59e1 | 393 | If it is \"\\\\digit\" then the digit'th \"\\\\(...\\\\)\" match field from |
d32200ac | 394 | RECORD-REGEXP is used. |
8e5b59e1 | 395 | If it is \"\\\\&\" then the whole record is used. |
d32200ac RS |
396 | Otherwise, it is a regular-expression for which to search within the record. |
397 | If a match for KEY is not found within a record then that record is ignored. | |
398 | ||
399 | With a negative prefix arg sorts in reverse order. | |
400 | ||
469b44cb RS |
401 | The variable `sort-fold-case' determines whether alphabetic case affects |
402 | the sort order. | |
403 | ||
d32200ac RS |
404 | For example: to sort lines in the region by the first word on each line |
405 | starting with the letter \"f\", | |
8e5b59e1 | 406 | RECORD-REGEXP would be \"^.*$\" and KEY would be \"\\\\=\\<f\\\\w*\\\\>\"" |
2af3a0e3 | 407 | ;; using negative prefix arg to mean "reverse" is now inconsistent with |
408 | ;; other sort-.*fields functions but then again this was before, since it | |
409 | ;; didn't use the magnitude of the arg to specify anything. | |
d32200ac RS |
410 | (interactive "P\nsRegexp specifying records to sort: |
411 | sRegexp specifying key within record: \nr") | |
412 | (cond ((or (equal key-regexp "") (equal key-regexp "\\&")) | |
413 | (setq key-regexp 0)) | |
414 | ((string-match "\\`\\\\[1-9]\\'" key-regexp) | |
415 | (setq key-regexp (- (aref key-regexp 1) ?0)))) | |
416 | (save-excursion | |
417 | (save-restriction | |
418 | (narrow-to-region beg end) | |
419 | (goto-char (point-min)) | |
387f3b21 RS |
420 | (let (sort-regexp-record-end |
421 | (sort-regexp-fields-regexp record-regexp)) | |
422 | (re-search-forward sort-regexp-fields-regexp) | |
d32200ac RS |
423 | (setq sort-regexp-record-end (point)) |
424 | (goto-char (match-beginning 0)) | |
425 | (sort-subr reverse | |
387f3b21 | 426 | 'sort-regexp-fields-next-record |
d32200ac RS |
427 | (function (lambda () |
428 | (goto-char sort-regexp-record-end))) | |
429 | (function (lambda () | |
430 | (let ((n 0)) | |
431 | (cond ((numberp key-regexp) | |
432 | (setq n key-regexp)) | |
433 | ((re-search-forward | |
434 | key-regexp sort-regexp-record-end t) | |
435 | (setq n 0)) | |
436 | (t (throw 'key nil))) | |
437 | (condition-case () | |
469b44cb RS |
438 | (cons (match-beginning n) |
439 | (match-end n)) | |
d32200ac RS |
440 | ;; if there was no such register |
441 | (error (throw 'key nil))))))))))) | |
442 | ||
443 | \f | |
444 | (defvar sort-columns-subprocess t) | |
445 | ||
f9f9507e | 446 | ;;;###autoload |
d32200ac RS |
447 | (defun sort-columns (reverse &optional beg end) |
448 | "Sort lines in region alphabetically by a certain range of columns. | |
449 | For the purpose of this command, the region includes | |
450 | the entire line that point is in and the entire line the mark is in. | |
451 | The column positions of point and mark bound the range of columns to sort on. | |
452 | A prefix argument means sort into reverse order. | |
469b44cb RS |
453 | The variable `sort-fold-case' determines whether alphabetic case affects |
454 | the sort order. | |
d32200ac RS |
455 | |
456 | Note that `sort-columns' rejects text that contains tabs, | |
457 | because tabs could be split across the specified columns | |
458 | and it doesn't know how to handle that. Also, when possible, | |
459 | it uses the `sort' utility program, which doesn't understand tabs. | |
460 | Use \\[untabify] to convert tabs to spaces before sorting." | |
461 | (interactive "P\nr") | |
462 | (save-excursion | |
463 | (let (beg1 end1 col-beg1 col-end1 col-start col-end) | |
464 | (goto-char (min beg end)) | |
465 | (setq col-beg1 (current-column)) | |
466 | (beginning-of-line) | |
467 | (setq beg1 (point)) | |
468 | (goto-char (max beg end)) | |
469 | (setq col-end1 (current-column)) | |
470 | (forward-line) | |
471 | (setq end1 (point)) | |
472 | (setq col-start (min col-beg1 col-end1)) | |
473 | (setq col-end (max col-beg1 col-end1)) | |
474 | (if (search-backward "\t" beg1 t) | |
475 | (error "sort-columns does not work with tabs. Use M-x untabify.")) | |
c08fe8fd RS |
476 | (if (not (or (eq system-type 'vax-vms) |
477 | (text-properties-at beg1) | |
478 | (< (next-property-change beg1 nil end1) end1))) | |
d32200ac | 479 | ;; Use the sort utility if we can; it is 4 times as fast. |
c08fe8fd RS |
480 | ;; Do not use it if there are any properties in the region, |
481 | ;; since the sort utility would lose the properties. | |
d32200ac RS |
482 | (call-process-region beg1 end1 "sort" t t nil |
483 | (if reverse "-rt\n" "-t\n") | |
484 | (concat "+0." col-start) | |
485 | (concat "-0." col-end)) | |
486 | ;; On VMS, use Emacs's own facilities. | |
487 | (save-excursion | |
488 | (save-restriction | |
489 | (narrow-to-region beg1 end1) | |
490 | (goto-char beg1) | |
491 | (sort-subr reverse 'forward-line 'end-of-line | |
492 | (function (lambda () (move-to-column col-start) nil)) | |
493 | (function (lambda () (move-to-column col-end) nil))))))))) | |
2af3a0e3 | 494 | |
f9f9507e | 495 | ;;;###autoload |
2af3a0e3 | 496 | (defun reverse-region (beg end) |
497 | "Reverse the order of lines in a region. | |
498 | From a program takes two point or marker arguments, BEG and END." | |
499 | (interactive "r") | |
500 | (if (> beg end) | |
501 | (let (mid) (setq mid end end beg beg mid))) | |
502 | (save-excursion | |
503 | ;; put beg at the start of a line and end and the end of one -- | |
504 | ;; the largest possible region which fits this criteria | |
505 | (goto-char beg) | |
506 | (or (bolp) (forward-line 1)) | |
507 | (setq beg (point)) | |
508 | (goto-char end) | |
509 | ;; the test for bolp is for those times when end is on an empty line; | |
510 | ;; it is probably not the case that the line should be included in the | |
511 | ;; reversal; it isn't difficult to add it afterward. | |
512 | (or (and (eolp) (not (bolp))) (progn (forward-line -1) (end-of-line))) | |
513 | (setq end (point-marker)) | |
514 | ;; the real work. this thing cranks through memory on large regions. | |
515 | (let (ll (do t)) | |
516 | (while do | |
517 | (goto-char beg) | |
518 | (setq ll (cons (buffer-substring (point) (progn (end-of-line) (point))) | |
519 | ll)) | |
520 | (setq do (/= (point) end)) | |
521 | (delete-region beg (if do (1+ (point)) (point)))) | |
522 | (while (cdr ll) | |
523 | (insert (car ll) "\n") | |
524 | (setq ll (cdr ll))) | |
525 | (insert (car ll))))) | |
49116ac0 JB |
526 | |
527 | (provide 'sort) | |
528 | ||
c88ab9ce | 529 | ;;; sort.el ends here |