-
-
Notifications
You must be signed in to change notification settings - Fork 606
/
bitarray.d
194 lines (167 loc) · 4.36 KB
/
bitarray.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
/**
* Compiler implementation of the
* $(LINK2 http://www.dlang.org, D programming language).
*
* Copyright: Copyright (C) 1999-2020 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/bitarray.d, root/_bitarray.d)
* Documentation: https://dlang.org/phobos/dmd_root_array.html
* Coverage: https://codecov.io/gh/dlang/dmd/src/master/src/dmd/root/bitarray.d
*/
module dmd.root.bitarray;
import core.stdc.stdio;
import core.stdc.string;
import dmd.root.rmem;
struct BitArray
{
nothrow:
alias Chunk_t = size_t;
enum ChunkSize = Chunk_t.sizeof;
enum BitsPerChunk = ChunkSize * 8;
size_t length() const pure nothrow @nogc @safe
{
return len;
}
void length(size_t nlen) pure nothrow
{
immutable ochunks = chunks(len);
immutable nchunks = chunks(nlen);
if (ochunks != nchunks)
{
ptr = cast(size_t*)mem.xrealloc_noscan(ptr, nchunks * ChunkSize);
}
if (nchunks > ochunks)
ptr[ochunks .. nchunks] = 0;
if (nlen & (BitsPerChunk - 1))
ptr[nchunks - 1] &= (cast(Chunk_t)1 << (nlen & (BitsPerChunk - 1))) - 1;
len = nlen;
}
void opAssign(const ref BitArray b)
{
if (!len)
length(b.len);
assert(len == b.len);
memcpy(ptr, b.ptr, bytes(len));
}
bool opIndex(size_t idx) const pure nothrow @nogc
{
import core.bitop : bt;
assert(idx < len);
return !!bt(ptr, idx);
}
void opIndexAssign(bool val, size_t idx) pure nothrow @nogc
{
import core.bitop : btc, bts;
assert(idx < len);
if (val)
bts(ptr, idx);
else
btc(ptr, idx);
}
bool opEquals(const ref BitArray b) const
{
return len == b.len && memcmp(ptr, b.ptr, bytes(len)) == 0;
}
void zero()
{
memset(ptr, 0, bytes(len));
}
/******
* Returns:
* true if no bits are set
*/
bool isZero()
{
const nchunks = chunks(len);
foreach (i; 0 .. nchunks)
{
if (ptr[i])
return false;
}
return true;
}
void or(const ref BitArray b)
{
assert(len == b.len);
const nchunks = chunks(len);
foreach (i; 0 .. nchunks)
ptr[i] |= b.ptr[i];
}
/* Swap contents of `this` with `b`
*/
void swap(ref BitArray b)
{
assert(len == b.len);
const nchunks = chunks(len);
foreach (i; 0 .. nchunks)
{
const chunk = ptr[i];
ptr[i] = b.ptr[i];
b.ptr[i] = chunk;
}
}
~this() pure nothrow
{
debug
{
// Stomp the allocated memory
const nchunks = chunks(len);
foreach (i; 0 .. nchunks)
{
ptr[i] = cast(Chunk_t)0xFEFEFEFE_FEFEFEFE;
}
}
mem.xfree(ptr);
debug
{
// Set to implausible values
len = cast(size_t)0xFEFEFEFE_FEFEFEFE;
ptr = cast(size_t*)cast(size_t)0xFEFEFEFE_FEFEFEFE;
}
}
private:
size_t len; // length in bits
size_t *ptr;
/// Returns: The amount of chunks used to store len bits
static size_t chunks(const size_t len) @nogc nothrow pure @safe
{
return (len + BitsPerChunk - 1) / BitsPerChunk;
}
/// Returns: The amount of bytes used to store len bits
static size_t bytes(const size_t len) @nogc nothrow pure @safe
{
return chunks(len) * ChunkSize;
}
}
unittest
{
BitArray array;
array.length = 20;
assert(array[19] == 0);
array[10] = 1;
assert(array[10] == 1);
array[10] = 0;
assert(array[10] == 0);
assert(array.length == 20);
BitArray a,b;
assert(a != array);
a.length = 200;
assert(a != array);
assert(a.isZero());
a[100] = true;
b.length = 200;
b[100] = true;
assert(a == b);
a.length = 300;
b.length = 300;
assert(a == b);
b[299] = true;
assert(a != b);
assert(!a.isZero());
a.swap(b);
assert(a[299] == true);
assert(b[299] == false);
a = b;
assert(a == b);
}