Mercurial > hg > xemacs-beta
annotate netinstall/hash.cc @ 4697:0d6d0edf1253
lisp beginning-end-of-defun-function Changelog entry
hg diff
diff -r ecc468b62551 lisp/ChangeLog
--- a/lisp/ChangeLog Mon Sep 21 21:40:35 2009 +0200
+++ b/lisp/ChangeLog Tue Sep 22 21:11:51 2009 +0200
@@ -1,3 +1,12 @@ 2009-09-20 Aidan Kehoe <kehoea@parhasa
+2009-09-22 Andreas Roehler <andreas.roehler@online.de>
+
+ * lisp.el (beginning-of-defun-raw):
+ new variable: beginning-of-defun-function,
+ beginning-of-defun may call FUNCTION determining start position
+ * lisp.el (end-of-defun):
+ new variable: end-of-defun-function,
+ end-of-defun may call FUNCTION determining the end position
+
;;;;;;;;;;;;;;;;;;;;;;;;
hg diff -p -r 4695 -r 4696
diff -r fee33ab25966 -r ecc468b62551 lisp/lisp.el
--- a/lisp/lisp.el Sun Sep 20 23:50:05 2009 +0100
+++ b/lisp/lisp.el Mon Sep 21 21:40:35 2009 +0200
@@ -155,6 +155,21 @@ Negative arg -N means kill N sexps after
(interactive "p")
(kill-sexp (- (or arg 1))))
+
+;; derived stuff from GNU Emacs
+(defvar beginning-of-defun-function nil
+ "If non-nil, function for `beginning-of-defun-raw' to call.
+This is used to find the beginning of the defun instead of using the
+normal recipe (see `beginning-of-defun'). Modes can define this
+if defining `defun-prompt-regexp' is not sufficient to handle the mode's
+needs.")
+
+(defvar end-of-defun-function nil
+ "If non-nil, function for `end-of-defun' to call.
+This is used to find the end of the defun instead of using the normal
+recipe (see `end-of-defun'). Modes can define this if the
+normal method is not appropriate.")
+
(defun beginning-of-defun (&optional arg)
"Move backward to the beginning of a defun.
With argument, do it that many times. Negative arg -N
@@ -175,13 +190,17 @@ This is identical to beginning-of-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))
+ ;; (and arg (< arg 0) (not (eobp)) (forward-char 1))
+ (unless arg (setq arg 1))
+ (cond
+ (beginning-of-defun-function
+ (funcall beginning-of-defun-function arg))
+ (t (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)
@@ -198,6 +217,10 @@ the open-parenthesis that starts a defun
;; XEmacs change (for zmacs regions)
(interactive "_p")
(if (or (null arg) (= arg 0)) (setq arg 1))
+ (if end-of-defun-function
+ (if (> arg 0)
+ (dotimes (i arg)
+ (funcall end-of-defun-function)))
(let ((first t))
(while (and (> arg 0) (< (point) (point-max)))
(let ((pos (point))) ; XEmacs -- remove unused npos.
@@ -229,7 +252,7 @@ the open-parenthesis that starts a defun
(if (looking-at "\\s<\\|\n")
(forward-line 1)))
(goto-char (point-min)))))
- (setq arg (1+ arg)))))
+ (setq arg (1+ arg))))))
(defun mark-defun ()
"Put mark at end of this defun, point at beginning.
author | Andreas Roehler <andreas.roehler@online.de> |
---|---|
date | Tue, 22 Sep 2009 21:14:03 +0200 |
parents | 3078fd1074e8 |
children |
rev | line source |
---|---|
448 | 1 /* |
2 * Copyright (c) 2000, Red Hat, Inc. | |
3 * | |
4 * This program is free software; you can redistribute it and/or modify | |
5 * it under the terms of the GNU General Public License as published by | |
6 * the Free Software Foundation; either version 2 of the License, or | |
7 * (at your option) any later version. | |
8 * | |
9 * A copy of the GNU General Public License can be found at | |
10 * http://www.gnu.org/ | |
11 * | |
12 * Written by DJ Delorie <dj@cygnus.com> | |
13 * | |
14 */ | |
15 | |
16 /* Simple hash class for install.cc */ | |
17 | |
18 #include "win32.h" | |
19 #include <stdlib.h> | |
20 #include <string.h> | |
21 | |
22 #include "hash.h" | |
23 | |
24 class hash_internals { | |
25 public: | |
26 char **keys; | |
27 int numkeys; | |
28 int maxkeys; | |
29 int prev_index; | |
30 }; | |
31 | |
32 hash::hash () | |
33 { | |
34 h = new hash_internals; | |
35 h->numkeys = 0; | |
36 h->maxkeys = 10; | |
37 h->keys = (char **) malloc (h->maxkeys * sizeof (char *)); | |
38 h->prev_index = 0; | |
39 } | |
40 | |
41 hash::~hash () | |
42 { | |
43 free (h->keys); | |
44 free (h); | |
45 } | |
46 | |
47 | |
48 void | |
49 hash::add (char *string) | |
50 { | |
51 int i; | |
52 for (i=0; i<h->numkeys; i++) | |
53 if (strcmp (h->keys[i], string) == 0) | |
54 return; | |
55 if (h->numkeys >= h->maxkeys) | |
56 { | |
57 h->maxkeys += 10; | |
58 h->keys = (char **) realloc (h->keys, h->maxkeys * sizeof (char *)); | |
59 } | |
60 | |
61 h->keys[h->numkeys] = _strdup (string); | |
62 h->numkeys ++; | |
63 } | |
64 | |
65 | |
66 int | |
67 hash::has (char *string) | |
68 { | |
69 int i; | |
70 for (i=0; i<h->numkeys; i++) | |
71 if (strcmp (h->keys[i], string) == 0) | |
72 return 1; | |
73 return 0; | |
74 } | |
75 | |
76 char * | |
77 hash::enumerate (char *prev) | |
78 { | |
79 if (prev == 0) | |
80 h->prev_index = -1; | |
81 h->prev_index ++; | |
82 if (h->prev_index >= h->numkeys) | |
83 return 0; | |
84 return h->keys[h->prev_index]; | |
85 } | |
86 | |
87 static int CDECL | |
88 rev_len (const void *va, const void *vb) | |
89 { | |
90 char *a = *(char **)va; | |
91 char *b = *(char **)vb; | |
92 return strcmp (b, a); | |
93 } | |
94 | |
95 void | |
96 hash::reverse_sort () | |
97 { | |
98 qsort (h->keys, h->numkeys, sizeof (h->keys[0]), rev_len); | |
99 } |