-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdynamic_array.c
More file actions
169 lines (136 loc) · 3.11 KB
/
Copy pathdynamic_array.c
File metadata and controls
169 lines (136 loc) · 3.11 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
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
160
161
162
163
164
165
166
167
168
169
#include <stdlib.h>
#include "dynamic_array.h"
/*
typedef struct {
int* data;
size_t size;
size_t capacity;
} dynamic_array_t;
*/
// lifecycle
dynamic_array_t* create_dynamic_array() {
dynamic_array_t* array = malloc(sizeof(dynamic_array_t));
if (!array) {
return NULL;
}
array->data = malloc(10 * sizeof(int));
if (!array->data) {
free(array);
return NULL;
}
array->size = 0;
array->capacity = 10;
return array;
}
void free_dynamic_array(dynamic_array_t* array) {
if (array) {
free(array->data);
free(array);
}
}
// core operators
static int dynamic_array_resize(dynamic_array_t* array) {
if (!array || !array->data) {
return 0;
}
int* new_data = realloc(array->data, 2 * array->capacity * sizeof(int));
if (!new_data) {
return 0;
}
array->data = new_data;
array->capacity *= 2;
return 1;
}
int dynamic_array_push(dynamic_array_t* array, int value) {
if (!array || !array->data) {
return 0;
}
// resize if needed
if (array->size == array->capacity) {
if (!dynamic_array_resize(array)) {
return 0;
}
}
array->data[array->size] = value;
array->size++;
return 1;
}
int dynamic_array_pop(dynamic_array_t* array, int* out) {
if (!array || !array->data) {
return 0;
}
if (array->size == 0) {
return 0;
}
array->size--;
if (out) {
*out = array->data[array->size];
}
return 1;
}
int dynamic_array_get(const dynamic_array_t* array, size_t index, int* out) {
if (!array || !array->data || !out) {
return 0;
}
if (index >= array->size) {
return 0;
}
*out = array->data[index];
return 1;
}
int dynamic_array_set(dynamic_array_t* array, size_t index, int value) {
if (!array || !array->data) {
return 0;
}
if (index >= array->size) {
return 0;
}
array->data[index] = value;
return 1;
}
int dynamic_array_insert(dynamic_array_t* array, size_t index, int value) {
if (!array || !array->data) {
return 0;
}
if (index > array->size) {
return 0;
}
// resize if needed
if (array->size == array->capacity) {
if (!dynamic_array_resize(array)) {
return 0;
}
}
// shift elements right
for (size_t i = array->size; i > index; i--) {
array->data[i] = array->data[i - 1];
}
array->data[index] = value;
array->size++;
return 1;
}
int dynamic_array_remove(dynamic_array_t* array, size_t index, int* out) {
if (!array || !array->data) {
return 0;
}
if (index >= array->size) {
return 0;
}
if (out) {
*out = array->data[index];
}
// shift elements left
for (size_t i = index; i < array->size - 1; i++) {
array->data[i] = array->data[i + 1];
}
array->size--;
return 1;
}
// helper functions
int dynamic_array_size(const dynamic_array_t* array, size_t* out) {
if (!array || !out) {
return 0;
}
*out = array->size;
return 1;
}