Mercurial > emacs
view oldXMenu/XDestAssoc.c @ 64631:4556f884d581
Revision: miles@gnu.org--gnu-2005/emacs--cvs-trunk--0--patch-495
Merge from gnus--rel--5.10
Patches applied:
* gnus--rel--5.10 (patch 95)
- Update from CVS
2005-07-25 Katsumi Yamaoka <yamaoka@jpl.org>
* lisp/gnus/gnus-art.el (gnus-article-next-page): Revert.
(gnus-article-beginning-of-window): New macro.
(gnus-article-next-page-1): Use it.
(gnus-article-prev-page): Ditto.
(gnus-mime-save-part-and-strip): Use insert-buffer-substring
instead of insert-buffer.
(gnus-mime-delete-part): Ditto.
(gnus-article-edit-exit): Ditto.
* lisp/gnus/gnus-util.el (gnus-beginning-of-window): Remove.
(gnus-end-of-window): Remove.
* lisp/gnus/lpath.el: Don't bind scroll-margin.
2005-07-25 Simon Josefsson <jas@extundo.com>
* lisp/gnus/pgg.el (pgg-insert-url-with-w3): Don't load w3, it is possible
to have the url package without w3. Reported by Daiki Ueno
<ueno@unixuser.org> and Luigi Panzeri <matley@muppetslab.org>.
author | Miles Bader <miles@gnu.org> |
---|---|
date | Mon, 25 Jul 2005 21:35:55 +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) */