1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353
|
;;; lisp.el --- Lisp editing commands for XEmacs
;; Copyright (C) 1985, 1986, 1994, 1997 Free Software Foundation, Inc.
;; Maintainer: FSF
;; Keywords: lisp, languages, dumped
;; This file is part of XEmacs.
;; XEmacs is free software; you can redistribute it and/or modify it
;; under the terms of the GNU General Public License as published by
;; the Free Software Foundation; either version 2, or (at your option)
;; any later version.
;; XEmacs is distributed in the hope that it will be useful, but
;; WITHOUT ANY WARRANTY; without even the implied warranty of
;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
;; General Public License for more details.
;; You should have received a copy of the GNU General Public License
;; along with XEmacs; see the file COPYING. If not, write to the Free
;; Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
;; 02111-1307, USA.
;;; Synched up with: Emacs/Mule zeta.
;;; Commentary:
;; This file is dumped with XEmacs.
;; Lisp editing commands to go with Lisp major mode.
;; 06/11/1997 - Use char-(after|before) instead of
;; (following|preceding)-char. -slb
;;; Code:
;; Note that this variable is used by non-lisp modes too.
(defcustom defun-prompt-regexp nil
"*Non-nil => regexp to ignore, before the character that starts a defun.
This is only necessary if the opening paren or brace is not in column 0.
See `beginning-of-defun'."
:type '(choice (const :tag "none" nil)
regexp)
:group 'lisp)
(make-variable-buffer-local 'defun-prompt-regexp)
(defcustom parens-require-spaces t
"Non-nil => `insert-parentheses' should insert whitespace as needed."
:type 'boolean
:group 'editing-basics
:group 'lisp)
(defun forward-sexp (&optional arg)
"Move forward across one balanced expression (sexp).
With argument, do it that many times. Negative arg -N means
move backward across N balanced expressions."
;; XEmacs change (for zmacs regions)
(interactive "_p")
(or arg (setq arg 1))
;; XEmacs: evil hack! The other half of the evil hack below.
(if (and (> arg 0) (looking-at "#s("))
(goto-char (+ (point) 2)))
(goto-char (or (scan-sexps (point) arg) (buffer-end arg)))
(if (< arg 0) (backward-prefix-chars))
;; XEmacs: evil hack! Skip back over #s so that structures are read
;; properly. the current cheesified syntax tables just aren't up to
;; this.
(if (and (< arg 0)
(eq (char-after (point)) ?\()
(>= (- (point) (point-min)) 2)
(eq (char-after (- (point) 1)) ?s)
(eq (char-after (- (point) 2)) ?#))
(goto-char (- (point) 2))))
(defun backward-sexp (&optional arg)
"Move backward across one balanced expression (sexp).
With argument, do it that many times. Negative arg -N means
move forward across N balanced expressions."
;; XEmacs change (for zmacs regions)
(interactive "_p")
(forward-sexp (- (or arg 1))))
(defun mark-sexp (&optional arg)
"Set mark ARG sexps from point.
The place mark goes is the same place \\[forward-sexp] would
move to with the same argument.
Repeat this command to mark more sexps in the same direction."
(interactive "p")
(mark-something 'mark-sexp 'forward-sexp (or arg 1)))
(defun forward-list (&optional arg)
"Move forward across one balanced group of parentheses.
With argument, do it that many times.
Negative arg -N means move backward across N groups of parentheses."
;; XEmacs change
(interactive "_p")
(goto-char (or (scan-lists (point) (or arg 1) 0) (buffer-end (or arg 1)))))
(defun backward-list (&optional arg)
"Move backward across one balanced group of parentheses.
With argument, do it that many times.
Negative arg -N means move forward across N groups of parentheses."
;; XEmacs change (for zmacs regions)
(interactive "_p")
(forward-list (- (or arg 1))))
(defun down-list (&optional arg)
"Move forward down one level of parentheses.
With argument, do this that many times.
A negative argument means move backward but still go down a level."
;; XEmacs change (for zmacs regions)
(interactive "_p")
(or arg (setq arg 1))
(let ((inc (if (> arg 0) 1 -1)))
(while (/= arg 0)
(goto-char (or (scan-lists (point) inc -1) (buffer-end arg)))
(setq arg (- arg inc)))))
(defun backward-up-list (&optional arg)
"Move backward out of one level of parentheses.
With argument, do this that many times.
A negative argument means move forward but still to a less deep spot."
(interactive "_p")
(up-list (- (or arg 1))))
(defun up-list (&optional arg)
"Move forward out of one level of parentheses.
With argument, do this that many times.
A negative argument means move backward but still to a less deep spot.
In Lisp programs, an argument is required."
;; XEmacs change (for zmacs regions)
(interactive "_p")
(or arg (setq arg 1))
(let ((inc (if (> arg 0) 1 -1)))
(while (/= arg 0)
(goto-char (or (scan-lists (point) inc 1) (buffer-end arg)))
(setq arg (- arg inc)))))
(defun kill-sexp (&optional arg)
"Kill the sexp (balanced expression) following the cursor.
With argument, kill that many sexps after the cursor.
Negative arg -N means kill N sexps before the cursor."
(interactive "p")
(let ((opoint (point)))
(forward-sexp (or arg 1))
(kill-region opoint (point))))
(defun backward-kill-sexp (&optional arg)
"Kill the sexp (balanced expression) preceding the cursor.
With argument, kill that many sexps before the cursor.
Negative arg -N means kill N sexps after the cursor."
(interactive "p")
(kill-sexp (- (or arg 1))))
(defun beginning-of-defun (&optional arg)
"Move backward to the beginning of a defun.
With argument, do it that many times. Negative arg -N
means move forward to Nth following beginning of defun.
Returns t unless search stops due to beginning or end of buffer.
Normally a defun starts when there is an char with open-parenthesis
syntax at the beginning of a line. If `defun-prompt-regexp' is
non-nil, then a string which matches that regexp may precede the
open-parenthesis, and point ends up at the beginning of the line."
;; XEmacs change (for zmacs regions)
(interactive "_p")
(and (beginning-of-defun-raw arg)
(progn (beginning-of-line) t)))
(defun beginning-of-defun-raw (&optional arg)
"Move point to the character that starts a defun.
This is identical to beginning-of-defun, except that point does not move
to the beginning of the line when `defun-prompt-regexp' is non-nil."
(interactive "p")
(and arg (< arg 0) (not (eobp)) (forward-char 1))
(and (re-search-backward (if defun-prompt-regexp
(concat "^\\s(\\|"
"\\(" defun-prompt-regexp "\\)\\s(")
"^\\s(")
nil 'move (or arg 1))
(progn (goto-char (1- (match-end 0)))) t))
;; XEmacs change (optional buffer parameter)
(defun buffer-end (arg &optional buffer)
"Return `point-max' of BUFFER if ARG is > 0; return `point-min' otherwise.
BUFFER defaults to the current buffer if omitted."
(if (> arg 0) (point-max buffer) (point-min buffer)))
(defun end-of-defun (&optional arg)
"Move forward to next end of defun. With argument, do it that many times.
Negative argument -N means move back to Nth preceding end of defun.
An end of a defun occurs right after the close-parenthesis that matches
the open-parenthesis that starts a defun; see `beginning-of-defun'."
;; XEmacs change (for zmacs regions)
(interactive "_p")
(if (or (null arg) (= arg 0)) (setq arg 1))
(let ((first t))
(while (and (> arg 0) (< (point) (point-max)))
(let ((pos (point))) ; XEmacs -- remove unused npos.
(while (progn
(if (and first
(progn
(end-of-line 1)
(beginning-of-defun-raw 1)))
nil
(or (bobp) (backward-char 1))
(beginning-of-defun-raw -1))
(setq first nil)
(forward-list 1)
(skip-chars-forward " \t")
(if (looking-at "\\s<\\|\n")
(forward-line 1))
(<= (point) pos))))
(setq arg (1- arg)))
(while (< arg 0)
(let ((pos (point)))
(beginning-of-defun-raw 1)
(forward-sexp 1)
(forward-line 1)
(if (>= (point) pos)
(if (beginning-of-defun-raw 2)
(progn
(forward-list 1)
(skip-chars-forward " \t")
(if (looking-at "\\s<\\|\n")
(forward-line 1)))
(goto-char (point-min)))))
(setq arg (1+ arg)))))
(defun mark-defun ()
"Put mark at end of this defun, point at beginning.
The defun marked is the one that contains point or follows point."
(interactive)
(push-mark (point))
(end-of-defun)
(push-mark (point) nil t)
(beginning-of-defun)
(re-search-backward "^\n" (- (point) 1) t))
(defun narrow-to-defun (&optional arg)
"Make text outside current defun invisible.
The defun visible is the one that contains point or follows point."
(interactive)
(save-excursion
(widen)
(end-of-defun)
(let ((end (point)))
(beginning-of-defun)
(narrow-to-region (point) end))))
(defun insert-parentheses (arg)
"Enclose following ARG sexps in parentheses. Leave point after open-paren.
A negative ARG encloses the preceding ARG sexps instead.
No argument is equivalent to zero: just insert `()' and leave point between.
If `parens-require-spaces' is non-nil, this command also inserts a space
before and after, depending on the surrounding characters."
(interactive "P")
(if arg (setq arg (prefix-numeric-value arg))
(setq arg 0))
(cond ((> arg 0) (skip-chars-forward " \t"))
((< arg 0) (forward-sexp arg) (setq arg (- arg))))
(and parens-require-spaces
(not (bobp))
(memq (char-syntax (char-before (point))) '(?w ?_ ?\) ))
(insert " "))
(insert ?\()
(save-excursion
(or (eq arg 0) (forward-sexp arg))
(insert ?\))
(and parens-require-spaces
(not (eobp))
(memq (char-syntax (char-after (point))) '(?w ?_ ?\( ))
(insert " "))))
(defun move-past-close-and-reindent ()
"Move past next `)', delete indentation before it, then indent after it."
(interactive)
(up-list 1)
(backward-char 1)
(while (save-excursion ; this is my contribution
(let ((before-paren (point)))
(back-to-indentation)
(= (point) before-paren)))
(delete-indentation))
(forward-char 1)
(newline-and-indent))
(defun lisp-complete-symbol ()
"Perform completion on Lisp symbol preceding point.
Compare that symbol against the known Lisp symbols.
The context determines which symbols are considered.
If the symbol starts just after an open-parenthesis, only symbols
with function definitions are considered. Otherwise, all symbols with
function definitions, values or properties are considered."
(interactive)
(let* ((end (point))
(buffer-syntax (syntax-table))
(beg (unwind-protect
(save-excursion
;; XEmacs change
(if emacs-lisp-mode-syntax-table
(set-syntax-table emacs-lisp-mode-syntax-table))
(backward-sexp 1)
(while (eq (char-syntax (char-after (point))) ?\')
(forward-char 1))
(point))
(set-syntax-table buffer-syntax)))
(pattern (buffer-substring beg end))
(predicate
(if (eq (char-after (1- beg)) ?\()
'fboundp
;; XEmacs change
#'(lambda (sym)
(or (boundp sym) (fboundp sym)
(symbol-plist sym)))))
(completion (try-completion pattern obarray predicate)))
(cond ((eq completion t))
((null completion)
(message "Can't find completion for \"%s\"" pattern)
(ding))
((not (string= pattern completion))
(delete-region beg end)
(insert completion))
(t
(message "Making completion list...")
(let ((list (all-completions pattern obarray predicate))
;FSFmacs crock unnecessary in XEmacs
;see minibuf.el
;(completion-fixup-function
; (function (lambda () (if (save-excursion
; (goto-char (max (point-min)
; (- (point) 4)))
; (looking-at " <f>"))
; (forward-char -4))))
)
(or (eq predicate 'fboundp)
(let (new)
(while list
(setq new (cons (if (fboundp (intern (car list)))
(list (car list) " <f>")
(car list))
new))
(setq list (cdr list)))
(setq list (nreverse new))))
(with-output-to-temp-buffer "*Completions*"
(display-completion-list list)))
(message "Making completion list...%s" "done")))))
;;; lisp.el ends here
|