hash.h


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37

#ifndef HASH_H
#define HASH_H

#include <string.h>

#include "macro.h"

unsigned long hash(char*);

#define HASHT(T)     TEMPL(hash_t, T)

#endif /* HASH_H */
#ifdef TYPE

typedef struct {
	int size;
	int item_count;
	/* NOTE
	 * Hash maps are always assumed to hold pointers to objects
	 * Double pointer means a list of pointers.
	 */
	TYPE** values;
} TABLE(TYPE);

int PUSH(HASHT(TYPE)) ( HASHT(TYPE)* table, TYPE* value );

INIT_F(HASHT(TYPE), int init_size );

TYPE* GET(HASHT(TYPE)) ( HASHT(TYPE)* table, char* key );

/*
 * Free's all item's stored in table.
 * And finally frees table.
 */
FREE_F(HASHT(TYPE));

#endif /* HASH_H */