-
Notifications
You must be signed in to change notification settings - Fork 5
/
hashring_test.go
204 lines (172 loc) · 3.56 KB
/
hashring_test.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
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
package hashring
import (
"reflect"
"sort"
"testing"
)
func TestNodeIdx_Sort(t *testing.T) {
tests := []struct {
v nodeIdx
r nodeIdx
}{
{
v: nodeIdx{5, 1, 3, 9, 10, 0, 78},
r: nodeIdx{0, 1, 3, 5, 9, 10, 78},
},
{
v: nodeIdx{9, 3, 5, 4, 2, 3, 6},
r: nodeIdx{2, 3, 3, 4, 5, 6, 9},
},
}
for _, c := range tests {
sort.Sort(c.v)
if !reflect.DeepEqual(c.v, c.r) {
t.Fatalf("expected %v but got %v\n", c.r, c.v)
}
}
}
func TestHashRing_AddNode(t *testing.T) {
tests := []struct {
virtualNodeCount int
nodes []string
requiredCount int
}{
{
virtualNodeCount: 1,
nodes: []string{"abc_node"},
requiredCount: 1,
},
{
virtualNodeCount: 3,
nodes: []string{"abc_node"},
requiredCount: 3,
},
{
virtualNodeCount: 4,
nodes: []string{"abc_1", "abc_2"},
requiredCount: 8,
},
{
virtualNodeCount: 1,
nodes: []string{"abc_1", "abc_2", "abc_3"},
requiredCount: 3,
},
}
testContains := func(hr *HashRing, nodes []string) bool {
result := true
for _, node := range nodes {
count := 0
for _, v := range hr.nodes {
if v == node {
count++
}
}
result = result && (count == hr.replicaCount)
}
return result
}
for _, c := range tests {
hr := New(c.virtualNodeCount, nil)
for _, node := range c.nodes {
hr.Add(node)
}
if !(testContains(hr, c.nodes) && len(hr.idx) == c.virtualNodeCount*len(c.nodes)) {
t.Fatalf("node count didn't match: %+v\n", hr)
}
}
}
func TestHashRing_Delete(t *testing.T) {
vcount := 3
nodes := []string{"abc_1", "abc_node", "abc_2", "abc_3"}
hr := New(vcount, nil)
for _, n := range nodes {
hr.Add(n)
}
testContains := func(hr *HashRing, nodes []string) bool {
result := true
for _, node := range nodes {
count := 0
for _, v := range hr.nodes {
if v == node {
count++
}
}
result = result && (count == hr.replicaCount)
}
return result
}
tests := []struct {
nodes []string
requiredCount int
}{
{
nodes: []string{"abc_node"},
requiredCount: 9,
},
{
nodes: []string{"abc_3"},
requiredCount: 6,
},
{
nodes: []string{"abc_1", "abc_2"},
requiredCount: 0,
},
}
for _, c := range tests {
for _, n := range c.nodes {
hr.Delete(n)
}
if testContains(hr, c.nodes) || len(hr.idx) != c.requiredCount {
t.Fatalf("delete failed: %+v\n", hr)
}
}
}
func TestHashRing_Get(t *testing.T) {
tests := []struct {
replicas int
nodes []string
keys []string
}{
{
replicas: 2,
nodes: []string{"10.10.10.1", "10.10.10.2", "10.10.10.3"},
keys: []string{"abc", "cde", "some random key", "found it"},
},
{
replicas: 4,
nodes: []string{"10.10.10.1", "10.10.10.2"},
keys: []string{"abc", "cde", "some random key", "found it"},
},
{
replicas: 1,
nodes: []string{"10.10.10.1", "10.10.10.2", "10.10.10.3", "10.10.10.4"},
keys: []string{"abc", "cde", "some random key", "found it"},
},
}
testContains := func(list []string, item string) bool {
for _, l := range list {
if l == item {
return true
}
}
return false
}
for _, c := range tests {
hr := New(c.replicas, nil)
for _, n := range c.nodes {
err := hr.Add(n)
if err != nil {
t.Fatalf("unexpected error: %v\n", err)
}
}
for _, k := range c.keys {
n, err := hr.Locate(k)
if err != nil {
t.Fatalf("unexpected error: %v\n", err)
}
if !testContains(c.nodes, n) {
t.Fatalf("unexpected node found: %s\n", n)
}
}
}
}