-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathexample.c
159 lines (121 loc) · 2.84 KB
/
example.c
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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
#include "array.h"
#include "list.h"
#include "map.h"
#ifndef ARRAY_LEN
#define ARRAY_LEN(arr) (sizeof(arr) / sizeof(arr[0]))
#endif
typedef struct data {
int a;
char *str;
} data_t;
typedef struct data_key {
char key[64];
} data_key_t;
int data_comparator(data_t *d1, data_t *d2)
{
return d1->a - d2->a;
}
int key_comparator(data_key_t k1, data_key_t k2)
{
return strcmp(k1.key, k2.key);
}
int string_comp(char *k1, char *k2)
{
return strcmp(k1, k2);
}
int int_comp(int *a, int *b)
{
return *a - *b;
}
void data_destructor(data_t *d)
{
if (!d)
return;
free(d->str);
free(d);
}
data_t *data_constructor(int a)
{
data_t *p = calloc(1, sizeof(data_t));
if (NULL == p)
return NULL;
else if (NULL == (p->str = calloc(1, 256*sizeof(char))))
{
free(p);
return NULL;
}
p->a = a;
sprintf(p->str, "int as string %d", p->a);
return p;
}
array_generator(int, int_arr, NULL, NULL, int_comp)
parray_generator(data_t *, data_arr, data_constructor, data_destructor, NULL)
map_generator(char *, data_t *, data_map, data_constructor, data_destructor, string_comp)
int main(void)
{
int sts = ERR_OK;
data_map_t *map = NULL;
data_arr_t *arr = NULL;
int_arr_t *iarr = NULL;
data_t *d = NULL;
map_iter(map) *iter;
srand(time(0));
if (NULL == (map = map_new(data_map)) ||
NULL == (arr = parray_new(data_arr)) ||
NULL == (iarr = array_new(int_arr)))
{
sts = ERR_NO_MEM;
goto exit;
}
for (int i = 0; i < 10; ++i)
{
int err = ERR_OK;
data_t *item = NULL;
char key[32] = { 0 };
sprintf(key, "%d", rand() % 100);
item = map_val_new(map, i);
if (ERR_OK != (err = map_push(map, key, item)))
map_val_free(map, item);
item = parray_val_new(arr, i*i);
if (ERR_OK != (err = parray_push(arr, item)))
parray_val_free(arr, item);
array_push(iarr, (&(int) { i*i*i }));
}
printf("------ begin int array -------\n");
int i;
array_for_each_val(iarr, i)
printf("%d\n", i);
{
int *pi = array_find(iarr, (&(int) { 54 }));
if (NULL == pi)
printf("54 is not found!\n");
pi = array_find(iarr, (&(int) { 512 }));
if (pi)
printf("512 is found!\n");
}
printf("------ end int array -------\n\n");
printf("------ begin array -------\n");
parray_for_each(arr, d)
printf("{ %d; %s }\n", d->a, d->str);
printf("------ end array -------\n\n");
printf("------ begin map -------\n\n");
map_for_each(map, iter)
printf("%s: { %d; %s}\n", map_key(iter), map_val(iter)->a, map_val(iter)->str);
printf("\n------ delete some items from map -------\n");
map_for_each_safe(map, node, iter)
{
if (atoi(map_key(iter)) % 2)
map_pop_safe(map, node);
}
map_for_each(map, iter)
printf("%s: { %d; %s}\n", map_key(iter), map_val(iter)->a, map_val(iter)->str);
printf("------ end map -------\n");
exit:
array_free(iarr);
parray_free(arr);
map_free(map);
return sts;
}