-
Notifications
You must be signed in to change notification settings - Fork 265
/
cn_pool.go
124 lines (105 loc) · 2.67 KB
/
cn_pool.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
// Copyright 2022 Matrix Origin
//
// 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 task
import (
"container/heap"
pb "github.com/matrixorigin/matrixone/pkg/pb/logservice"
"slices"
)
type cnStore struct {
uuid string
info pb.CNStoreInfo
}
type cnPool struct {
freq map[string]uint32
sortedCN []cnStore
}
func (p *cnPool) Len() int {
return len(p.sortedCN)
}
func (p *cnPool) Less(i, j int) bool {
return p.freq[p.sortedCN[i].uuid] < p.freq[p.sortedCN[j].uuid]
}
func (p *cnPool) Swap(i, j int) {
p.sortedCN[i], p.sortedCN[j] = p.sortedCN[j], p.sortedCN[i]
}
func (p *cnPool) Push(x any) {
store := x.(cnStore)
p.set(store, p.getFreq(store.uuid)+1)
}
func (p *cnPool) Pop() any {
x := p.sortedCN[len(p.sortedCN)-1]
p.remove(x.uuid)
return x
}
func newCNPool() *cnPool {
pool := &cnPool{
freq: make(map[string]uint32),
sortedCN: make([]cnStore, 0),
}
heap.Init(pool)
return pool
}
func newCNPoolWithCNState(cnState pb.CNState) *cnPool {
orderedMap := &cnPool{
freq: make(map[string]uint32, len(cnState.Stores)),
sortedCN: make([]cnStore, 0, len(cnState.Stores)),
}
for key, info := range cnState.Stores {
orderedMap.freq[key] = 0
orderedMap.sortedCN = append(orderedMap.sortedCN, cnStore{key, info})
}
heap.Init(orderedMap)
return orderedMap
}
func (p *cnPool) set(key cnStore, val uint32) {
if _, ok := p.freq[key.uuid]; !ok {
p.sortedCN = append(p.sortedCN, key)
}
p.freq[key.uuid] = val
heap.Fix(p, slices.IndexFunc(p.sortedCN,
func(store cnStore) bool {
return store.uuid == key.uuid
}))
}
func (p *cnPool) getFreq(key string) uint32 {
return p.freq[key]
}
func (p *cnPool) contains(uuid string) bool {
_, ok := p.freq[uuid]
return ok
}
func (p *cnPool) min() cnStore {
if len(p.sortedCN) == 0 {
return cnStore{}
}
return p.sortedCN[0]
}
func (p *cnPool) remove(key string) {
delete(p.freq, key)
p.sortedCN = slices.DeleteFunc(p.sortedCN, func(store cnStore) bool {
return store.uuid == key
})
}
func (p *cnPool) getStore(key string) (cnStore, bool) {
if _, ok := p.freq[key]; !ok {
return cnStore{}, ok
}
for _, store := range p.sortedCN {
if store.uuid == key {
return store, true
}
}
return cnStore{}, false
}