unistack-org/micro
4
0
Fork 3
Code Issues 20 Pull Requests 1 Actions Packages Projects Releases 281 Wiki Activity

Make topology test more generic

Browse Source
This commit is contained in:
Milos Gajdos 2019-09-11 01:22:40 +01:00
parent 2dfbe93d65
commit 35cf2a5739
No known key found for this signature in database
GPG Key ID: 8B31058CC55DFD4F
1 changed files with 26 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

35
network/node_test.go
View File

@ -157,6 +157,22 @@ func TestPeers(t *testing.T) {
}
}
func collectTopologyIds(peers map[string]*node, ids map[string]bool) map[string]bool {
if len(peers) == 0 {
return ids
}
// iterate through the whole graph
for id, peer := range peers {
ids = collectTopologyIds(peer.peers, ids)
if _, ok := ids[id]; !ok {
ids[id] = true
}
}
return ids
}
func TestTopology(t *testing.T) {
// single node
single := &node{
@ -200,17 +216,16 @@ func TestTopology(t *testing.T) {
}
topology = node.Topology(2)
// iterate through the whole graph
// NOTE: this is a manual iteration as we know the size of the graph
for id, peer := range topology.peers {
if _, ok := peerIds[id]; !ok {
t.Errorf("Expected to find %s peer", peer.Id())
}
// peers of peers
for id := range peer.peers {
if _, ok := peerIds[id]; !ok {
t.Errorf("Expected to find %s peer", peer.Id())
topIds := make(map[string]bool)
topIds = collectTopologyIds(topology.peers, topIds)
if len(topIds) != len(peerIds) {
t.Errorf("Expected to find %d nodes, found: %d", len(peerIds), len(topIds))
}
for id := range topIds {
if _, ok := topIds[id]; !ok {
t.Errorf("Expected to find %s peer", id)
}
}
}