-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathbitArray.go
More file actions
141 lines (122 loc) · 2.6 KB
/
Copy pathbitArray.go
File metadata and controls
141 lines (122 loc) · 2.6 KB
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
package disttopk
import (
"encoding/binary"
"errors"
"fmt"
"io"
)
type BitArray struct {
data []byte
num_bits uint
}
func NewBitArray(num_bits uint) *BitArray {
n_bytes := getNumBytes(num_bits)
return &BitArray{make([]byte, n_bytes), uint(num_bits)}
}
func getNumBytes(num_bits uint) uint {
n_bytes := uint(0)
if num_bits%8 == 0 {
n_bytes = num_bits / 8
} else {
n_bytes = (num_bits / 8) + 1
}
return n_bytes
}
func (b *BitArray) NumBits() uint {
return b.num_bits
}
func (b *BitArray) ByteSize() int {
return len(b.data) + 4
}
func (t *BitArray) CountSetBit() uint {
c := uint(0)
for _, b := range t.data {
c += t.countSetBitByte(b)
}
return c
}
func (t *BitArray) VisitSetBit(visitor func(k int)) {
for index := uint(0); index < t.num_bits; index++ {
if t.Check(index) {
visitor(int(index))
}
}
}
func (t *BitArray) countSetBitByte(v byte) uint {
c := uint(0) // c accumulates the total bits set in v
for ; v > 0; c++ {
v &= v - 1 // clear the least significant bit set
}
return c
}
func (b *BitArray) Set(idx uint) {
old := b.data[idx/8]
mask := byte(1 << (idx % 8))
b.data[idx/8] = (old | mask)
}
func (b *BitArray) Clear(idx uint) {
old := b.data[idx/8]
mask := byte(1 << (idx % 8))
b.data[idx/8] = (old &^ mask)
}
func (b *BitArray) SetValue(idx uint, v bool) {
if v {
b.Set(idx)
} else {
b.Clear(idx)
}
}
func (b *BitArray) Check(idx uint) bool {
old := b.data[idx/8]
mask := byte(1 << (idx % 8))
v := (old & mask)
return v != 0
}
func (b *BitArray) Serialize(w io.Writer) error {
var n uint32 = uint32(b.num_bits)
if err := binary.Write(w, binary.BigEndian, &n); err != nil {
return err
}
if _, err := w.Write(b.data); err != nil {
return err
}
return nil
}
func (b *BitArray) Deserialize(r io.Reader) error {
var num_bits uint32 = uint32(0)
if err := binary.Read(r, binary.BigEndian, &num_bits); err != nil {
return err
}
b.num_bits = uint(num_bits)
num_bytes := getNumBytes(uint(num_bits))
b.data = make([]byte, num_bytes)
if wrote, err := r.Read(b.data); err != nil || wrote != int(num_bytes) {
if err == nil {
return errors.New(fmt.Sprintln("Less bytes than expected", wrote, num_bytes))
}
return err
}
return nil
}
func (b *BitArray) MergeOr(arg *BitArray) {
if b.num_bits != arg.num_bits {
panic("Must have same num bits to merge")
}
for k, _ := range b.data {
b.data[k] |= arg.data[k]
}
}
func (b *BitArray) Equal(arg *BitArray) bool {
if b.num_bits != arg.num_bits {
return false
}
if len(b.data) != len(arg.data) {
return false
}
for k, v := range b.data {
if arg.data[k] != v {
return false
}
}
return true
}