Mercurial > emacs
view oldXMenu/XDestAssoc.c @ 32045:74db1ffe4fe8
(latex-metasection-list): New var.
(latex-imenu-create-index): Use it.
Move the regexp construction outside loops (and use push).
(tex-font-lock-keywords-1, tex-font-lock-keywords-2)
(tex-font-lock-keywords): Moved from font-lock.el.
(tex-comment-indent): Remove.
(tex-common-initialization): Don't set comment-indent-function.
(latex-block-default): New var.
(tex-latex-block): Use it to provide a default choice.
Add any unknown choice to latex-block-names.
Insert [...] after {...}.
(tex-last-unended-begin): Simplify regexp.
(tex-goto-last-unclosed-latex-block, latex-backward-sexp-1)
(latex-forward-sexp-1, latex-forward-sexp): New functions.
(latex-mode): Set forward-sexp-function.
author | Stefan Monnier <monnier@iro.umontreal.ca> |
---|---|
date | Sun, 01 Oct 2000 00:47:41 +0000 |
parents | bbce331da1be |
children | 23a1cea22d13 |
line wrap: on
line source
/* $XConsortium: XDestAssoc.c,v 10.17 91/02/08 13:11:50 rws Exp $ */ /* 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); }