/
array.d
317 lines (281 loc) · 7.58 KB
/
array.d
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
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
/**
* Compiler implementation of the
* $(LINK2 http://www.dlang.org, D programming language).
*
* Copyright: Copyright (C) 1999-2018 by The D Language Foundation, All Rights Reserved
* Authors: $(LINK2 http://www.digitalmars.com, Walter Bright)
* License: $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost License 1.0)
* Source: $(LINK2 https://github.com/dlang/dmd/blob/master/src/dmd/root/array.d, root/_array.d)
* Documentation: https://dlang.org/phobos/dmd_root_array.html
* Coverage: https://codecov.io/gh/dlang/dmd/src/master/src/dmd/root/array.d
*/
module dmd.root.array;
import core.stdc.string;
import dmd.root.rmem;
extern (C++) struct Array(T)
{
size_t dim;
T* data;
private:
size_t allocdim;
enum SMALLARRAYCAP = 1;
T[SMALLARRAYCAP] smallarray; // inline storage for small arrays
public:
@disable this(this);
~this() nothrow
{
if (data != &smallarray[0])
mem.xfree(data);
}
const(char)* toChars()
{
static if (is(typeof(T.init.toChars())))
{
const(char)** buf = cast(const(char)**)mem.xmalloc(dim * (char*).sizeof);
size_t len = 2;
for (size_t u = 0; u < dim; u++)
{
buf[u] = data[u].toChars();
len += strlen(buf[u]) + 1;
}
char* str = cast(char*)mem.xmalloc(len);
str[0] = '[';
char* p = str + 1;
for (size_t u = 0; u < dim; u++)
{
if (u)
*p++ = ',';
len = strlen(buf[u]);
memcpy(p, buf[u], len);
p += len;
}
*p++ = ']';
*p = 0;
mem.xfree(buf);
return str;
}
else
{
assert(0);
}
}
void push(T ptr) nothrow
{
reserve(1);
data[dim++] = ptr;
}
void append(typeof(this)* a) nothrow
{
insert(dim, a);
}
void reserve(size_t nentries) nothrow
{
//printf("Array::reserve: dim = %d, allocdim = %d, nentries = %d\n", (int)dim, (int)allocdim, (int)nentries);
if (allocdim - dim < nentries)
{
if (allocdim == 0)
{
// Not properly initialized, someone memset it to zero
if (nentries <= SMALLARRAYCAP)
{
allocdim = SMALLARRAYCAP;
data = SMALLARRAYCAP ? smallarray.ptr : null;
}
else
{
allocdim = nentries;
data = cast(T*)mem.xmalloc(allocdim * (*data).sizeof);
}
}
else if (allocdim == SMALLARRAYCAP)
{
allocdim = dim + nentries;
data = cast(T*)mem.xmalloc(allocdim * (*data).sizeof);
memcpy(data, smallarray.ptr, dim * (*data).sizeof);
}
else
{
/* Increase size by 1.5x to avoid excessive memory fragmentation
*/
auto increment = dim / 2;
if (nentries > increment) // if 1.5 is not enough
increment = nentries;
allocdim = dim + increment;
data = cast(T*)mem.xrealloc(data, allocdim * (*data).sizeof);
}
}
}
void remove(size_t i) nothrow
{
if (dim - i - 1)
memmove(data + i, data + i + 1, (dim - i - 1) * (data[0]).sizeof);
dim--;
}
void insert(size_t index, typeof(this)* a) nothrow
{
if (a)
{
size_t d = a.dim;
reserve(d);
if (dim != index)
memmove(data + index + d, data + index, (dim - index) * (*data).sizeof);
memcpy(data + index, a.data, d * (*data).sizeof);
dim += d;
}
}
void insert(size_t index, T ptr) nothrow
{
reserve(1);
memmove(data + index + 1, data + index, (dim - index) * (*data).sizeof);
data[index] = ptr;
dim++;
}
void setDim(size_t newdim) nothrow
{
if (dim < newdim)
{
reserve(newdim - dim);
}
dim = newdim;
}
ref inout(T) opIndex(size_t i) inout nothrow pure
{
return data[i];
}
inout(T)* tdata() inout nothrow
{
return data;
}
Array!T* copy() const nothrow
{
auto a = new Array!T();
a.setDim(dim);
memcpy(a.data, data, dim * (void*).sizeof);
return a;
}
void shift(T ptr) nothrow
{
reserve(1);
memmove(data + 1, data, dim * (*data).sizeof);
data[0] = ptr;
dim++;
}
void zero() nothrow pure
{
data[0 .. dim] = T.init;
}
T pop() nothrow pure
{
return data[--dim];
}
extern (D) inout(T)[] opSlice() inout nothrow pure
{
return data[0 .. dim];
}
extern (D) inout(T)[] opSlice(size_t a, size_t b) inout nothrow pure
{
assert(a <= b && b <= dim);
return data[a .. b];
}
alias opDollar = dim;
}
struct BitArray
{
nothrow:
size_t length() const pure
{
return len;
}
void length(size_t nlen)
{
immutable obytes = (len + 7) / 8;
immutable nbytes = (nlen + 7) / 8;
// bt*() access memory in size_t chunks, so round up.
ptr = cast(size_t*)mem.xrealloc(ptr,
(nbytes + (size_t.sizeof - 1)) & ~(size_t.sizeof - 1));
if (nbytes > obytes)
(cast(ubyte*)ptr)[obytes .. nbytes] = 0;
len = nlen;
}
bool opIndex(size_t idx) const pure
{
import core.bitop : bt;
assert(idx < length);
return !!bt(ptr, idx);
}
void opIndexAssign(bool val, size_t idx) pure
{
import core.bitop : btc, bts;
assert(idx < length);
if (val)
bts(ptr, idx);
else
btc(ptr, idx);
}
@disable this(this);
~this()
{
mem.xfree(ptr);
}
private:
size_t len;
size_t *ptr;
}
/**
* Exposes the given root Array as a standard D array.
* Params:
* array = the array to expose.
* Returns:
* The given array exposed to a standard D array.
*/
@property T[] asDArray(T)(ref Array!T array)
{
return array.data[0..array.dim];
}
/**
* Splits the array at $(D index) and expands it to make room for $(D length)
* elements by shifting everything past $(D index) to the right.
* Params:
* array = the array to split.
* index = the index to split the array from.
* length = the number of elements to make room for starting at $(D index).
*/
void split(T)(ref Array!T array, size_t index, size_t length)
{
if (length > 0)
{
auto previousDim = array.dim;
array.setDim(array.dim + length);
for (size_t i = previousDim; i > index;)
{
i--;
array[i + length] = array[i];
}
}
}
unittest
{
auto array = Array!int();
array.split(0, 0);
assert([] == array.asDArray);
array.push(1);
array.push(3);
array.split(1, 1);
array[1] = 2;
assert([1, 2, 3] == array.asDArray);
array.split(2, 3);
array[2] = 8;
array[3] = 20;
array[4] = 4;
assert([1, 2, 8, 20, 4, 3] == array.asDArray);
array.split(0, 0);
assert([1, 2, 8, 20, 4, 3] == array.asDArray);
array.split(0, 1);
array[0] = 123;
assert([123, 1, 2, 8, 20, 4, 3] == array.asDArray);
array.split(0, 3);
array[0] = 123;
array[1] = 421;
array[2] = 910;
assert([123, 421, 910, 123, 1, 2, 8, 20, 4, 3] == array.asDArray);
}