|
AquilaOS documentation
How it works, and its code
|
A hash table. More...
#include <hashmap.h>
Data Fields | |
| size_t | count |
| size_t | buckets_nr |
| struct queue * | buckets |
| int(*) | eq (void *a, void *b) |
| struct queue* hashmap::buckets |
Definition at line 36 of file hashmap.h.
Referenced by hashmap_free(), hashmap_grow(), hashmap_insert(), hashmap_lookup(), hashmap_new(), hashmap_node_remove(), and hashmap_replace().
| size_t hashmap::buckets_nr |
Definition at line 35 of file hashmap.h.
Referenced by hashmap_free(), hashmap_grow(), hashmap_insert(), hashmap_lookup(), hashmap_new(), hashmap_node_remove(), and hashmap_replace().
| size_t hashmap::count |
Definition at line 33 of file hashmap.h.
Referenced by hashmap_insert(), hashmap_lookup(), hashmap_node_remove(), hashmap_replace(), and vnode_pages_update().
| int(*) hashmap::eq(void *a, void *b) |
Definition at line 39 of file hashmap.h.
Referenced by hashmap_lookup(), hashmap_new(), and hashmap_replace().