-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathhash.go
119 lines (99 loc) · 1.85 KB
/
hash.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
package balancer
import (
"sync"
"github.com/fufuok/balancer/internal/doublejump"
"github.com/fufuok/balancer/utils"
)
// JumpConsistentHash
type consistentHash struct {
items []string
count int
h *doublejump.Hash
sync.RWMutex
}
func NewConsistentHash(items ...[]string) (lb *consistentHash) {
if len(items) > 0 && len(items[0]) > 0 {
lb = &consistentHash{}
lb.Update(items[0])
return
}
return &consistentHash{
h: doublejump.NewHash(),
}
}
func (b *consistentHash) Add(item string, _ ...int) {
b.Lock()
b.items = append(b.items, item)
b.h.Add(item)
b.count++
b.Unlock()
}
func (b *consistentHash) All() interface{} {
all := make([]string, b.count)
b.Lock()
for i, v := range b.items {
all[i] = v
}
b.Unlock()
return all
}
func (b *consistentHash) Name() string {
return "ConsistentHash"
}
func (b *consistentHash) Select(key ...string) (item string) {
b.RLock()
switch b.count {
case 0:
item = ""
case 1:
item = b.items[0]
default:
hash := utils.HashString(key...)
item, _ = b.h.Get(hash).(string)
}
b.RUnlock()
return
}
func (b *consistentHash) Remove(item string, asClean ...bool) (ok bool) {
b.Lock()
defer b.Unlock()
clean := len(asClean) > 0 && asClean[0]
for i := 0; i < b.count; i++ {
if item == b.items[i] {
b.items = append(b.items[:i], b.items[i+1:]...)
b.count--
b.h.Remove(item)
ok = true
// remove all or remove one
if !clean {
return
}
i--
}
}
return
}
func (b *consistentHash) RemoveAll() {
b.Lock()
b.items = b.items[:0]
b.count = 0
b.h = doublejump.NewHash()
b.Unlock()
}
func (b *consistentHash) Reset() {}
func (b *consistentHash) Update(items interface{}) bool {
v, ok := items.([]string)
if !ok {
return false
}
h := doublejump.NewHash()
for _, x := range v {
h.Add(x)
}
b.Lock()
b.count = len(v)
b.items = v
b.h = h
b.Unlock()
return true
}