-
Notifications
You must be signed in to change notification settings - Fork 0
/
prioritybitmap.go
138 lines (125 loc) · 2.43 KB
/
prioritybitmap.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
132
133
134
135
136
137
138
// Package prioritybitmap implements a set of integers ordered by attached
// priorities.
package prioritybitmap
import (
"sync"
"github.com/anacrolix/missinggo/orderedmap"
)
var (
bitSets = sync.Pool{
New: func() interface{} {
return make(map[int]struct{}, 1)
},
}
)
type PriorityBitmap struct {
// Protects against unsychronized modifications to bitsets and
mu sync.Mutex
om orderedmap.OrderedMap
// From bit index to priority
priorities map[int]int
}
func (me *PriorityBitmap) Clear() {
me.om = nil
me.priorities = nil
}
func (me *PriorityBitmap) deleteBit(bit int) {
p, ok := me.priorities[bit]
if !ok {
return
}
switch v := me.om.Get(p).(type) {
case int:
case map[int]struct{}:
delete(v, bit)
if len(v) != 0 {
return
}
bitSets.Put(v)
}
me.om.Unset(p)
if me.om.Len() == 0 {
me.om = nil
}
}
func bitLess(l, r interface{}) bool {
return l.(int) < r.(int)
}
func (me *PriorityBitmap) lazyInit() {
me.om = orderedmap.New(func(l, r interface{}) bool {
return l.(int) < r.(int)
})
me.priorities = make(map[int]int)
}
func (me *PriorityBitmap) Set(bit int, priority int) {
me.deleteBit(bit)
if me.priorities == nil {
me.priorities = make(map[int]int)
}
me.priorities[bit] = priority
if me.om == nil {
me.om = orderedmap.New(bitLess)
}
_v, ok := me.om.GetOk(priority)
if !ok {
me.om.Set(priority, bit)
return
}
switch v := _v.(type) {
case int:
newV := bitSets.Get().(map[int]struct{})
newV[v] = struct{}{}
newV[bit] = struct{}{}
me.om.Set(priority, newV)
case map[int]struct{}:
v[bit] = struct{}{}
}
}
func (me *PriorityBitmap) Remove(bit int) {
me.mu.Lock()
defer me.mu.Unlock()
me.deleteBit(bit)
delete(me.priorities, bit)
if len(me.priorities) == 0 {
me.priorities = nil
}
if me.om != nil && me.om.Len() == 0 {
me.om = nil
}
}
func (me *PriorityBitmap) Iter(f func(value interface{}) bool) {
me.IterTyped(func(i int) bool {
return f(i)
})
}
func (me *PriorityBitmap) IterTyped(_f func(i int) bool) {
me.mu.Lock()
defer me.mu.Unlock()
if me == nil || me.om == nil {
return
}
f := func(i int) bool {
me.mu.Unlock()
defer me.mu.Lock()
return _f(i)
}
me.om.Iter(func(value interface{}) bool {
switch v := value.(type) {
case int:
return f(v)
case map[int]struct{}:
for i := range v {
if !f(i) {
return false
}
}
}
return true
})
}
func (me *PriorityBitmap) IsEmpty() bool {
if me.om == nil {
return true
}
return me.om.Len() == 0
}