view oldXMenu/XDestAssoc.c @ 62053:57aabea77432

From Ulf Jasper <[e-mail]>: (icalendar-version): Now at 0.12. (icalendar-duration-correction): Remove. (icalendar--get-event-properties): Split result at commas. (icalendar--decode-isoduration): New optional argument DURATION-CORRECTION. (icalendar--convert-ordinary-to-ical) (icalendar--convert-weekly-to-ical) (icalendar--convert-yearly-to-ical) (icalendar--convert-sexp-to-ical) (icalendar--convert-block-to-ical) (icalendar--convert-float-to-ical) (icalendar--convert-date-to-ical) (icalendar--convert-cyclic-to-ical) (icalendar--convert-anniversary-to-ical): New functions, extracted from icalendar-export-region, with bug fixes. (icalendar-export-region): Use the above functions. (icalendar-import-buffer): Check before saving diary file. (icalendar--convert-recurring-to-diary) (icalendar--convert-non-recurring-all-day-to-diary) (icalendar--convert-non-recurring-not-all-day-to-diary): New functions, extracted from icalendar--convert-ical-to-diary, with bug fixes. (icalendar--convert-ical-to-diary): Use the above functions.

/* 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) */