docs/html/b__hashmap_8h_source.html

#ifndef B_HASHMAP_H

#define B_HASHMAP_H


#include "stdlib.h"

#include "string.h"

#define TABLE_SIZE 200


typedef struct bht_node {

    char *name;

    void *bht_node_p;

    struct bht_node *next;

} bht_node_t;


typedef struct {

    bht_node_t *buckets[TABLE_SIZE];

} hashmap_t;


unsigned int hash(const char *key);

hashmap_t *create_map(void);

void insert(hashmap_t *map, const char *name, void *bht_node_p);

void* get(hashmap_t *map, const char *name);

void free_map(hashmap_t *map);


#endif

create_map
hashmap_t * create_map(void)
Allocate and initialize a new hashmap.
Definition b_hashmap.c:36

insert
void insert(hashmap_t *map, const char *name, void *bht_node_p)
Insert a key-value pair into the hashmap.
Definition b_hashmap.c:55

hash
unsigned int hash(const char *key)
Compute hash value of a string key.
Definition b_hashmap.c:20

get
void * get(hashmap_t *map, const char *name)
Retrieve a value from the hashmap by key.
Definition b_hashmap.c:75

free_map
void free_map(hashmap_t *map)
Free all memory used by the hashmap.
Definition b_hashmap.c:96

bht_node
Definition b_hashmap.h:8

hashmap_t
Definition b_hashmap.h:14