Cthulhu
0.2.10
Cthulhu compiler collection
|
Go to the source code of this file.
Data Structures | |
struct | item_t |
a node in a chain of set entries More... | |
struct | set_t |
an unordered hash set More... | |
Functions | |
STA_DECL set_t * | set_new (size_t size, hash_info_t info, arena_t *arena) |
create a new set More... | |
STA_DECL const void * | set_add (set_t *set, const void *key) |
add a key to a set More... | |
STA_DECL bool | set_contains (const set_t *set, const void *key) |
check if a set contains a key More... | |
STA_DECL void | set_delete (set_t *set, const void *key) |
remove a key from a set More... | |
STA_DECL bool | set_empty (set_t *set) |
check if a set is empty More... | |
STA_DECL void | set_reset (set_t *set) |
clear all keys from a set More... | |
STA_DECL set_iter_t | set_iter (set_t *set) |
acquire a set iterator for a set More... | |
STA_DECL const void * | set_next (set_iter_t *iter) |
get the next item from a set iterator More... | |
STA_DECL bool | set_has_next (set_iter_t *iter) |
check if a set iterator has more items More... | |