@@ -228,9 +228,9 @@ struct hashmap {
228
228
* prevent expensive resizing. If 0, the table is dynamically resized.
229
229
*/
230
230
void hashmap_init (struct hashmap * map ,
231
- hashmap_cmp_fn equals_function ,
232
- const void * equals_function_data ,
233
- size_t initial_size );
231
+ hashmap_cmp_fn equals_function ,
232
+ const void * equals_function_data ,
233
+ size_t initial_size );
234
234
235
235
/* internal function for freeing hashmap */
236
236
void hashmap_free_ (struct hashmap * map , ssize_t offset );
@@ -288,7 +288,7 @@ void hashmap_free_(struct hashmap *map, ssize_t offset);
288
288
* and if it is on stack, you can just let it go out of scope).
289
289
*/
290
290
static inline void hashmap_entry_init (struct hashmap_entry * e ,
291
- unsigned int hash )
291
+ unsigned int hash )
292
292
{
293
293
e -> hash = hash ;
294
294
e -> next = NULL ;
@@ -330,8 +330,8 @@ static inline unsigned int hashmap_get_size(struct hashmap *map)
330
330
* to `hashmap_cmp_fn` to decide whether the entry matches the key.
331
331
*/
332
332
struct hashmap_entry * hashmap_get (const struct hashmap * map ,
333
- const struct hashmap_entry * key ,
334
- const void * keydata );
333
+ const struct hashmap_entry * key ,
334
+ const void * keydata );
335
335
336
336
/*
337
337
* Returns the hashmap entry for the specified hash code and key data,
@@ -364,7 +364,7 @@ static inline struct hashmap_entry *hashmap_get_from_hash(
364
364
* call to `hashmap_get` or `hashmap_get_next`.
365
365
*/
366
366
struct hashmap_entry * hashmap_get_next (const struct hashmap * map ,
367
- const struct hashmap_entry * entry );
367
+ const struct hashmap_entry * entry );
368
368
369
369
/*
370
370
* Adds a hashmap entry. This allows to add duplicate entries (i.e.
@@ -384,7 +384,7 @@ void hashmap_add(struct hashmap *map, struct hashmap_entry *entry);
384
384
* Returns the replaced entry, or NULL if not found (i.e. the entry was added).
385
385
*/
386
386
struct hashmap_entry * hashmap_put (struct hashmap * map ,
387
- struct hashmap_entry * entry );
387
+ struct hashmap_entry * entry );
388
388
389
389
/*
390
390
* Adds or replaces a hashmap entry contained within @keyvar,
@@ -406,8 +406,8 @@ struct hashmap_entry *hashmap_put(struct hashmap *map,
406
406
* Argument explanation is the same as in `hashmap_get`.
407
407
*/
408
408
struct hashmap_entry * hashmap_remove (struct hashmap * map ,
409
- const struct hashmap_entry * key ,
410
- const void * keydata );
409
+ const struct hashmap_entry * key ,
410
+ const void * keydata );
411
411
412
412
/*
413
413
* Removes a hashmap entry contained within @keyvar,
@@ -449,7 +449,7 @@ struct hashmap_entry *hashmap_iter_next(struct hashmap_iter *iter);
449
449
450
450
/* Initializes the iterator and returns the first entry, if any. */
451
451
static inline struct hashmap_entry * hashmap_iter_first (struct hashmap * map ,
452
- struct hashmap_iter * iter )
452
+ struct hashmap_iter * iter )
453
453
{
454
454
hashmap_iter_init (map , iter );
455
455
return hashmap_iter_next (iter );
0 commit comments