3 * $Id: assoc.c,v 1.2 2001/01/21 19:04:59 mdw Exp $
7 * (c) 2000 Straylight/Edgeware
10 /*----- Licensing notice --------------------------------------------------*
12 * This file is part of the mLib utilities library.
14 * mLib is free software; you can redistribute it and/or modify
15 * it under the terms of the GNU Library General Public License as
16 * published by the Free Software Foundation; either version 2 of the
17 * License, or (at your option) any later version.
19 * mLib is distributed in the hope that it will be useful,
20 * but WITHOUT ANY WARRANTY; without even the implied warranty of
21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * GNU Library General Public License for more details.
24 * You should have received a copy of the GNU Library General Public
25 * License along with mLib; if not, write to the Free
26 * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
30 /*----- Revision history --------------------------------------------------*
33 * Revision 1.2 2001/01/21 19:04:59 mdw
36 * Revision 1.1 2001/01/20 11:50:58 mdw
37 * Hash tables indexed by atoms, to avoid expense of hashing keys on each
38 * lookup, and to reduce storage used by key texts.
42 /*----- Header files ------------------------------------------------------*/
49 /*----- Main code ---------------------------------------------------------*/
51 /* --- @assoc_create@ --- *
53 * Arguments: @assoc_table *t@ = pointer to an association table
57 * Use: Creates a new association table.
60 void assoc_create(assoc_table
*t
)
62 hash_create(&t
->t
, SYM_INITSZ
);
63 t
->load
= SYM_LIMIT(SYM_INITSZ
);
66 /* --- @assoc_destroy@ --- *
68 * Arguments: @assoc_table *t@ = pointer to an association table
72 * Use: Destroys an association table.
75 void assoc_destroy(assoc_table
*t
)
79 HASH_MKITER(&i
, &t
->t
);
90 /* --- @assoc_find@ --- *
92 * Arguments: @assoc_table *t@ = pointer to an association table
93 * @atom *a@ = an atom to label the item
94 * @size_t sz@ = size of block to allocate
95 * @unsigned *f@ = pointer to `found' flag
97 * Returns: A pointer to the item located or null.
99 * Use: Looks up an atom in an association table. If the atom is
100 * found, the association is returned. If not, and @sz@ is
101 * zero, a null pointer is returned. Otherwise, a block of size
102 * @sz@ is allocated, its @assoc_base@ header is filled in, and
103 * the pointer returned. The flag @*f@ is cleared if the item
104 * couldn't be found, or set if it was.
106 * All the atoms used in a particular table should
109 void *assoc_find(assoc_table
*t
, atom
*a
, size_t sz
, unsigned *f
)
111 hash_base
**bin
= HASH_BIN(&t
->t
, a
->b
.b
.hash
), **p
;
114 /* --- Try to find the association --- */
116 for (p
= bin
; *p
; p
= &(*p
)->next
) {
117 q
= (assoc_base
*)*p
;
127 /* --- Failed to find a match --- */
132 /* --- Make a new assoication --- */
134 q
= x_alloc(t
->t
.a
, sz
);
137 q
->b
.hash
= ATOM_HASH(a
);
140 /* --- Maybe extend the table --- */
144 if (!t
->load
&& hash_extend(&t
->t
))
145 t
->load
= SYM_LIMIT(t
->t
.mask
+ 1);
149 /* --- @assoc_remove@ --- *
151 * Arguments: @assoc_table *t@ = pointer to an association table
152 * @void *p@ = pointer to a block to remove
156 * Use: Removes an association from a table.
159 void assoc_remove(assoc_table
*t
, void *p
)
162 hash_remove(&t
->t
, &q
->b
);
167 /* --- @assoc_mkiter@, @assoc_next@ --- *
169 * Arguments: @assoc_iter *i@ = pointer to an iterator
170 * @assoc_table *t@ = pointer to an association table
172 * Returns: Next association, or null, for @assoc_next@; nothing for
175 * Use: Iterates over the associations in a table.
178 void assoc_mkiter(assoc_iter
*i
, assoc_table
*t
) { ASSOC_MKITER(i
, t
); }
179 void *assoc_next(assoc_iter
*i
) { void *p
; ASSOC_NEXT(i
, p
); return (p
); }
181 /*----- That's all, folks -------------------------------------------------*/