Mercurial > emacs
view oldXMenu/XLookAssoc.c @ 101670:a15c11f894f1
2009-01-30 Carsten Dominik <carsten.dominik@gmail.com>
* org-timer.el (org-timer): Provide the timer feature.
* org.el (org-require-autoloaded-modules): Add a few more files to
the list of autoloaded modules.
* org-agenda.el (org-agenda-todo): Pass ARG to `org-todo'.
* org-exp.el (org-export-remove-or-extract-drawers): Only remove
drawers that are unprotected.
(org-export-html-format-image): Make sure inlined LaTeX fragment
images remain inlined.
* org.el (org-toggle-ordered-property): New function.
(org-mode-map): Add a key for `org-toggle-ordered-property'.
(org-org-menu): Add menu entries for TODO dependencies.
* org.el (org-default-properties): Add ORDERED to the default
properties, to get completion support for it.
* org-list.el (org-update-checkbox-count): Update more than one cookie.
* org.el (org-update-parent-todo-statistics): Update more than one
cookie.
author | Carsten Dominik <dominik@science.uva.nl> |
---|---|
date | Fri, 30 Jan 2009 08:32:49 +0000 |
parents | fec5e03aaf59 |
children | ec58e5c426ef 5cc91198ffb2 |
line wrap: on
line source
/* Copyright Massachusetts Institute of Technology 1985 */ #include "copyright.h" #include <X11/Xlib.h> #include <X11/Xresource.h> #include "X10.h" #ifndef NULL #define NULL 0 #endif /* * XLookUpAssoc - Retrieve the data stored in an XAssocTable by its XId. * If an appropriately matching XId can be found in the table the routine will * return apointer to the data associated with it. If the XId can not be found * in the table the routine will return a NULL pointer. All XId's are relative * to the currently active Display. */ caddr_t XLookUpAssoc(dpy, table, x_id) register Display *dpy; register XAssocTable *table; /* XAssocTable to search in. */ register XID x_id; /* XId to search for. */ { int hash; register XAssoc *bucket; register XAssoc *Entry; /* Hash the XId to get the bucket number. */ hash = x_id & (table->size - 1); /* Look up the bucket to get the entries in that bucket. */ bucket = &table->buckets[hash]; /* Get the first entry in the bucket. */ Entry = bucket->next; /* Scan through the entries in the bucket for the right XId. */ for (; Entry != bucket; Entry = Entry->next) { if (Entry->x_id == x_id) { /* We have the right XId. */ if (Entry->display == dpy) { /* We have the right display. */ /* We have the right entry! */ return(Entry->data); } /* Oops, identical XId's on different displays! */ continue; } if (Entry->x_id > x_id) { /* We have gone past where it should be. */ /* It is apparently not in the table. */ return(NULL); } } /* It is apparently not in the table. */ return(NULL); } /* arch-tag: d5075d0c-4b71-467d-b33c-3f5c4c4afcf2 (do not change this comment) */