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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
|
#ifndef MELVIX_DATA_H
#define MELVIX_DATA_H
#include <stdint.h>
// LIST
struct list_node {
struct list_node *prev;
struct list_node *next;
void *val;
};
struct list {
struct list_node *head;
struct list_node *tail;
u32 size;
};
#define foreach(t, list) for (struct list_node *t = list->head; t != NULL; t = t->next)
struct list *list_create();
u32 list_size(struct list *list);
struct list_node *list_insert_front(struct list *list, void *val);
void list_insert_back(struct list *list, void *val);
void *list_remove_node(struct list *list, struct list_node *node);
void *list_remove_front(struct list *list);
void *list_remove_back(struct list *list);
void list_push(struct list *list, void *val);
struct list_node *list_pop(struct list *list);
void list_enqueue(struct list *list, void *val);
struct list_node *list_dequeue(struct list *list);
void *list_peek_front(struct list *list);
void *list_peek_back(struct list *list);
void list_destroy(struct list *list);
void listnode_destroy(struct list_node *node);
int list_contain(struct list *list, void *val);
struct list_node *list_get_node_by_index(struct list *list, int index);
void *list_remove_by_index(struct list *list, int index);
struct list *str_split(const char *str, const char *delim, u32 *numtokens);
char *list_to_str(struct list *list, const char *delim);
// Tree
struct tree_node {
struct list *children;
void *value;
};
struct tree {
struct tree_node *root;
};
struct tree *tree_create();
struct tree_node *treenode_create(void *value);
struct tree_node *tree_insert(struct tree *tree, struct tree_node *subroot, void *value);
struct tree_node *tree_find_parent(struct tree *tree, struct tree_node *remove_node,
int *child_index);
struct tree_node *tree_find_parent_recur(struct tree *tree, struct tree_node *remove_node,
struct tree_node *subroot, int *child_index);
void tree_remove(struct tree *tree, struct tree_node *remove_node);
void tree2list_recur(struct tree_node *subroot, struct list *list);
void tree2list(struct tree *tree, struct list *list);
void tree2array(struct tree *tree, void **array, int *size);
void tree2array_recur(struct tree_node *subroot, void **array, int *size);
#endif
|
