25 #ifndef ROHC_HASHTABLE_CR_H 26 #define ROHC_HASHTABLE_CR_H 36 const size_t full_key_len,
38 __attribute((warn_unused_result,
nonnull(1)));
44 const void *
const key,
46 __attribute((
nonnull(1, 2, 3)));
49 const void *
const key)
50 __attribute((warn_unused_result,
nonnull(1, 2)));
53 const void *
const key,
55 __attribute((warn_unused_result,
nonnull(1, 2, 3)));
58 const void *
const key)
void * hashtable_cr_get_next(const struct hashtable *const hashtable, const void *const key, void *const pos) __attribute((warn_unused_result
void hashtable_cr_del(struct hashtable *const hashtable, const void *const key) __attribute((nonnull(1
uint8_t key[]
Definition: hashtable.h:40
void hashtable_cr_add(struct hashtable *const hashtable, const void *const key, void *const elem) __attribute((nonnull(1
bool hashtable_cr_new(struct hashtable *const hashtable, const size_t key_len, const size_t full_key_len, const size_t size) __attribute((warn_unused_result
void hashtable_cr_free(struct hashtable *const hashtable) __attribute((nonnull(1)))
Definition: hashtable_cr.c:53
Definition: hashtable.h:45
Efficient, secure hash table.
void void * hashtable_cr_get_first(const struct hashtable *const hashtable, const void *const key) __attribute((warn_unused_result