mirror of
https://github.com/weaveworks/scope.git
synced 2026-07-28 09:41:57 +00:00
Remove LeafMap - have a generic function which converts a Topology to a RenderableNodes.
This commit is contained in:
@@ -12,42 +12,42 @@ import (
|
||||
|
||||
func TestMergeRenderableNodes(t *testing.T) {
|
||||
nodes1 := render.RenderableNodes{
|
||||
"foo": render.RenderableNode{ID: "foo"},
|
||||
"bar": render.RenderableNode{ID: "bar"},
|
||||
"foo": render.NewRenderableNode("foo"),
|
||||
"bar": render.NewRenderableNode("bar"),
|
||||
}
|
||||
nodes2 := render.RenderableNodes{
|
||||
"bar": render.RenderableNode{ID: "bar"},
|
||||
"baz": render.RenderableNode{ID: "baz"},
|
||||
"bar": render.NewRenderableNode("bar"),
|
||||
"baz": render.NewRenderableNode("baz"),
|
||||
}
|
||||
want := expected.Sterilize(render.RenderableNodes{
|
||||
"foo": render.RenderableNode{ID: "foo"},
|
||||
"bar": render.RenderableNode{ID: "bar"},
|
||||
"baz": render.RenderableNode{ID: "baz"},
|
||||
"foo": render.NewRenderableNode("foo"),
|
||||
"bar": render.NewRenderableNode("bar"),
|
||||
"baz": render.NewRenderableNode("baz"),
|
||||
})
|
||||
nodes1.Merge(nodes2)
|
||||
if have := expected.Sterilize(nodes1); !reflect.DeepEqual(want, have) {
|
||||
have := nodes1.Merge(nodes2)
|
||||
if !reflect.DeepEqual(want, have) {
|
||||
t.Error(test.Diff(want, have))
|
||||
}
|
||||
}
|
||||
|
||||
func TestMergeRenderableNode(t *testing.T) {
|
||||
node1 := render.RenderableNode{
|
||||
ID: "foo",
|
||||
LabelMajor: "",
|
||||
LabelMinor: "minor",
|
||||
Rank: "",
|
||||
Pseudo: false,
|
||||
Adjacency: report.MakeIDList("a1"),
|
||||
Origins: report.MakeIDList("o1"),
|
||||
ID: "foo",
|
||||
LabelMajor: "",
|
||||
LabelMinor: "minor",
|
||||
Rank: "",
|
||||
Pseudo: false,
|
||||
NodeMetadata: report.MakeNodeMetadata().WithAdjacent("a1"),
|
||||
Origins: report.MakeIDList("o1"),
|
||||
}
|
||||
node2 := render.RenderableNode{
|
||||
ID: "foo",
|
||||
LabelMajor: "major",
|
||||
LabelMinor: "",
|
||||
Rank: "rank",
|
||||
Pseudo: false,
|
||||
Adjacency: report.MakeIDList("a2"),
|
||||
Origins: report.MakeIDList("o2"),
|
||||
ID: "foo",
|
||||
LabelMajor: "major",
|
||||
LabelMinor: "",
|
||||
Rank: "rank",
|
||||
Pseudo: false,
|
||||
NodeMetadata: report.MakeNodeMetadata().WithAdjacent("a2"),
|
||||
Origins: report.MakeIDList("o2"),
|
||||
}
|
||||
want := render.RenderableNode{
|
||||
ID: "foo",
|
||||
@@ -55,13 +55,12 @@ func TestMergeRenderableNode(t *testing.T) {
|
||||
LabelMinor: "minor",
|
||||
Rank: "rank",
|
||||
Pseudo: false,
|
||||
Adjacency: report.MakeIDList("a1", "a2"),
|
||||
NodeMetadata: report.MakeNodeMetadata().WithAdjacency(report.MakeIDList("a1", "a2")),
|
||||
Origins: report.MakeIDList("o1", "o2"),
|
||||
NodeMetadata: report.MakeNodeMetadata(),
|
||||
EdgeMetadata: report.EdgeMetadata{},
|
||||
}
|
||||
node1.Merge(node2)
|
||||
if have := node1; !reflect.DeepEqual(want, have) {
|
||||
have := node1.Merge(node2)
|
||||
if !reflect.DeepEqual(want, have) {
|
||||
t.Error(test.Diff(want, have))
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user