|
1
|
1 module internal.arrays;
|
|
|
2
|
|
|
3 extern(C):
|
|
|
4
|
|
40
|
5 // per-element array init routines
|
|
|
6
|
|
1
|
7 void _d_array_init_i1(bool* a, size_t n, bool v)
|
|
|
8 {
|
|
|
9 auto p = a;
|
|
|
10 auto end = a+n;
|
|
|
11 while (p !is end)
|
|
|
12 *p++ = v;
|
|
|
13 }
|
|
|
14
|
|
|
15 void _d_array_init_i8(ubyte* a, size_t n, ubyte v)
|
|
|
16 {
|
|
|
17 auto p = a;
|
|
|
18 auto end = a+n;
|
|
|
19 while (p !is end)
|
|
|
20 *p++ = v;
|
|
|
21 }
|
|
|
22
|
|
|
23 void _d_array_init_i16(ushort* a, size_t n, ushort v)
|
|
|
24 {
|
|
|
25 auto p = a;
|
|
|
26 auto end = a+n;
|
|
|
27 while (p !is end)
|
|
|
28 *p++ = v;
|
|
|
29 }
|
|
|
30
|
|
|
31 void _d_array_init_i32(uint* a, size_t n, uint v)
|
|
|
32 {
|
|
|
33 auto p = a;
|
|
|
34 auto end = a+n;
|
|
|
35 while (p !is end)
|
|
|
36 *p++ = v;
|
|
|
37 }
|
|
|
38
|
|
|
39 void _d_array_init_i64(ulong* a, size_t n, ulong v)
|
|
|
40 {
|
|
|
41 auto p = a;
|
|
|
42 auto end = a+n;
|
|
|
43 while (p !is end)
|
|
|
44 *p++ = v;
|
|
|
45 }
|
|
|
46
|
|
|
47 void _d_array_init_float(float* a, size_t n, float v)
|
|
|
48 {
|
|
|
49 auto p = a;
|
|
|
50 auto end = a+n;
|
|
|
51 while (p !is end)
|
|
|
52 *p++ = v;
|
|
|
53 }
|
|
|
54
|
|
|
55 void _d_array_init_double(double* a, size_t n, double v)
|
|
|
56 {
|
|
|
57 auto p = a;
|
|
|
58 auto end = a+n;
|
|
|
59 while (p !is end)
|
|
|
60 *p++ = v;
|
|
|
61 }
|
|
|
62
|
|
|
63 void _d_array_init_pointer(void** a, size_t n, void* v)
|
|
|
64 {
|
|
|
65 auto p = a;
|
|
|
66 auto end = a+n;
|
|
|
67 while (p !is end)
|
|
|
68 *p++ = v;
|
|
|
69 }
|
|
40
|
70
|
|
|
71 // array comparison routines
|
|
|
72 int memcmp(void*,void*,size_t);
|
|
|
73
|
|
|
74 bool _d_static_array_eq(void* lhs, void* rhs, size_t bytesize)
|
|
|
75 {
|
|
|
76 if (lhs is rhs)
|
|
|
77 return true;
|
|
|
78 return memcmp(lhs,rhs,bytesize) == 0;
|
|
|
79 }
|
|
|
80
|
|
|
81 bool _d_static_array_neq(void* lhs, void* rhs, size_t bytesize)
|
|
|
82 {
|
|
|
83 if (lhs is rhs)
|
|
|
84 return false;
|
|
|
85 return memcmp(lhs,rhs,bytesize) != 0;
|
|
|
86 }
|
|
|
87
|
|
52
|
88 bool _d_dyn_array_eq(void[] lhs, void[] rhs)
|
|
|
89 {
|
|
|
90 if (lhs.length != rhs.length)
|
|
|
91 return false;
|
|
|
92 else if (lhs is rhs)
|
|
|
93 return true;
|
|
|
94 return memcmp(lhs.ptr,rhs.ptr,lhs.length) == 0;
|
|
|
95 }
|
|
|
96
|
|
|
97 bool _d_dyn_array_neq(void[] lhs, void[] rhs)
|
|
|
98 {
|
|
|
99 if (lhs.length != rhs.length)
|
|
|
100 return true;
|
|
|
101 else if (lhs is rhs)
|
|
|
102 return false;
|
|
|
103 return memcmp(lhs.ptr,rhs.ptr,lhs.length) != 0;
|
|
|
104 }
|
|
|
105
|
|
|
106 // for array cast
|
|
|
107 size_t _d_array_cast_len(size_t len, size_t elemsz, size_t newelemsz)
|
|
|
108 {
|
|
|
109 if (newelemsz == 1) {
|
|
|
110 return len*elemsz;
|
|
|
111 }
|
|
|
112 else if (len % newelemsz) {
|
|
|
113 throw new Exception("Bad array cast");
|
|
|
114 }
|
|
|
115 return (len*elemsz)/newelemsz;
|
|
|
116 }
|
