Mercurial > emacs
view oldXMenu/XDestAssoc.c @ 65616:cabd12ecc31c
Revision: miles@gnu.org--gnu-2005/emacs--cvs-trunk--0--patch-553
Merge from gnus--rel--5.10
Patches applied:
* gnus--rel--5.10 (patch 118-121)
- Update from CVS
- Merge from emacs--cvs-trunk--0
2005-09-16 Katsumi Yamaoka <yamaoka@jpl.org>
* lisp/gnus/gnus.el (gnus-group-startup-message): Bind image-load-path.
2005-09-14 Katsumi Yamaoka <yamaoka@jpl.org>
* lisp/gnus/gnus-art.el (gnus-mime-display-part): Protect against broken
MIME messages.
2005-09-15 Katsumi Yamaoka <yamaoka@jpl.org>
* man/gnus.texi (Finding the Parent): Fix description of how Gnus
finds article.
2005-09-14 Jari Aalto <jari.aalto@cante.net>
* man/gnus.texi (Advanced Scoring Examples): New exmples to teach how
to drop off non-answered articles.
author | Miles Bader <miles@gnu.org> |
---|---|
date | Mon, 19 Sep 2005 10:14:34 +0000 |
parents | 3861ff8f4bf1 |
children | e8a3fb527b77 2d92f5c9d6ae |
line wrap: on
line source
/* Copyright Massachusetts Institute of Technology 1985 */ /* Copyright (C) 2002, 2003, 2004, 2005 Free Software Foundation, Inc. */ /* 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) */