blob: 95449172f42f6e57ce95e3bedb5bf62bdf200792 (
plain)
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
|
#include "vector.h"
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <stdio.h>
#define START_SIZE 64;
struct vector {
void **base;
int end, limit;
};
vec* vec_new()
{
vec *root;
root = malloc(sizeof(vec));
assert(root);
root->limit = START_SIZE;
root->base = malloc(root->limit * sizeof(void*));
assert(root->base);
return root;
}
vec* vec_with_capacity(n)
int n;
{
vec *root;
root = malloc(sizeof(vec));
assert(root);
root->limit = n;
root->base = malloc(root->limit * sizeof(void*));
assert(root->base);
return root;
}
int vec_size(root)
vec *root;
{
if (!root) {
return -1;
}
return root->end;
}
void vec_resize(root)
vec *root;
{
if (!root)
return;
root->base = reallocarray(root->base, root->limit * 2, sizeof(void*));
assert(root->base);
}
void vec_push(root, item)
vec *root;
void *item;
{
if (!root) {
return;
}
if (root->end >= root->limit) {
vec_resize(root);
}
root->base[root->end++] = item;
}
void* vec_index(root, index)
vec *root;
int index;
{
if (!root || index >= root->end || index < 0) {
return NULL;
}
return root->base[index];
}
void* vec_pop(root)
vec *root;
{
if (!root || root->end == 0) {
return NULL;
}
return root->base[--root->end];
}
void vec_free(root)
vec *root;
{
free(root->base);
root->base = NULL;
free(root);
}
void vec_clear(root)
vec *root;
{
int i;
for (i = 0; i < root->end; i++) {
free(vec_index(root, i));
}
root->end = 0;
}
|
