-
Notifications
You must be signed in to change notification settings - Fork 1.3k
/
ring.go
105 lines (89 loc) · 1.85 KB
/
ring.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
package scache
import (
"sync"
"github.com/toolkits/pkg/consistent"
)
type ConsistentHashRing struct {
sync.RWMutex
ring *consistent.Consistent
}
func (r *ConsistentHashRing) GetNode(pk string) (string, error) {
r.RLock()
defer r.RUnlock()
return r.ring.Get(pk)
}
func (r *ConsistentHashRing) Set(ring *consistent.Consistent) {
r.Lock()
defer r.Unlock()
r.ring = ring
}
func (r *ConsistentHashRing) GetRing() *consistent.Consistent {
r.RLock()
defer r.RUnlock()
return r.ring
}
func NewConsistentHashRing(replicas int32, nodes []string) *ConsistentHashRing {
ret := &ConsistentHashRing{ring: consistent.New()}
ret.ring.NumberOfReplicas = int(replicas)
for i := 0; i < len(nodes); i++ {
ret.ring.Add(nodes[i])
}
return ret
}
func RebuildConsistentHashRing(hashRing *ConsistentHashRing, nodes []string, replicas int) {
r := consistent.New()
r.NumberOfReplicas = replicas
for i := 0; i < len(nodes); i++ {
r.Add(nodes[i])
}
hashRing.Set(r)
}
type NodeMap struct {
sync.RWMutex
data map[string]string
}
func NewNodeMap() NodeMap {
nm := NodeMap{
data: make(map[string]string),
}
return nm
}
func (n *NodeMap) GetInstanceBy(node string) (string, bool) {
n.RLock()
defer n.RUnlock()
v, exists := n.data[node]
return v, exists
}
func (n *NodeMap) GetNodeBy(instance string) (string, bool) {
n.RLock()
defer n.RUnlock()
for node, v := range n.data {
if instance == v {
return node, true
}
}
return "", false
}
func (n *NodeMap) GetNodes() []string {
n.RLock()
defer n.RUnlock()
var nodes []string
for node := range n.data {
nodes = append(nodes, node)
}
return nodes
}
func (n *NodeMap) Set(nodeMap map[string]string) {
n.Lock()
defer n.Unlock()
n.data = make(map[string]string)
for node, ip := range nodeMap {
n.data[node] = ip
}
return
}
func (n *NodeMap) Len() int {
n.RLock()
defer n.RUnlock()
return len(n.data)
}