Mercurial > emacs
annotate oldXMenu/XDestAssoc.c @ 56303:d86ec00a8470
(isearch-mode-map): Bind C-M-w to isearch-del-char,
C-M-y to isearch-yank-char. Bind M-% to isearch-query-replace,
C-M-% to isearch-query-replace-regexp.
(minibuffer-local-isearch-map): Add arrow key bindings.
Bind C-f to isearch-yank-char-in-minibuffer.
(isearch-forward): Doc fix.
(isearch-edit-string): Doc fix.
(isearch-query-replace, isearch-query-replace-regexp): New funs.
(isearch-del-char): Add optional arg. Set isearch-yank-flag to t.
(isearch-yank-char): Add optional arg.
(isearch-yank-char-in-minibuffer): New fun.
| author | Juri Linkov <juri@jurta.org> |
|---|---|
| date | Thu, 01 Jul 2004 09:54:51 +0000 |
| parents | e8824c4f5f7e |
| children | 3861ff8f4bf1 |
| rev | line source |
|---|---|
| 25858 | 1 /* Copyright Massachusetts Institute of Technology 1985 */ |
| 2 | |
| 3 /* | |
| 4 Permission to use, copy, modify, distribute, and sell this software and its | |
| 5 documentation for any purpose is hereby granted without fee, provided that | |
| 6 the above copyright notice appear in all copies and that both that | |
| 7 copyright notice and this permission notice appear in supporting | |
| 8 documentation, and that the name of M.I.T. not be used in advertising or | |
| 9 publicity pertaining to distribution of the software without specific, | |
| 10 written prior permission. M.I.T. makes no representations about the | |
| 11 suitability of this software for any purpose. It is provided "as is" | |
| 12 without express or implied warranty. | |
| 13 */ | |
| 14 | |
| 15 #include <X11/Xlib.h> | |
| 16 #include "X10.h" | |
| 17 | |
| 18 /* | |
| 19 * XDestroyAssocTable - Destroy (free the memory associated with) | |
|
49600
23a1cea22d13
Trailing whitespace deleted.
Juanma Barranquero <lekktu@gmail.com>
parents:
25858
diff
changeset
|
20 * an XAssocTable. |
| 25858 | 21 */ |
| 22 XDestroyAssocTable(table) | |
| 23 register XAssocTable *table; | |
| 24 { | |
| 25 register int i; | |
| 26 register XAssoc *bucket; | |
| 27 register XAssoc *Entry, *entry_next; | |
| 28 | |
| 29 /* Free the buckets. */ | |
| 30 for (i = 0; i < table->size; i++) { | |
| 31 bucket = &table->buckets[i]; | |
| 32 for ( | |
| 33 Entry = bucket->next; | |
| 34 Entry != bucket; | |
| 35 Entry = entry_next | |
| 36 ) { | |
| 37 entry_next = Entry->next; | |
| 38 free((char *)Entry); | |
| 39 } | |
| 40 } | |
| 41 | |
| 42 /* Free the bucket array. */ | |
| 43 free((char *)table->buckets); | |
| 44 | |
| 45 /* Free the table. */ | |
| 46 free((char *)table); | |
| 47 } | |
| 48 | |
| 52401 | 49 /* arch-tag: a536bf02-8d63-45f2-8c1a-c7f9fd4da2cf |
| 50 (do not change this comment) */ |
