-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathtree.go
86 lines (80 loc) · 1.6 KB
/
tree.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
package gws
import "sync"
type tree struct {
state map[string][]Subscription
sync.RWMutex
}
func (v *tree) Has(sub Subscription) bool {
if sub != nil {
v.RLock()
defer v.RUnlock()
for _, field := range sub.Fields() {
if group, ok := v.state[field]; ok {
for _, s := range group {
if s == sub {
return true
}
}
}
}
}
return false
}
func (v *tree) Add(sub Subscription, enforce ...bool) bool {
if sub != nil && ((len(enforce) > 0 && enforce[0]) || !v.Has(sub)) {
v.Lock()
defer v.Unlock()
for _, field := range sub.Fields() {
if _, ok := v.state[field]; ok {
v.state[field] = append(v.state[field], sub)
} else {
v.state[field] = []Subscription{sub}
}
}
return true
}
return false
}
func (v *tree) Del(sub Subscription) bool {
if sub != nil {
v.Lock()
defer v.Unlock()
var count int
for _, field := range sub.Fields() {
if group, ok := v.state[field]; ok {
for i, o := range group {
if o == sub {
v.state[field][i] = v.state[field][len(v.state[field])-1]
v.state[field] = v.state[field][:len(v.state[field])-1]
count++
}
}
}
}
return count > 0
}
return false
}
func (v *tree) Get(fields ...string) []Subscription {
if len(fields) == 0 {
return nil
}
v.RLock()
defer v.RUnlock()
var count, idx int
for _, field := range fields {
if _, ok := v.state[field]; ok {
count += len(v.state[field])
}
}
var subs = make([]Subscription, count)
for _, field := range fields {
if group, ok := v.state[field]; ok {
for _, sub := range group {
subs[idx] = sub
idx++
}
}
}
return subs
}