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
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
|
#ifndef TRIE_H
#define TRIE_H
#include <stdio.h>
#include "macro.h"
#define TRIE(T) TP(trie__, T)
#define TRIE_NODE(T) TP(trie_node__, T)
#define TRIE_INIT(T) CONSTRUCTOR_GEN(trie, T, 0)
#define TRIE_NODE_INIT(T) CONSTRUCTOR_GEN(trie_node, T, 0)
#define TRIE_FREE(T) TP(trie_free__, T)
#define TRIE_NODE_FREE(T) TP(trie_node_free__, T)
#define TRIE_PUT(T) TP(trie_put__, T)
#define TRIE_GET(T) TP(trie_get__, T)
#define TRIE_DOT(T) TP(trie_to_dot__, T)
#define TRIE_DOT_HELP(T) TP(trie_to_dot_helper__, T)
#endif /* TRIE_H */
#ifdef TYPE
typedef struct TRIE_NODE(TYPE) {
char c;
TYPE* value;
struct TRIE_NODE(TYPE)* next;
struct TRIE_NODE(TYPE)* child;
} TRIE_NODE(TYPE);
typedef struct {
TRIE_NODE(TYPE)* root;
} TRIE(TYPE);
int CONSTRUCTOR_DECL ( TRIE(TYPE) );
int CONSTRUCTOR_DECL (TRIE_NODE(TYPE), char c);
int CONSTRUCTOR_DECL (TRIE_NODE(TYPE),
char c, TRIE_NODE(TYPE)* next, TRIE_NODE(TYPE)* child );
int TRIE_PUT(TYPE) ( TRIE(TYPE)* trie, char* key, TYPE* val );
TYPE* TRIE_GET(TYPE) ( TRIE(TYPE)* trie, char* key );
int TRIE_NODE_FREE(TYPE) ( TRIE_NODE(TYPE)* node );
int TRIE_FREE(TYPE) ( TRIE(TYPE)* trie );
int TRIE_DOT(TYPE) ( TRIE(TYPE)*, FILE* );
int TRIE_DOT_HELP(TYPE) ( TRIE_NODE(TYPE)*, FILE* );
#endif /* TYPE */
|
