hash.h (32785) | hash.h (34461) |
---|---|
1/* 2 * Copyright (c) 1992, Brian Berliner and Jeff Polk 3 * 4 * You may distribute under the terms of the GNU General Public License as 5 * specified in the README file that comes with the CVS source distribution. 6 */ 7 8/* --- 42 unchanged lines hidden (view full) --- 51int addnode PROTO((List * list, Node * p)); 52int addnode_at_front PROTO((List * list, Node * p)); 53int walklist PROTO((List * list, int (*)(Node *n, void *closure), void *closure)); 54int list_isempty PROTO ((List *list)); 55void dellist PROTO((List ** listp)); 56void delnode PROTO((Node * p)); 57void freenode PROTO((Node * p)); 58void sortlist PROTO((List * list, int (*)(const Node *, const Node *))); | 1/* 2 * Copyright (c) 1992, Brian Berliner and Jeff Polk 3 * 4 * You may distribute under the terms of the GNU General Public License as 5 * specified in the README file that comes with the CVS source distribution. 6 */ 7 8/* --- 42 unchanged lines hidden (view full) --- 51int addnode PROTO((List * list, Node * p)); 52int addnode_at_front PROTO((List * list, Node * p)); 53int walklist PROTO((List * list, int (*)(Node *n, void *closure), void *closure)); 54int list_isempty PROTO ((List *list)); 55void dellist PROTO((List ** listp)); 56void delnode PROTO((Node * p)); 57void freenode PROTO((Node * p)); 58void sortlist PROTO((List * list, int (*)(const Node *, const Node *))); |
59int fsortcmp PROTO((const Node * p, const Node * q)); |
|