-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdynamicArray.c
More file actions
96 lines (84 loc) · 1.97 KB
/
Copy pathdynamicArray.c
File metadata and controls
96 lines (84 loc) · 1.97 KB
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
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define ADD_SIZE 5
struct node{
int x;
int y;
};
struct dynArray {
struct node ** arrayList;
int size;
int occupied;
};
struct dynArray * initDynamicArray() {
struct dynArray * arr = malloc(sizeof(struct dynArray));
arr->size = ADD_SIZE;
arr->occupied = 0;
arr->arrayList = calloc(ADD_SIZE,sizeof(struct node *));
return arr;
}
void dynArrayAddItem(struct dynArray * a, struct node * n) {
if (a->size == a->occupied) {
a->arrayList = (struct node **)realloc(a->arrayList, (a->size+ADD_SIZE)*sizeof(struct node *));
a->size = ADD_SIZE + a->size;
}
a->arrayList[a->occupied] = n;
a->occupied++;
}
struct node * dynArrayget(struct dynArray * a, int idx) {
if (idx >= a->occupied) {
return NULL;
}
return *(a->arrayList+idx);
}
void dynArrayRemoveItem(struct dynArray * a, int idx) {
if(idx < 0 || idx >= a->occupied) {
return;
}
int t;
for(t = idx; t < a->occupied-1; t++) {
a->arrayList[t] = a->arrayList[t+1];
}
a->occupied--;
}
void destroyArray(struct dynArray * a) {
int t;
struct node * n;
for(t = 0; t < a->occupied; t++) {
n = dynArrayget(a, t);
free(n);
// memset(, 0x00, sizeof(struct node *));
}
free(a);
}
int main(int argc, char *argv[]) {
struct dynArray * a = initDynamicArray();
struct node * n1 = malloc(sizeof(struct node));
n1->x = 1;
n1->y = 1;
struct node * n2 = malloc(sizeof(struct node));
n2->x = 2;
n2->y = 2;
dynArrayAddItem(a, n1);
dynArrayAddItem(a, n2);
dynArrayAddItem(a, n1);
dynArrayAddItem(a, n2);
dynArrayAddItem(a, n1);
dynArrayAddItem(a, n1);
struct node * n;
for (int i = 0;i<6;i++) {
n = dynArrayget(a, i);
printf("%d\n", n->y);
}
printf("~~~~~~~\n");
dynArrayRemoveItem(a, 3);
for (int i = 0;i<5;i++) {
n = dynArrayget(a, i);
printf("%d\n", n->y);
// printf("--%p\n",n);
}
// free(n1);
destroyArray(a);// this free function did not support this example. Two same node cannot be in one array
return 1;
}