-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlhs_vector.c
149 lines (126 loc) · 3.08 KB
/
lhs_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
#include "lhs_vector.h"
#include "lhs_vm.h"
#define LHS_VECTORSIZE 4
#define lhsvector_castsize(v, x) ((x) * (v)->esize)
#define lhsvector_castat(v, x) \
((char*)((v)->nodes) + lhsvector_castsize(v, x))
static int lhsvector_grow(void* vm, LHSVector* vector,
size_t osize, size_t nsize)
{
if (nsize < LHS_VECTORSIZE)
{
return LHS_FALSE;
}
vector->nodes = lhsmem_renewobject
(
lhsvm_castvm(vm),
vector->nodes,
osize * vector->esize,
nsize * vector->esize
);
vector->size = nsize;
return LHS_TRUE;
}
int lhsvector_init(void* vm, LHSVector* vector, size_t esize, size_t n)
{
vector->esize = esize;
vector->nodes = 0;
vector->size = 0;
vector->usize = 0;
return lhsvector_grow
(
vm,
vector,
0,
max(n, LHS_VECTORSIZE)
);
}
int lhsvector_push(void* vm, LHSVector* vector, void* data,
size_t* index)
{
if (vector->usize >= vector->size &&
!lhsvector_grow(vm, vector, vector->size, vector->size << 1))
{
return LHS_FALSE;
}
memcpy(lhsvector_castat(vector, vector->usize), data, vector->esize);
if (index)
{
*index = vector->usize;
}
++vector->usize;
return LHS_TRUE;
}
void lhsvector_pop(void* vm, LHSVector* vector, size_t n)
{
vector->usize -= n;
if (vector->usize <= vector->size >> 2)
{
lhsvector_grow(vm, vector, vector->size, vector->size >> 1);
}
}
void lhsvector_remove(void* vm, LHSVector* vector, size_t index)
{
if (index >= vector->usize)
{
return;
}
memmove
(
lhsvector_castat(vector, index),
lhsvector_castat(vector, index + 1),
lhsvector_castsize(vector, vector->size - index - 1)
);
if (--vector->usize <= vector->size >> 2)
{
lhsvector_grow(vm, vector, vector->size, vector->size >> 1);
}
}
void* lhsvector_at(void* vm, LHSVector* vector, size_t index)
{
if (index >= vector->usize)
{
return 0;
}
return lhsvector_castat(vector, index);
}
void* lhsvector_increment(void* vm, LHSVector* vector)
{
if (vector->usize >= vector->size)
{
lhsvector_grow(vm, vector, vector->size, vector->size << 1);
}
void* element = lhsvector_castat(vector, vector->usize);
++vector->usize;
return element;
}
void* lhsvector_back(void* vm, LHSVector* vector)
{
if (vector->usize <= 0)
{
return 0;
}
return lhsvector_castat(vector, vector->usize - 1);
}
void lhsvector_foreach(void* vm, LHSVector* vector,
lhsvector_iterator iterator)
{
for (size_t i = 0; i < vector->usize; ++i)
{
iterator(vm, vector, lhsvector_castat(vector, i));
}
}
void lhsvector_uninit(void* vm, LHSVector* vector)
{
if (vector->size)
{
lhsmem_freeobject
(
lhsvm_castvm(vm),
vector->nodes,
lhsvector_castsize(vector, vector->size)
);
}
vector->size = 0;
vector->usize = 0;
}