/
FilterTree.go
102 lines (91 loc) · 2.65 KB
/
FilterTree.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
package main
import (
"unsafe"
llrb "github.com/petar/GoLLRB/llrb"
"github.com/xiaonanln/goworld/engine/gwlog"
"github.com/xiaonanln/goworld/engine/gwutils"
"github.com/xiaonanln/goworld/engine/proto"
)
type _FilterTree struct {
btree *llrb.LLRB
}
func newFilterTree() *_FilterTree {
return &_FilterTree{
btree: llrb.New(),
}
}
type filterTreeItem struct {
cp *ClientProxy
val string
}
func (it *filterTreeItem) Less(_other llrb.Item) bool {
other := _other.(*filterTreeItem)
return it.val < other.val || (it.val == other.val && uintptr(unsafe.Pointer(it.cp)) < uintptr(unsafe.Pointer(other.cp)))
}
func (ft *_FilterTree) Insert(cp *ClientProxy, val string) {
ft.btree.ReplaceOrInsert(&filterTreeItem{
cp: cp,
val: val,
})
}
func (ft *_FilterTree) Remove(cp *ClientProxy, val string) {
//gwlog.Infof("Removing %s %s has %v", id, val, ft.llrb.Has(&filterTreeItem{
// cp: id,
// val: val,
//}))
ft.btree.Delete(&filterTreeItem{
cp: cp,
val: val,
})
}
func (ft *_FilterTree) Visit(op proto.FilterClientsOpType, val string, f func(cp *ClientProxy)) {
if op == proto.FILTER_CLIENTS_OP_EQ {
// visit key == val
ft.btree.AscendGreaterOrEqual(&filterTreeItem{nil, val}, func(_item llrb.Item) bool {
item := _item.(*filterTreeItem)
if item.val > val {
return false
}
f(item.cp)
return true
})
} else if op == proto.FILTER_CLIENTS_OP_NE {
// visit key != val
// visit key < val first
ft.btree.AscendLessThan(&filterTreeItem{nil, val}, func(_item llrb.Item) bool {
f(_item.(*filterTreeItem).cp)
return true
})
// then visit key > val
ft.btree.AscendGreaterOrEqual(&filterTreeItem{nil, gwutils.NextLargerKey(val)}, func(_item llrb.Item) bool {
f(_item.(*filterTreeItem).cp)
return true
})
} else if op == proto.FILTER_CLIENTS_OP_GT {
// visit key > val
ft.btree.AscendGreaterOrEqual(&filterTreeItem{nil, gwutils.NextLargerKey(val)}, func(_item llrb.Item) bool {
f(_item.(*filterTreeItem).cp)
return true
})
} else if op == proto.FILTER_CLIENTS_OP_GTE {
// visit key >= val
ft.btree.AscendGreaterOrEqual(&filterTreeItem{nil, val}, func(_item llrb.Item) bool {
f(_item.(*filterTreeItem).cp)
return true
})
} else if op == proto.FILTER_CLIENTS_OP_LT {
// visit key < val
ft.btree.AscendLessThan(&filterTreeItem{nil, val}, func(_item llrb.Item) bool {
f(_item.(*filterTreeItem).cp)
return true
})
} else if op == proto.FILTER_CLIENTS_OP_LTE {
// visit key <= val
ft.btree.AscendLessThan(&filterTreeItem{nil, gwutils.NextLargerKey(val)}, func(_item llrb.Item) bool {
f(_item.(*filterTreeItem).cp)
return true
})
} else {
gwlog.Panicf("unknown filter clients op: %s", op)
}
}