/*
* finds the first entry in the table
*/
-void * MANGLEP(first) (SET *table)
+void *(MANGLEP(first))(SET *table)
{
assert (!table->iter_tail);
table->iter_i = 0;
/*
* returns next entry in the table
*/
-void *MANGLEP(next) (SET *table)
+void *(MANGLEP(next))(SET *table)
{
if (!table->iter_tail)
return NULL;
void pset_insert_pset_ptr(pset *target, pset *src)
{
- void *elt;
- for (elt = pset_first(src); elt; elt = pset_next(src)) {
+ foreach_pset(src, void, elt) {
pset_insert_ptr(target, elt);
}
}
void *(set_find) (set *se, const void *key, size_t size, unsigned hash)
{
- return set_find (se, key, size, hash);
+ return set_find(void, se, key, size, hash);
}
void *(set_insert) (set *se, const void *key, size_t size, unsigned hash)
{
- return set_insert (se, key, size, hash);
+ return set_insert(void, se, key, size, hash);
}