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
|
use "alloc.use"
use "extremum.use"
use "mk.use"
use "slfill.use"
use "types.use"
pkg std =
type bitset = struct
bits : size[:]
;;
const mkbs : (-> bitset#)
const bsdup : (bs : bitset# -> bitset#)
const bsfree : (bs : bitset# -> void)
const bsmax : (a : bitset# -> size)
generic bsput : (bs : bitset#, v : @a::(integral,numeric) -> void)
generic bsdel : (bs : bitset#, v : @a::(integral,numeric) -> void)
generic bshas : (bs : bitset#, v : @a::(integral,numeric) -> bool)
const bsdiff : (a : bitset#, b : bitset# -> void)
const bsintersect : (a : bitset#, b : bitset# -> void)
const bsunion : (a : bitset#, b : bitset# -> void)
const bseq : (a : bitset#, b : bitset# -> bool)
const bsissubset : (a : bitset#, b : bitset# -> bool)
const bsclear : (bs : bitset# -> bitset#)
;;
const mkbs = {
-> zalloc()
}
const bsdup = {bs
-> mk([.bits=bs.bits])
}
const bsfree = {bs
slfree(bs.bits)
free(bs)
}
const bsclear = {bs
slfill(bs.bits, 0)
-> bs
}
const bsmax = {bs
-> bs.bits.len * sizeof(size) * 8
}
generic bsput = {bs, v
var idx
var off
idx = (v castto(size)) / (8*sizeof(size))
off = (v castto(size)) % (8*sizeof(size))
ensurespace(bs, idx)
bs.bits[idx] |= (1 << off)
}
generic bsdel = {bs, v
var idx
var off
idx = (v castto(size)) / (8*sizeof(size))
off = (v castto(size)) % (8*sizeof(size))
ensurespace(bs, idx)
bs.bits[idx] &= ~(1 << off)
}
generic bshas = {bs, v
var idx
var off
idx = (v castto(size)) / (8*sizeof(size))
off = (v castto(size)) % (8*sizeof(size))
ensurespace(bs, idx)
-> (bs.bits[idx] & (1 << off)) != 0
}
const bsunion = {a, b
var i
eqsz(a, b)
for i = 0; i < b.bits.len; i++
a.bits[i] |= b.bits[i]
;;
}
const bsintersect = {a, b
var i, n
n = min(a.bits.len, b.bits.len)
for i = 0; i < n; i++
a.bits[i] &= b.bits[i]
;;
}
const bsdiff = {a, b
var i
ensurespace(b, a.bits.len)
for i = 0; i < a.bits.len; i++
a.bits[i] &= ~b.bits[i]
;;
}
const bsissubset = {a, b
var i
eqsz(a, b);
for i = 0; i < a.bits.len; i++
if (b.bits[i] & a.bits[i]) != b.bits[i]
-> false
;;
;;
-> true
}
const bseq = {a, b
var i
eqsz(a, b)
for i = 0; i < a.bits.len; i++
if a.bits[i] != b.bits[i]
-> false
;;
;;
-> true
}
const ensurespace = {bs, v
if bs.bits.len*8 <= v
bs.bits = slzgrow(bs.bits, v + 1)
;;
}
const eqsz = {a, b
var sz
sz = max(a.bits.len, b.bits.len)*8
ensurespace(a, sz)
ensurespace(b, sz)
}
|
