Struct hashmap

• Defined in File hashmap.h

Struct Documentation

struct hashmap

The hashmap data structure (an associative array).

The elements in this data structure are hashnode objects, and the nodes are the dynamic arrays (darray) used to implement the buckets.

Public Members

uint32_t (*hash)(const void *const key, size_t len)

Hashing function. Can’t be NULL (duh).

struct darray *last_used

Last bucket that was added to/removed from.

struct hashmap_space_mgmt space

Management of all node and element space for the hashmap.

size_t elt_size

Size of data elements for hashmap.

size_t max_elts

Max number of of elements allowed in the hashmap.

size_t n_buckets

Number of of buckets in the hashmap. Does not change after initialization.

struct hashmap_stats stats

Current hashmap statistics

int sort_thresh

Number of of successful adds to wait before automatically sorting hashmap. -1 = do not automatically sort hashmap (sorting must be done manually) via hashmap_sort().

bool_t sorted

Is the hashmap currently sorted?

uint32_t flags

Run time configuration flags. Valid flags are:

• RCSW_ZALLOC

• RCSW_NOALLOC_HANDLE.

• RCSW_NOALLOC_DATA.

• RCSW_NOALLOC_META.

• RCSW_DS_HASHMAP_LINPROB

• RCSW_DS_SORTED

All other flags are ignored.