-
Notifications
You must be signed in to change notification settings - Fork 9
/
ring_test.go
120 lines (96 loc) · 3.35 KB
/
ring_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
package ring
import (
"github.com/malwaredllc/minicache/node"
. "github.com/smartystreets/goconvey/convey"
"testing"
)
const (
CONFIG_FILE = "../configs/nodes-docker-with-mTLS.json"
)
func TestAddNode(t *testing.T) {
nodes_config := node.LoadNodesConfig(CONFIG_FILE)
node0 := nodes_config.Nodes["node0"]
node1 := nodes_config.Nodes["node1"]
node2 := nodes_config.Nodes["node2"]
Convey("Given empty ring", t, func() {
Convey("Then it should add node", func() {
r := NewRing()
r.AddNode(node0.Id, node0.Host, node0.RestPort, node0.GrpcPort)
So(r.Nodes.Len(), ShouldEqual, 1)
Convey("Then node should've hashed id", func() {
So(r.Nodes[0].HashId, ShouldHaveSameTypeAs, uint32(0))
})
})
Convey("Then it should add node & sort by node id", func() {
r := NewRing()
r.AddNode(node1.Id, node1.Host, node1.RestPort, node1.GrpcPort)
r.AddNode(node2.Id, node2.Host, node2.RestPort, node2.GrpcPort)
So(r.Nodes.Len(), ShouldEqual, 2)
node1hash := node.HashId(node1.Id)
node2hash := node.HashId(node2.Id)
So(node1hash, ShouldBeGreaterThan, node2hash)
So(r.Nodes[0].Id, ShouldEqual, node2.Id)
So(r.Nodes[1].Id, ShouldEqual, node1.Id)
})
})
}
func TestRemoveNode(t *testing.T) {
nodes_config := node.LoadNodesConfig(CONFIG_FILE)
node0 := nodes_config.Nodes["node0"]
node1 := nodes_config.Nodes["node1"]
node2 := nodes_config.Nodes["node2"]
Convey("Given ring with nodes", t, func() {
r := NewRing()
r.AddNode(node0.Id, node0.Host, node0.RestPort, node0.GrpcPort)
r.AddNode(node1.Id, node1.Host, node1.RestPort, node1.GrpcPort)
r.AddNode(node2.Id, node2.Host, node2.RestPort, node2.GrpcPort)
Convey("When node doesn't exist", func() {
Convey("Then it should return error", func() {
err := r.RemoveNode("nonexistent")
So(err, ShouldEqual, ErrNodeNotFound)
})
})
Convey("When node exists", func() {
Convey("Then it should remove node", func() {
err := r.RemoveNode(node2.Id)
So(err, ShouldBeNil)
So(r.Nodes.Len(), ShouldEqual, 2)
// node 0 hash is lower than node 1, so this is sorted the order they appear in
So(r.Nodes[0].Id, ShouldEqual, node1.Id)
So(r.Nodes[1].Id, ShouldEqual, node0.Id)
})
})
})
}
func TestGet(t *testing.T) {
nodes_config := node.LoadNodesConfig(CONFIG_FILE)
node0 := nodes_config.Nodes["node0"]
node1 := nodes_config.Nodes["node1"]
node2 := nodes_config.Nodes["node2"]
Convey("Given ring with 1 node", t, func() {
r := NewRing()
r.AddNode(node1.Id, node1.Host, node1.RestPort, node1.GrpcPort)
Convey("Then it should return that node regardless of input", func() {
insertnode := r.Get("id")
So(insertnode, ShouldEqual, node1.Id)
insertnode = r.Get("anykey")
So(insertnode, ShouldEqual, node1.Id)
})
})
Convey("Given ring with multiple nodes", t, func() {
insertid := "random_key"
r := NewRing()
r.AddNode(node0.Id, node0.Host, node0.RestPort, node0.GrpcPort)
r.AddNode(node1.Id, node1.Host, node1.RestPort, node1.GrpcPort)
r.AddNode(node2.Id, node2.Host, node2.RestPort, node2.GrpcPort)
Convey("Then it should return node closest", func() {
node0hash := node.HashId(node0.Id)
node1hash := node.HashId(node1.Id)
inserthash := node.HashId(insertid)
So(inserthash, ShouldBeGreaterThan, node1hash)
So(inserthash, ShouldBeLessThan, node0hash)
insertnode := r.Get(insertid)
So(insertnode, ShouldEqual, node0.Id)
})
})
}