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