Mercurial > emacs
annotate lisp/sort.el @ 2813:89b1121e2d43
* timer.c: Fix mispellings of get_date function's name.
author | Jim Blandy <jimb@redhat.com> |
---|---|
date | Sat, 15 May 1993 23:05:46 +0000 |
parents | 9e7ec92a4fdf |
children | 09bba81c038f |
rev | line source |
---|---|
658
7cbd4fcd8b0f
*** empty log message ***
Eric S. Raymond <esr@snark.thyrsus.com>
parents:
584
diff
changeset
|
1 ;;; sort.el --- commands to sort text in an Emacs buffer. |
7cbd4fcd8b0f
*** empty log message ***
Eric S. Raymond <esr@snark.thyrsus.com>
parents:
584
diff
changeset
|
2 |
840
113281b361ec
*** empty log message ***
Eric S. Raymond <esr@snark.thyrsus.com>
parents:
814
diff
changeset
|
3 ;; Copyright (C) 1986, 1987 Free Software Foundation, Inc. |
113281b361ec
*** empty log message ***
Eric S. Raymond <esr@snark.thyrsus.com>
parents:
814
diff
changeset
|
4 |
807
4f28bd14272c
*** empty log message ***
Eric S. Raymond <esr@snark.thyrsus.com>
parents:
658
diff
changeset
|
5 ;; Author: Howie Kaye |
4f28bd14272c
*** empty log message ***
Eric S. Raymond <esr@snark.thyrsus.com>
parents:
658
diff
changeset
|
6 ;; Maintainer: FSF |
814
38b2499cb3e9
*** empty log message ***
Eric S. Raymond <esr@snark.thyrsus.com>
parents:
807
diff
changeset
|
7 ;; Keywords: unix |
807
4f28bd14272c
*** empty log message ***
Eric S. Raymond <esr@snark.thyrsus.com>
parents:
658
diff
changeset
|
8 |
70 | 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 | |
807
4f28bd14272c
*** empty log message ***
Eric S. Raymond <esr@snark.thyrsus.com>
parents:
658
diff
changeset
|
13 ;; the Free Software Foundation; either version 2, or (at your option) |
70 | 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 | |
22 ;; along with GNU Emacs; see the file COPYING. If not, write to | |
23 ;; the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. | |
24 | |
2315
9e7ec92a4fdf
Added or corrected Commentary headers
Eric S. Raymond <esr@snark.thyrsus.com>
parents:
2185
diff
changeset
|
25 ;;; Commentary: |
9e7ec92a4fdf
Added or corrected Commentary headers
Eric S. Raymond <esr@snark.thyrsus.com>
parents:
2185
diff
changeset
|
26 |
9e7ec92a4fdf
Added or corrected Commentary headers
Eric S. Raymond <esr@snark.thyrsus.com>
parents:
2185
diff
changeset
|
27 ;;; This package provides the sorting facilities documented in the Emacs |
9e7ec92a4fdf
Added or corrected Commentary headers
Eric S. Raymond <esr@snark.thyrsus.com>
parents:
2185
diff
changeset
|
28 ;;; user's manual. |
9e7ec92a4fdf
Added or corrected Commentary headers
Eric S. Raymond <esr@snark.thyrsus.com>
parents:
2185
diff
changeset
|
29 |
807
4f28bd14272c
*** empty log message ***
Eric S. Raymond <esr@snark.thyrsus.com>
parents:
658
diff
changeset
|
30 ;;; Code: |
70 | 31 |
32 (defun sort-subr (reverse nextrecfun endrecfun &optional startkeyfun endkeyfun) | |
33 "General text sorting routine to divide buffer into records and sort them. | |
34 Arguments are REVERSE NEXTRECFUN ENDRECFUN &optional STARTKEYFUN ENDKEYFUN. | |
35 | |
996
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
36 We divide the accessible portion of the buffer into disjoint pieces |
998 | 37 called sort records. A portion of each sort record (perhaps all of |
38 it) is designated as the sort key. The records are rearranged in the | |
39 buffer in order by their sort keys. The records may or may not be | |
40 contiguous. | |
70 | 41 |
42 Usually the records are rearranged in order of ascending sort key. | |
43 If REVERSE is non-nil, they are rearranged in order of descending sort key. | |
44 | |
45 The next four arguments are functions to be called to move point | |
46 across a sort record. They will be called many times from within sort-subr. | |
47 | |
48 NEXTRECFUN is called with point at the end of the previous record. | |
49 It moves point to the start of the next record. | |
50 It should move point to the end of the buffer if there are no more records. | |
51 The first record is assumed to start at the position of point when sort-subr | |
52 is called. | |
53 | |
1836 | 54 ENDRECFUN is called with point within the record. |
70 | 55 It should move point to the end of the record. |
56 | |
1836 | 57 STARTKEYFUN moves from the start of the record to the start of the key. |
58 It may return either a non-nil value to be used as the key, or | |
996
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
59 else the key is the substring between the values of point after |
135 | 60 STARTKEYFUN and ENDKEYFUN are called. If STARTKEYFUN is nil, the key |
61 starts at the beginning of the record. | |
70 | 62 |
63 ENDKEYFUN moves from the start of the sort key to the end of the sort key. | |
64 ENDKEYFUN may be nil if STARTKEYFUN returns a value or if it would be the | |
65 same as ENDRECFUN." | |
996
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
66 ;; Heuristically try to avoid messages if sorting a small amt of text. |
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
67 (let ((messages (> (- (point-max) (point-min)) 50000))) |
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
68 (save-excursion |
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
69 (if messages (message "Finding sort keys...")) |
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
70 (let* ((sort-lists (sort-build-lists nextrecfun endrecfun |
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
71 startkeyfun endkeyfun)) |
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
72 (old (reverse sort-lists))) |
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
73 (if (null sort-lists) |
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
74 () |
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
75 (or reverse (setq sort-lists (nreverse sort-lists))) |
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
76 (if messages (message "Sorting records...")) |
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
77 (setq sort-lists |
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
78 (if (fboundp 'sortcar) |
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
79 (sortcar sort-lists |
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
80 (cond ((numberp (car (car sort-lists))) |
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
81 ;; This handles both ints and floats. |
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
82 '<) |
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
83 ((consp (car (car sort-lists))) |
1844
d48f094be56e
(sort-build-lists): Record the key as pair of positions;
Richard M. Stallman <rms@gnu.org>
parents:
1836
diff
changeset
|
84 (function |
d48f094be56e
(sort-build-lists): Record the key as pair of positions;
Richard M. Stallman <rms@gnu.org>
parents:
1836
diff
changeset
|
85 (lambda (a b) |
d48f094be56e
(sort-build-lists): Record the key as pair of positions;
Richard M. Stallman <rms@gnu.org>
parents:
1836
diff
changeset
|
86 (> 0 (compare-buffer-substrings |
1845
aeb1a834481b
(sort-subr): Fix previous change.
Richard M. Stallman <rms@gnu.org>
parents:
1844
diff
changeset
|
87 nil (car a) (cdr a) |
aeb1a834481b
(sort-subr): Fix previous change.
Richard M. Stallman <rms@gnu.org>
parents:
1844
diff
changeset
|
88 nil (car b) (cdr b)))))) |
996
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
89 (t |
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
90 'string<))) |
998 | 91 (sort sort-lists |
92 (cond ((numberp (car (car sort-lists))) | |
93 (function | |
94 (lambda (a b) | |
95 (< (car a) (car b))))) | |
96 ((consp (car (car sort-lists))) | |
97 (function | |
98 (lambda (a b) | |
1844
d48f094be56e
(sort-build-lists): Record the key as pair of positions;
Richard M. Stallman <rms@gnu.org>
parents:
1836
diff
changeset
|
99 (> 0 (compare-buffer-substrings |
1845
aeb1a834481b
(sort-subr): Fix previous change.
Richard M. Stallman <rms@gnu.org>
parents:
1844
diff
changeset
|
100 nil (car (car a)) (cdr (car a)) |
aeb1a834481b
(sort-subr): Fix previous change.
Richard M. Stallman <rms@gnu.org>
parents:
1844
diff
changeset
|
101 nil (car (car b)) (cdr (car b))))))) |
998 | 102 (t |
103 (function | |
104 (lambda (a b) | |
105 (string< (car a) (car b))))))))) | |
996
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
106 (if reverse (setq sort-lists (nreverse sort-lists))) |
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
107 (if messages (message "Reordering buffer...")) |
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
108 (sort-reorder-buffer sort-lists old))) |
0e8ace07a231
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
840
diff
changeset
|
109 (if messages (message "Reordering buffer... Done")))) |
70 | 110 nil) |
111 | |
112 ;; Parse buffer into records using the arguments as Lisp expressions; | |
136 | 113 ;; return a list of records. Each record looks like (KEY STARTPOS . ENDPOS) |
70 | 114 ;; where KEY is the sort key (a number or string), |
115 ;; and STARTPOS and ENDPOS are the bounds of this record in the buffer. | |
116 | |
117 ;; The records appear in the list lastmost first! | |
118 | |
119 (defun sort-build-lists (nextrecfun endrecfun startkeyfun endkeyfun) | |
120 (let ((sort-lists ()) | |
121 (start-rec nil) | |
122 done key) | |
123 ;; Loop over sort records. | |
124 ;(goto-char (point-min)) -- it is the caller's responsibility to | |
125 ;arrange this if necessary | |
126 (while (not (eobp)) | |
127 (setq start-rec (point)) ;save record start | |
128 (setq done nil) | |
129 ;; Get key value, or move to start of key. | |
130 (setq key (catch 'key | |
131 (or (and startkeyfun (funcall startkeyfun)) | |
132 ;; If key was not returned as value, | |
133 ;; move to end of key and get key from the buffer. | |
134 (let ((start (point))) | |
135 (funcall (or endkeyfun | |
136 (prog1 endrecfun (setq done t)))) | |
1844
d48f094be56e
(sort-build-lists): Record the key as pair of positions;
Richard M. Stallman <rms@gnu.org>
parents:
1836
diff
changeset
|
137 (cons start (point)))))) |
70 | 138 ;; Move to end of this record (start of next one, or end of buffer). |
139 (cond ((prog1 done (setq done nil))) | |
140 (endrecfun (funcall endrecfun)) | |
141 (nextrecfun (funcall nextrecfun) (setq done t))) | |
142 (if key (setq sort-lists (cons | |
143 ;; consing optimization in case in which key | |
144 ;; is same as record. | |
145 (if (and (consp key) | |
146 (equal (car key) start-rec) | |
147 (equal (cdr key) (point))) | |
148 (cons key key) | |
135 | 149 (cons key (cons start-rec (point)))) |
150 sort-lists))) | |
70 | 151 (and (not done) nextrecfun (funcall nextrecfun))) |
152 sort-lists)) | |
153 | |
154 (defun sort-reorder-buffer (sort-lists old) | |
155 (let ((inhibit-quit t) | |
156 (last (point-min)) | |
157 (min (point-min)) (max (point-max))) | |
158 ;; Make sure insertions done for reordering | |
159 ;; do not go after any markers at the end of the sorted region, | |
160 ;; by inserting a space to separate them. | |
161 (goto-char (point-max)) | |
162 (insert-before-markers " ") | |
163 (narrow-to-region min (1- (point-max))) | |
164 (while sort-lists | |
165 (goto-char (point-max)) | |
166 (insert-buffer-substring (current-buffer) | |
167 last | |
168 (nth 1 (car old))) | |
169 (goto-char (point-max)) | |
170 (insert-buffer-substring (current-buffer) | |
171 (nth 1 (car sort-lists)) | |
135 | 172 (cdr (cdr (car sort-lists)))) |
173 (setq last (cdr (cdr (car old))) | |
70 | 174 sort-lists (cdr sort-lists) |
175 old (cdr old))) | |
176 (goto-char (point-max)) | |
177 (insert-buffer-substring (current-buffer) | |
178 last | |
179 max) | |
180 ;; Delete the original copy of the text. | |
181 (delete-region min max) | |
182 ;; Get rid of the separator " ". | |
183 (goto-char (point-max)) | |
184 (narrow-to-region min (1+ (point))) | |
185 (delete-region (point) (1+ (point))))) | |
186 | |
258 | 187 ;;;###autoload |
70 | 188 (defun sort-lines (reverse beg end) |
189 "Sort lines in region alphabetically; argument means descending order. | |
190 Called from a program, there are three arguments: | |
191 REVERSE (non-nil means reverse order), BEG and END (region to sort)." | |
192 (interactive "P\nr") | |
193 (save-excursion | |
194 (save-restriction | |
195 (narrow-to-region beg end) | |
196 (goto-char (point-min)) | |
197 (sort-subr reverse 'forward-line 'end-of-line)))) | |
198 | |
258 | 199 ;;;###autoload |
70 | 200 (defun sort-paragraphs (reverse beg end) |
201 "Sort paragraphs in region alphabetically; argument means descending order. | |
202 Called from a program, there are three arguments: | |
203 REVERSE (non-nil means reverse order), BEG and END (region to sort)." | |
204 (interactive "P\nr") | |
205 (save-excursion | |
206 (save-restriction | |
207 (narrow-to-region beg end) | |
208 (goto-char (point-min)) | |
209 (sort-subr reverse | |
210 (function (lambda () (skip-chars-forward "\n \t\f"))) | |
211 'forward-paragraph)))) | |
212 | |
258 | 213 ;;;###autoload |
70 | 214 (defun sort-pages (reverse beg end) |
215 "Sort pages in region alphabetically; argument means descending order. | |
216 Called from a program, there are three arguments: | |
217 REVERSE (non-nil means reverse order), BEG and END (region to sort)." | |
218 (interactive "P\nr") | |
219 (save-excursion | |
220 (save-restriction | |
221 (narrow-to-region beg end) | |
222 (goto-char (point-min)) | |
223 (sort-subr reverse | |
224 (function (lambda () (skip-chars-forward "\n"))) | |
225 'forward-page)))) | |
226 | |
227 (defvar sort-fields-syntax-table nil) | |
228 (if sort-fields-syntax-table nil | |
229 (let ((table (make-syntax-table)) | |
230 (i 0)) | |
231 (while (< i 256) | |
232 (modify-syntax-entry i "w" table) | |
233 (setq i (1+ i))) | |
234 (modify-syntax-entry ?\ " " table) | |
235 (modify-syntax-entry ?\t " " table) | |
236 (modify-syntax-entry ?\n " " table) | |
237 (modify-syntax-entry ?\. "_" table) ; for floating pt. numbers. -wsr | |
238 (setq sort-fields-syntax-table table))) | |
239 | |
258 | 240 ;;;###autoload |
70 | 241 (defun sort-numeric-fields (field beg end) |
242 "Sort lines in region numerically by the ARGth field of each line. | |
243 Fields are separated by whitespace and numbered from 1 up. | |
244 Specified field must contain a number in each line of the region. | |
86 | 245 With a negative arg, sorts by the ARGth field counted from the right. |
70 | 246 Called from a program, there are three arguments: |
2185
5bf3a379d7b5
* sort.el (sort-float-fields, sort-numeric-fields): Use
Jim Blandy <jimb@redhat.com>
parents:
2184
diff
changeset
|
247 FIELD, BEG and END. BEG and END specify region to sort. |
5bf3a379d7b5
* sort.el (sort-float-fields, sort-numeric-fields): Use
Jim Blandy <jimb@redhat.com>
parents:
2184
diff
changeset
|
248 If you want to sort floating-point numbers, try `sort-float-fields'." |
70 | 249 (interactive "p\nr") |
250 (sort-fields-1 field beg end | |
251 (function (lambda () | |
252 (sort-skip-fields (1- field)) | |
2185
5bf3a379d7b5
* sort.el (sort-float-fields, sort-numeric-fields): Use
Jim Blandy <jimb@redhat.com>
parents:
2184
diff
changeset
|
253 (string-to-number |
70 | 254 (buffer-substring |
255 (point) | |
256 (save-excursion | |
257 ;; This is just wrong! Even without floats... | |
258 ;; (skip-chars-forward "[0-9]") | |
259 (forward-sexp 1) | |
260 (point)))))) | |
261 nil)) | |
262 | |
2185
5bf3a379d7b5
* sort.el (sort-float-fields, sort-numeric-fields): Use
Jim Blandy <jimb@redhat.com>
parents:
2184
diff
changeset
|
263 ;;;###autoload |
86 | 264 (defun sort-float-fields (field beg end) |
265 "Sort lines in region numerically by the ARGth field of each line. | |
266 Fields are separated by whitespace and numbered from 1 up. Specified field | |
267 must contain a floating point number in each line of the region. With a | |
268 negative arg, sorts by the ARGth field counted from the right. Called from a | |
269 program, there are three arguments: FIELD, BEG and END. BEG and END specify | |
270 region to sort." | |
271 (interactive "p\nr") | |
272 (sort-fields-1 field beg end | |
273 (function (lambda () | |
274 (sort-skip-fields (1- field)) | |
2184
2b5d701915fe
* sort.el (sort-float-fields): Use string-to-number, not
Jim Blandy <jimb@redhat.com>
parents:
1845
diff
changeset
|
275 (string-to-number |
86 | 276 (buffer-substring |
277 (point) | |
278 (save-excursion | |
279 (re-search-forward | |
280 "[+-]?[0-9]*\.?[0-9]*\\([eE][+-]?[0-9]+\\)?") | |
281 (point)))))) | |
282 nil)) | |
283 | |
258 | 284 ;;;###autoload |
70 | 285 (defun sort-fields (field beg end) |
286 "Sort lines in region lexicographically by the ARGth field of each line. | |
287 Fields are separated by whitespace and numbered from 1 up. | |
86 | 288 With a negative arg, sorts by the ARGth field counted from the right. |
70 | 289 Called from a program, there are three arguments: |
290 FIELD, BEG and END. BEG and END specify region to sort." | |
291 (interactive "p\nr") | |
292 (sort-fields-1 field beg end | |
293 (function (lambda () | |
294 (sort-skip-fields (1- field)) | |
295 nil)) | |
296 (function (lambda () (skip-chars-forward "^ \t\n"))))) | |
297 | |
298 (defun sort-fields-1 (field beg end startkeyfun endkeyfun) | |
86 | 299 (let ((tbl (syntax-table))) |
300 (if (zerop field) (setq field 1)) | |
70 | 301 (unwind-protect |
302 (save-excursion | |
303 (save-restriction | |
304 (narrow-to-region beg end) | |
305 (goto-char (point-min)) | |
306 (set-syntax-table sort-fields-syntax-table) | |
86 | 307 (sort-subr nil |
70 | 308 'forward-line 'end-of-line |
309 startkeyfun endkeyfun))) | |
310 (set-syntax-table tbl)))) | |
311 | |
312 (defun sort-skip-fields (n) | |
86 | 313 (let ((bol (point)) |
314 (eol (save-excursion (end-of-line 1) (point)))) | |
315 (if (> n 0) (forward-word n) | |
316 (end-of-line) | |
317 (forward-word (1+ n))) | |
318 (if (or (and (>= (point) eol) (> n 0)) | |
319 ;; this is marginally wrong; if the first line of the sort | |
320 ;; at bob has the wrong number of fields the error won't be | |
321 ;; reported until the next short line. | |
322 (and (< (point) bol) (< n 0))) | |
70 | 323 (error "Line has too few fields: %s" |
86 | 324 (buffer-substring bol eol))) |
70 | 325 (skip-chars-forward " \t"))) |
326 | |
327 | |
258 | 328 ;;;###autoload |
70 | 329 (defun sort-regexp-fields (reverse record-regexp key-regexp beg end) |
330 "Sort the region lexicographically as specifed by RECORD-REGEXP and KEY. | |
331 RECORD-REGEXP specifies the textual units which should be sorted. | |
332 For example, to sort lines RECORD-REGEXP would be \"^.*$\" | |
333 KEY specifies the part of each record (ie each match for RECORD-REGEXP) | |
334 is to be used for sorting. | |
335 If it is \"\\digit\" then the digit'th \"\\(...\\)\" match field from | |
336 RECORD-REGEXP is used. | |
337 If it is \"\\&\" then the whole record is used. | |
338 Otherwise, it is a regular-expression for which to search within the record. | |
339 If a match for KEY is not found within a record then that record is ignored. | |
340 | |
341 With a negative prefix arg sorts in reverse order. | |
342 | |
343 For example: to sort lines in the region by the first word on each line | |
344 starting with the letter \"f\", | |
345 RECORD-REGEXP would be \"^.*$\" and KEY would be \"\\=\\<f\\w*\\>\"" | |
86 | 346 ;; using negative prefix arg to mean "reverse" is now inconsistent with |
347 ;; other sort-.*fields functions but then again this was before, since it | |
348 ;; didn't use the magnitude of the arg to specify anything. | |
70 | 349 (interactive "P\nsRegexp specifying records to sort: |
350 sRegexp specifying key within record: \nr") | |
351 (cond ((or (equal key-regexp "") (equal key-regexp "\\&")) | |
352 (setq key-regexp 0)) | |
353 ((string-match "\\`\\\\[1-9]\\'" key-regexp) | |
354 (setq key-regexp (- (aref key-regexp 1) ?0)))) | |
355 (save-excursion | |
356 (save-restriction | |
357 (narrow-to-region beg end) | |
358 (goto-char (point-min)) | |
359 (let (sort-regexp-record-end) ;isn't dynamic scoping wonderful? | |
360 (re-search-forward record-regexp) | |
361 (setq sort-regexp-record-end (point)) | |
362 (goto-char (match-beginning 0)) | |
363 (sort-subr reverse | |
364 (function (lambda () | |
365 (and (re-search-forward record-regexp nil 'move) | |
366 (setq sort-regexp-record-end (match-end 0)) | |
367 (goto-char (match-beginning 0))))) | |
368 (function (lambda () | |
369 (goto-char sort-regexp-record-end))) | |
370 (function (lambda () | |
371 (let ((n 0)) | |
372 (cond ((numberp key-regexp) | |
373 (setq n key-regexp)) | |
374 ((re-search-forward | |
375 key-regexp sort-regexp-record-end t) | |
376 (setq n 0)) | |
377 (t (throw 'key nil))) | |
378 (condition-case () | |
379 (if (fboundp 'buffer-substring-lessp) | |
380 (cons (match-beginning n) | |
381 (match-end n)) | |
382 (buffer-substring (match-beginning n) | |
383 (match-end n))) | |
384 ;; if there was no such register | |
385 (error (throw 'key nil))))))))))) | |
386 | |
387 | |
388 (defvar sort-columns-subprocess t) | |
389 | |
258 | 390 ;;;###autoload |
70 | 391 (defun sort-columns (reverse &optional beg end) |
392 "Sort lines in region alphabetically by a certain range of columns. | |
393 For the purpose of this command, the region includes | |
394 the entire line that point is in and the entire line the mark is in. | |
395 The column positions of point and mark bound the range of columns to sort on. | |
396 A prefix argument means sort into reverse order. | |
397 | |
398 Note that `sort-columns' rejects text that contains tabs, | |
399 because tabs could be split across the specified columns | |
400 and it doesn't know how to handle that. Also, when possible, | |
401 it uses the `sort' utility program, which doesn't understand tabs. | |
402 Use \\[untabify] to convert tabs to spaces before sorting." | |
403 (interactive "P\nr") | |
404 (save-excursion | |
405 (let (beg1 end1 col-beg1 col-end1 col-start col-end) | |
406 (goto-char (min beg end)) | |
407 (setq col-beg1 (current-column)) | |
408 (beginning-of-line) | |
409 (setq beg1 (point)) | |
410 (goto-char (max beg end)) | |
411 (setq col-end1 (current-column)) | |
412 (forward-line) | |
413 (setq end1 (point)) | |
414 (setq col-start (min col-beg1 col-end1)) | |
415 (setq col-end (max col-beg1 col-end1)) | |
416 (if (search-backward "\t" beg1 t) | |
417 (error "sort-columns does not work with tabs. Use M-x untabify.")) | |
418 (if (not (eq system-type 'vax-vms)) | |
419 ;; Use the sort utility if we can; it is 4 times as fast. | |
420 (call-process-region beg1 end1 "sort" t t nil | |
421 (if reverse "-rt\n" "-t\n") | |
422 (concat "+0." col-start) | |
423 (concat "-0." col-end)) | |
424 ;; On VMS, use Emacs's own facilities. | |
425 (save-excursion | |
426 (save-restriction | |
427 (narrow-to-region beg1 end1) | |
428 (goto-char beg1) | |
429 (sort-subr reverse 'forward-line 'end-of-line | |
430 (function (lambda () (move-to-column col-start) nil)) | |
431 (function (lambda () (move-to-column col-end) nil))))))))) | |
86 | 432 |
258 | 433 ;;;###autoload |
86 | 434 (defun reverse-region (beg end) |
435 "Reverse the order of lines in a region. | |
436 From a program takes two point or marker arguments, BEG and END." | |
437 (interactive "r") | |
438 (if (> beg end) | |
439 (let (mid) (setq mid end end beg beg mid))) | |
440 (save-excursion | |
441 ;; put beg at the start of a line and end and the end of one -- | |
442 ;; the largest possible region which fits this criteria | |
443 (goto-char beg) | |
444 (or (bolp) (forward-line 1)) | |
445 (setq beg (point)) | |
446 (goto-char end) | |
447 ;; the test for bolp is for those times when end is on an empty line; | |
448 ;; it is probably not the case that the line should be included in the | |
449 ;; reversal; it isn't difficult to add it afterward. | |
450 (or (and (eolp) (not (bolp))) (progn (forward-line -1) (end-of-line))) | |
451 (setq end (point-marker)) | |
452 ;; the real work. this thing cranks through memory on large regions. | |
453 (let (ll (do t)) | |
454 (while do | |
455 (goto-char beg) | |
456 (setq ll (cons (buffer-substring (point) (progn (end-of-line) (point))) | |
457 ll)) | |
458 (setq do (/= (point) end)) | |
459 (delete-region beg (if do (1+ (point)) (point)))) | |
460 (while (cdr ll) | |
461 (insert (car ll) "\n") | |
462 (setq ll (cdr ll))) | |
463 (insert (car ll))))) | |
584 | 464 |
465 (provide 'sort) | |
466 | |
658
7cbd4fcd8b0f
*** empty log message ***
Eric S. Raymond <esr@snark.thyrsus.com>
parents:
584
diff
changeset
|
467 ;;; sort.el ends here |