-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbitsPrioQ.go
131 lines (119 loc) · 2.05 KB
/
bitsPrioQ.go
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
package vEB
import (
"fmt"
"math"
"math/bits"
)
// BitsPrioQ is an implementation of the PrioQ interface using an array of bitmaps.
type BitsPrioQ struct {
data []uint64
mask uint64
u int
}
func (v *BitsPrioQ) Init(u int, fullInit bool) {
a := int(math.Exp2(math.Ceil(math.Log2(float64(u) / 64))))
v.data = make([]uint64, a)
v.mask = 63
v.u = u
}
func (v *BitsPrioQ) Insert(x int) {
ind := x >> 6
if ind >= len(v.data) {
fmt.Println("Cannot insert numbers bigger than", v.u)
return
}
v.data[ind] |= 1 << (uint64(x) & v.mask)
}
func (v *BitsPrioQ) Delete(x int) {
if !v.Member(x) {
return
}
v.data[x>>6] ^= 1 << (uint64(x) & v.mask)
}
func (v *BitsPrioQ) Succ(x int) int {
if x < 0 {
if v.Member(0) {
return 0
}
return v.Succ(0)
}
ind := x >> 6
u := v.data[ind]
low := uint64(x) & v.mask
if u >= 1<<(low+1) {
u = u & (math.MaxUint64 << (low + 1))
h := x >> 6 << 6
t := bits.TrailingZeros64(u)
return h + t
}
ind++
for ind < len(v.data) {
u = v.data[ind]
if u != 0 {
h := ind << 6
t := bits.TrailingZeros64(u)
return h + t
}
ind++
}
return -1
}
func (v *BitsPrioQ) Pred(x int) int {
if x < 0 {
return -1
}
if x > v.u-1 {
return v.Max()
}
ind := x >> 6
u := v.data[ind]
low := uint64(x) & v.mask
u &= (1 << low) - 1 // mask: only lower bits
if u > 0 {
h := x >> 6 << 6
t := 64 - bits.LeadingZeros64(u) - 1
return h + t
}
ind--
for ind >= 0 {
u = v.data[ind]
if u != 0 {
h := ind << 6
t := 64 - bits.LeadingZeros64(u) - 1
return h + t
}
ind--
}
return -1
}
func (v *BitsPrioQ) Min() int {
ind := 0
var u uint64
for ind < len(v.data) {
u = v.data[ind]
if u != 0 {
h := ind << 6
t := bits.TrailingZeros64(u)
return h + t
}
ind++
}
return -1
}
func (v *BitsPrioQ) Max() int {
ind := len(v.data) - 1
var u uint64
for ind >= 0 {
u = v.data[ind]
if u != 0 {
h := ind << 6
t := 64 - bits.LeadingZeros64(u) - 1
return h + t
}
ind--
}
return -1
}
func (v *BitsPrioQ) Member(x int) bool {
return v.data[x>>6]&(1<<(uint64(x)&v.mask)) != 0
}