-
Notifications
You must be signed in to change notification settings - Fork 0
/
tree.go
88 lines (73 loc) · 1.77 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
87
88
/*
Copyright 2024 eventbus Author(s)
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
package eventbus
const (
InitNodeSubCache = 16
InitLevelNodeCache = 16
)
type Level struct {
Nodes map[string]*Node //
// TODO
}
type Node struct {
Next *Level // next level
Psubs ISet[*Subscription] // original set
Qsubs map[string]ISet[*Subscription] // queue set
Plist []*Subscription // cache list
}
func NewNode() *Node {
return &Node{
Psubs: NewMixSet[*Subscription](),
// Psubs: NewSet[*Subscription](InitNodeSubCache),
}
}
type LevelCache struct {
Level *Level
Node *Node
Topic string
}
func NewLevel() *Level {
return &Level{
Nodes: make(map[string]*Node, InitLevelNodeCache),
}
}
// NumNodes
func (l *Level) NumNodes() int {
return len(l.Nodes)
}
// PruneNode
func (l *Level) PruneNode(topic string) {
delete(l.Nodes, topic)
}
// IsEmpty
func (n *Node) IsEmpty() bool {
return n.Psubs.Len() == 0 && (n.Next == nil || n.Next.NumNodes() == 0)
}
// MatchLevel
func MatchLevel(level *Level, tokens []string, ret *sublistResult) {
var node *Node
for _, token := range tokens {
if level == nil {
return
}
node = level.Nodes[token]
if node == nil {
level = nil
} else {
level = node.Next
}
}
if node != nil {
ret.add(node)
}
}