-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathnode_test.go
167 lines (137 loc) · 3.49 KB
/
node_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
package flux
import (
"errors"
"testing"
"github.com/hashicorp/memberlist"
"github.com/istoican/flux/consistent"
"github.com/istoican/flux/consistent/hash"
"github.com/istoican/flux/storage/memory"
"github.com/istoican/flux/transport"
)
type MockPeer struct {
store map[string][]byte
}
func (p *MockPeer) Get(key string) ([]byte, error) {
if val, ok := p.store[key]; ok {
return val, nil
}
return nil, errors.New("key not found")
}
func (p *MockPeer) Put(key string, value []byte) error {
p.store[key] = value
return nil
}
func (p *MockPeer) Del(key string) error {
delete(p.store, key)
return nil
}
func TestNodeLocal(t *testing.T) {
store := memory.NewStore()
ring := consistent.New(hash.MD5)
n := &Node{
addr: "node1",
store: store,
ring: ring,
peers: make(map[string]transport.Peer),
}
n.ring.Add("node1")
if !n.Local("key1") {
t.Errorf("expected key to be local to node1")
}
n.ring.Add("node2")
if n.Local("key1") && n.ring.Get("key1").Address != "node1" {
t.Errorf("expected key to not be local to node1")
}
}
func TestNodePeer(t *testing.T) {
store := memory.NewStore()
ring := consistent.New(hash.MD5)
n := &Node{
addr: "node1",
store: store,
ring: ring,
peers: make(map[string]transport.Peer),
peerFn: func(addr string) transport.Peer {
return &MockPeer{store: make(map[string][]byte)}
},
}
n.ring.Add("node1")
n.ring.Add("node2")
n.peers["node1"] = &MockPeer{store: make(map[string][]byte)}
n.peers["node2"] = &MockPeer{store: make(map[string][]byte)}
peer, addr := n.Peer("key1")
if peer == nil || addr != "node1" && addr != "node2" {
t.Errorf("expected to find a peer for key1")
}
}
func TestNodeGetPut(t *testing.T) {
store := memory.NewStore()
ring := consistent.New(hash.MD5)
n := &Node{
addr: "node1",
store: store,
ring: ring,
peers: make(map[string]transport.Peer),
peerFn: func(addr string) transport.Peer {
return &MockPeer{store: make(map[string][]byte)}
},
}
n.ring.Add("node1")
n.peers["node1"] = &MockPeer{store: make(map[string][]byte)}
err := n.Put("key1", []byte("value1"))
if err != nil {
t.Fatalf("expected no error, got %v", err)
}
val, err := n.Get("key1")
if err != nil {
t.Fatalf("expected no error, got %v", err)
}
if string(val) != "value1" {
t.Errorf("expected 'value1', got %s", val)
}
}
func TestNodeNotifyJoinAndLeave(t *testing.T) {
store := memory.NewStore()
ring := consistent.New(hash.MD5)
n := &Node{
addr: "node1",
store: store,
ring: ring,
peers: make(map[string]transport.Peer),
peerFn: func(addr string) transport.Peer {
return &MockPeer{store: make(map[string][]byte)}
},
}
node := &memberlist.Node{Name: "node2"}
n.NotifyJoin(node)
if len(n.peers) != 1 {
t.Errorf("expected 1 peer, got %d", len(n.peers))
}
n.NotifyLeave(node)
if len(n.peers) != 0 {
t.Errorf("expected 0 peers, got %d", len(n.peers))
}
}
func TestNodeRebalance(t *testing.T) {
store := memory.NewStore()
ring := consistent.New(hash.MD5)
n := &Node{
addr: "node1",
store: store,
ring: ring,
peers: make(map[string]transport.Peer),
peerFn: func(addr string) transport.Peer {
return &MockPeer{store: make(map[string][]byte)}
},
}
n.ring.Add("node1")
n.peers["node1"] = &MockPeer{store: make(map[string][]byte)}
n.Put("key1", []byte("value1"))
node2Peer := &MockPeer{store: make(map[string][]byte)}
n.peers["node2"] = node2Peer
n.ring.Add("node2")
n.rebalance()
if _, err := node2Peer.Get("key1"); err != nil {
t.Errorf("expected key to be moved to node2")
}
}