-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathvector.c
More file actions
158 lines (154 loc) · 3.62 KB
/
Copy pathvector.c
File metadata and controls
158 lines (154 loc) · 3.62 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
#include "vector.h"
#include <memory.h>
#include <malloc.h>
#include <stdlib.h>
#include <stddef.h>
vector _cvec_new(size_t byte_len) {
vector vec;
vec.byte_len = byte_len;
vec.start = NULL;
vec.size = 0;
vec.cap = 0;
return vec;
}
vector _cvec_new_filled(size_t size, size_t byte_len, const pvoid_t element) {
vector vec = _cvec_new(byte_len);
_cvec_reserve(&vec, size);
for (size_t i = 0; i < size; ++i) {
_cvec_push(&vec, element);
}
return vec;
}
void _cvec_fill(vector* vec, const pvoid_t element) {
for (size_t i = 0; i < vec->size; ++i) {
memcpy (
vec->start + (i * vec->byte_len),
element,
vec->byte_len
);
}
}
void _cvec_clear(vector* vec) {
vec->size = 0;
}
void _cvec_free(vector* vec) {
free(vec->start);
vec = NULL;
}
void _cvec_push(vector* vec, const pvoid_t element) {
if (vec->size == vec->cap) {
++vec->cap;
_cvec_realloc(vec);
}
memcpy (
vec->start+(vec->byte_len * vec->size),
element,
vec->byte_len
);
++vec->size;
}
void _cvec_pop(vector* vec) {
if (vec->size <= 0) {
exit(EXIT_INVALID_ALLOCATON);
}
--vec->size;
}
void _cvec_reserve(vector* vec, size_t additional) {
if (additional <= 0) { return; }
vec->cap += additional;
_cvec_realloc(vec);
}
pvoid_t _cvec_at(vector* vec, size_t ind) {
if (ind >= vec->size || ind < 0) {
exit(EXIT_INVALID_ALLOCATON);
}
return vec->start+(ind*vec->byte_len);
}
void _cvec_realloc(vector* vec) {
pvoid_t copy_buf = malloc(vec->cap * vec->byte_len);
memcpy (
copy_buf,
vec->start,
(vec->size) * vec->byte_len
);
free(vec->start);
vec->start = copy_buf;
}
void _cvec_reverse(vector* vec) {
pvoid_t buffer = malloc(vec->cap * vec->byte_len);
for (size_t i = vec->size; i >= 0; --i) {
memcpy (
buffer+((vec->size - i-1) * vec->byte_len),
vec->start + (i * vec->byte_len),
vec->byte_len
);
}
free(vec->start);
vec->start = buffer;
}
void _cvec_remove(vector* vec, size_t ind) {
if (vec->size <= 0 ) {
return;
}
if (ind < 0 || ind >= vec->size) {
exit(EXIT_INVALID_ALLOCATON);
}
if (ind == vec->size - 1) {
_cvec_pop(vec);
return;
}
else {
memcpy (
vec->start + (ind * vec->byte_len),
vec->start + ((ind+1) * vec->byte_len),
(vec->size - ind) * vec->byte_len
);
--vec->size;
}
}
void _cvec_insert(vector* vec, const pvoid_t element, size_t ind) {
if (ind < 0 || ind > vec->size) {
exit(EXIT_INVALID_ALLOCATON);
}
if (ind == vec->size) {
_cvec_push(vec, element);
return;
}
if (vec->size == vec->cap) {
++vec->cap;
}
pvoid_t buf = malloc(vec->cap * vec->byte_len);
if (ind > 0) {
memcpy (
buf,
vec->start,
ind * vec->byte_len
);
}
memcpy (
buf + (ind * vec->byte_len),
element,
vec->byte_len
);
memcpy (
buf + ((ind+1) * vec->byte_len),
vec->start + (ind * vec->byte_len),
(vec->size - ind) * vec->byte_len
);
free(vec->start);
vec->start = buf;
++vec->size;
}
vector _cvec_clone(vector* vec) {
vector nv;
nv.byte_len = vec->byte_len;
nv.cap = vec->cap;
nv.size = vec->size;
nv.start = malloc(nv.cap * nv.byte_len);
memcpy (
nv.start,
vec->start,
nv.size * nv.byte_len
);
return nv;
}