-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.c
48 lines (44 loc) · 1.17 KB
/
main.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
/*This is just to test the red-black tree*/
#include <stdlib.h>
#include <stdio.h>
#include <stdint.h>
#include "rangeTree.h"
int main(int argc, char **argv)
{
uintptr_t i;
uintptr_t x;
i=0;
while(i<atoi(argv[1]))
{
x=i*500;
addRange((void*)x, 400);
i++;
}
printf("Free result: %d\n", freeRange((void*)(i/2*500)));
/*printRangeTree();*/
printf("About to add %X,%X\n", i*500/2-25, i*500/2-25+100-1);
addRange((void*)(i*500/2-25), 100);
/*Before to between
printRangeTree();*/
printf("About to add %X,%X\n", i*500/2+125, i*500/2+125+1);
addRange((void*)(i*500/2+125), 2);
/*After to Between
printRangeTree();*/
printf("About to add %X,%X\n", i*500/2+128, i*500/2+128 + 500-1);
fflush(stdout);
addRange((void*)(i*500/2+128), 500);
/*after to after
printRangeTree();*/
printf("About to add %X,%X\n", i*500/2, i*500/2 +4);
fflush(stdout);
addRange((void*)(i*500/2), 5);
/*should already exist
printRangeTree();*/
printf("About to add %X,%X\n", 0x627, 0x627 +(0x658-0x627));
fflush(stdout);
addRange((void*)0x627, (0x658-0x627+1));
/*should remove freed node*/
printRangeTree();
deleteTree();
return 0;
}