3 * $Id: assoc.c,v 1.4 2004/04/08 01:36:11 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 /*----- Header files ------------------------------------------------------*/
37 /*----- Main code ---------------------------------------------------------*/
39 /* --- @assoc_create@ --- *
41 * Arguments: @assoc_table *t@ = pointer to an association table
45 * Use: Creates a new association table.
48 void assoc_create(assoc_table
*t
)
50 hash_create(&t
->t
, SYM_INITSZ
);
51 t
->load
= SYM_LIMIT(SYM_INITSZ
);
54 /* --- @assoc_destroy@ --- *
56 * Arguments: @assoc_table *t@ = pointer to an association table
60 * Use: Destroys an association table.
63 void assoc_destroy(assoc_table
*t
)
67 HASH_MKITER(&i
, &t
->t
);
78 /* --- @assoc_find@ --- *
80 * Arguments: @assoc_table *t@ = pointer to an association table
81 * @atom *a@ = an atom to label the item
82 * @size_t sz@ = size of block to allocate
83 * @unsigned *f@ = pointer to `found' flag
85 * Returns: A pointer to the item located or null.
87 * Use: Looks up an atom in an association table. If the atom is
88 * found, the association is returned. If not, and @sz@ is
89 * zero, a null pointer is returned. Otherwise, a block of size
90 * @sz@ is allocated, its @assoc_base@ header is filled in, and
91 * the pointer returned. The flag @*f@ is cleared if the item
92 * couldn't be found, or set if it was.
94 * All the atoms used in a particular table should
97 void *assoc_find(assoc_table
*t
, atom
*a
, size_t sz
, unsigned *f
)
99 hash_base
**bin
= HASH_BIN(&t
->t
, ATOM_HASH(a
)), **p
;
102 /* --- Try to find the association --- */
104 for (p
= bin
; *p
; p
= &(*p
)->next
) {
105 q
= (assoc_base
*)*p
;
115 /* --- Failed to find a match --- */
120 /* --- Make a new assoication --- */
122 q
= x_alloc(t
->t
.a
, sz
);
125 q
->b
.hash
= ATOM_HASH(a
);
128 /* --- Maybe extend the table --- */
132 if (!t
->load
&& hash_extend(&t
->t
))
133 t
->load
= SYM_LIMIT(t
->t
.mask
+ 1);
137 /* --- @assoc_remove@ --- *
139 * Arguments: @assoc_table *t@ = pointer to an association table
140 * @void *p@ = pointer to a block to remove
144 * Use: Removes an association from a table.
147 void assoc_remove(assoc_table
*t
, void *p
)
150 hash_remove(&t
->t
, &q
->b
);
155 /* --- @assoc_mkiter@, @assoc_next@ --- *
157 * Arguments: @assoc_iter *i@ = pointer to an iterator
158 * @assoc_table *t@ = pointer to an association table
160 * Returns: Next association, or null, for @assoc_next@; nothing for
163 * Use: Iterates over the associations in a table.
166 void assoc_mkiter(assoc_iter
*i
, assoc_table
*t
) { ASSOC_MKITER(i
, t
); }
167 void *assoc_next(assoc_iter
*i
) { void *p
; ASSOC_NEXT(i
, p
); return (p
); }
169 /*----- That's all, folks -------------------------------------------------*/