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