Mercurial > emacs
view oldXMenu/XDestAssoc.c @ 56641:c54de325e926
Various changes in addition to:
(Keymap Terminology): `kbd' uses same syntax as Edit Macro mode.
Give more varied examples for `kbd'.
(Creating Keymaps): Char tables have slots for all characters
without modifiers.
(Active Keymaps): `overriding-local-map' and
`overriding-terminal-local-map' also override text property and
overlay keymaps.
(Functions for Key Lookup): Mention OLP arg to `current-active-maps'.
(Scanning Keymaps): `accessible-keymaps' uses `[]' instead of `""'
to denote a prefix of no events.
`map-keymap' includes parent's bindings _recursively_.
Clarify and correct description of `where-is-internal'.
Mention BUFFER-OR-NAME arg to `describe-bindings'.
(Menu Example): For menus intended for use with the keyboard, the
menu items should be bound to characters or real function keys.
author | Luc Teirlinck <teirllm@auburn.edu> |
---|---|
date | Tue, 10 Aug 2004 15:40:14 +0000 |
parents | e8824c4f5f7e |
children | 3861ff8f4bf1 |
line wrap: on
line source
/* Copyright Massachusetts Institute of Technology 1985 */ /* Permission to use, copy, modify, distribute, and sell this software and its documentation for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation, and that the name of M.I.T. not be used in advertising or publicity pertaining to distribution of the software without specific, written prior permission. M.I.T. makes no representations about the suitability of this software for any purpose. It is provided "as is" without express or implied warranty. */ #include <X11/Xlib.h> #include "X10.h" /* * XDestroyAssocTable - Destroy (free the memory associated with) * an XAssocTable. */ XDestroyAssocTable(table) register XAssocTable *table; { register int i; register XAssoc *bucket; register XAssoc *Entry, *entry_next; /* Free the buckets. */ for (i = 0; i < table->size; i++) { bucket = &table->buckets[i]; for ( Entry = bucket->next; Entry != bucket; Entry = entry_next ) { entry_next = Entry->next; free((char *)Entry); } } /* Free the bucket array. */ free((char *)table->buckets); /* Free the table. */ free((char *)table); } /* arch-tag: a536bf02-8d63-45f2-8c1a-c7f9fd4da2cf (do not change this comment) */