-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathvector.c
164 lines (129 loc) · 2.61 KB
/
vector.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
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
#include <assert.h>
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include "vector.h"
#ifndef VEC_INITCAP
#define VEC_INITCAP (8)
#endif
inline static void _vector_shift_left(struct vector *vec, size_t index)
{
if (index < vec->count - 1) {
for (size_t i = index; i < vec->count; ++i) {
vec->mem[i] = vec->mem[1 + i];
}
}
--vec->count;
}
int vector_add(struct vector *vec, void *item)
{
int rc = VECE_OK;
if (VECE_OK == (rc = vector_reserve(vec, vec->count + 1))) {
vec->mem[vec->count++] = item;
}
return rc;
}
int vector_apply(struct vector *vec, void (*func)(void *))
{
int rc = VECE_OK;
void *item = NULL;
if (vec && func) {
for (size_t i = 0, j = vector_count(vec); i < j; ++i) {
rc = vector_get(vec, i, &item);
assert(VECE_OK == rc);
func(item);
}
} else {
rc = VECE_NULL_POINTER;
}
return rc;
}
int vector_delete(struct vector *vec, size_t index, void **item)
{
int rc = VECE_OUT_OF_BOUNDS;
if (vec->count > index) {
if (item) {
*item = vec->mem[index];
}
_vector_shift_left(vec, index);
rc = VECE_OK;
}
return rc;
}
int vector_free(struct vector *vec)
{
int rc = VECE_NULL_POINTER;
if (vec) {
free(vec->mem);
rc = vector_init(vec);
}
return rc;
}
int vector_get(struct vector *vec, size_t index, void **item)
{
if (!vec) {
return VECE_NULL_POINTER;
}
if (vec->count > index) {
*item = vec->mem[index];
return VECE_OK;
}
return VECE_OUT_OF_BOUNDS;
}
int vector_init(struct vector *vec)
{
int rc = VECE_NULL_POINTER;
if (vec) {
vec->count = 0;
vec->max = 0;
vec->mem = NULL;
rc = VECE_OK;
}
return rc;
}
int vector_reserve(struct vector *vec, size_t size)
{
if (!vec) {
return VECE_NULL_POINTER;
} else if (size <= vec->max) {
return VECE_OK;
} else if (vec->max) {
do {
vec->max *= 2;
} while (size > vec->max);
} else {
vec->max = VEC_INITCAP;
}
if (!(vec->mem = realloc(vec->mem, vec->max * sizeof(void *)))) {
return ENOMEM == errno ? VECE_OUT_OF_MEMORY : VECE_OK;
}
return VECE_OK;
}
int vector_set(struct vector *vec, size_t index, void *item)
{
if (!vec) {
return VECE_NULL_POINTER;
}
if (vec->count > index) {
vec->mem[index] = item;
return VECE_OK;
}
return VECE_OUT_OF_BOUNDS;
}
int vector_swap(struct vector *vec, size_t idx1, size_t idx2)
{
int rc = VECE_OK;
void *item1 = NULL;
void *item2 = NULL;
if (VECE_OK != (rc = vector_get(vec, idx1, &item1))) {
return rc;
}
if (VECE_OK != (rc = vector_get(vec, idx2, &item2))) {
return rc;
}
rc = vector_set(vec, idx1, item2);
assert(VECE_OK == rc);
rc = vector_set(vec, idx2, item1);
assert(VECE_OK == rc);
return rc;
}