-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathtest.c
84 lines (73 loc) · 2.33 KB
/
test.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
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* test.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: psprawka <psprawka@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2018/10/06 13:20:36 by psprawka #+# #+# */
/* Updated: 2018/10/07 13:24:24 by psprawka ### ########.fr */
/* */
/* ************************************************************************** */
#include "includes/libft.h"
#include "includes/libft_rbtree.h"
#include "string.h"
#include <stdio.h>
typedef struct s_rbdata
{
int size;
// int8_t if_free;
} t_rbdata;
int cmp(void *n1, void *n2)
{
if (((t_rbdata *)n1)->size > ((t_rbdata *)n2)->size)
return (1);
return (0);
}
t_rbdata *create_data(int size)
{
t_rbdata *node;
if (!(node = (t_rbdata *)malloc(sizeof(t_rbdata))))
return (NULL);
node->size = size;
return (node);
}
void free_data(void *data)
{
data = NULL;
}
int main(int ac, char **av)
{
int i = 1;
t_rbtree *root = NULL;
t_rbtree *to_insert;
t_rbtree *to_delete = NULL;
while (i < ac)
{
to_insert = ft_create_rbtree(create_data(atoi(av[i])));
if (to_delete == NULL)
to_delete = to_insert;
printf("Created %s\n", av[i]);
ft_insert_rbtree(&root, to_insert, &cmp);
printf("----------------------------------------------\n");
ft_print_rbtree(root);
printf("----------------------------------------------\n");
printf("Inserted %s\n", av[i]);
if (!(i % 4))
{
if (to_delete != root)
{
printf("\nDELETING %d...\n", ((t_rbdata *)to_delete->data)->size);
ft_delete_rbtree(&root, to_delete, &free_data);
printf("DELETED:\n----------------------------------------------\n");
ft_print_rbtree(root);
printf("----------------------------------------------\n");
}
to_delete = NULL;
}
i++;
}
printf("------------------FINAL TREE-----------------\n");
ft_print_rbtree(root);
return (0);
}