-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdynamic_array.c
51 lines (40 loc) · 1.19 KB
/
dynamic_array.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
//
// Created by johann on 04/02/17.
//
#include "dynamic_array.h"
#include "misc.h"
void init_array(s_array *my_array, size_t initial_size) {
my_array->array = (char *) malloc(initial_size * sizeof(char));
my_array->used = 0;
my_array->size = initial_size;
}
void insert_in_array(s_array *my_array, char element) {
// if we don't have any more room then we multiply size by 2 and realloc
if (my_array->used == my_array->size) {
my_array->size *= 2;
my_array->array = (char *) (realloc(my_array->array, my_array->size * sizeof(char)));
}
if (my_array->used == 0) {
my_array->array[0] = element;
++my_array->used;
} else if (my_array->used > 0) {
my_array->array[my_array->used] = element;
++my_array->used;
}
}
void free_array(s_array *my_array) {
free(my_array->array);
my_array->array = NULL;
my_array->used = 0;
my_array->size = 0;
}
void reinitialise_array(s_array *to_reint) {
free_array(to_reint);
init_array(to_reint, 1);
}
void concatenate(s_array *left, s_array *right) {
for (int i = 0; i < right->used; ++i) {
insert_in_array(left, right->array[i]);
}
free_array(right);
}