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
|
#include <stdio.h>
#include <stdlib.h>
#include "array.h"
Array array_init(size_t capacity) {
return (Array) {
.items = calloc(capacity, sizeof(int)),
.capacity = capacity,
.length = 0
};
}
int array_push(Array *a, int value) {
if (a->length == a->capacity) {
array_resize(a, a->capacity * 1.5);
}
a->items[a->length++] = value;
return 0;
}
int array_pop(Array *a) {
if (a->length > 0) {
int item = a->items[a->length-1];
size_t capacity = a->capacity - (a->capacity - a->length);
if (array_resize(a, capacity) == EXIT_SUCCESS)
a->length--;
return item;
}
return 1;
}
int array_resize(Array *a, size_t capacity) {
a->items = realloc(a->items, capacity * sizeof(int));
if (a->items == NULL) {
fprintf(stderr, "Memory reallocation failed\n");
return EXIT_FAILURE;
}
a->capacity = capacity;
return EXIT_SUCCESS;
}
void array_free(Array *a) {
free(a->items);
a->items = NULL;
a->length = a->capacity = 0;
}
void array_print(Array *a) {
printf("Capacity: %zu\t length: %zu\n",
a->capacity, a->length);
puts("Array items:");
for (int i = 0; i < a->capacity; ++i) {
if (i > a->length) {
printf("%i: unused\n", i);
} else {
printf("%i: %i\n", i, a->items[i]);
}
}
}
|
