mirror of
https://github.com/weaveworks/scope.git
synced 2026-03-03 18:20:27 +00:00
Squash of: * We have to keep all the container hostnames until the end so we can count how many we've filtered * Adding tests for ContainerHostnameRenderer and PodServiceRenderer with filters * Because we filter on image name we need the image name before filtering * Alternative approach to passing decorators. * Refactor out some of the decorator capture * Don't memoise decorated calls to Render * Fixing filtered counts on containers topology Tricky, because we need the filters to be silent sometimes (when they're in the middle), but not when they're at the top, so we take the "top" filter's stats. However, this means we have to compose all user-specified filters into a single Filter layer, so we can get all stats. There are no more Silent filters, as all filters are silent (unless they are at the top). Additionally, I clarified some of the filters as their usage/terminology was inconsistent and confused. Now Filter(IsFoo, ...) *keeps* only nodes where IsFoo is true.
127 lines
3.5 KiB
Go
127 lines
3.5 KiB
Go
package render_test
|
|
|
|
import (
|
|
"reflect"
|
|
"testing"
|
|
|
|
"github.com/weaveworks/scope/render"
|
|
"github.com/weaveworks/scope/report"
|
|
"github.com/weaveworks/scope/test"
|
|
)
|
|
|
|
type mockRenderer struct {
|
|
report.Nodes
|
|
}
|
|
|
|
func (m mockRenderer) Render(rpt report.Report, d render.Decorator) report.Nodes {
|
|
if d != nil {
|
|
return d(mockRenderer{m.Nodes}).Render(rpt, nil)
|
|
}
|
|
return m.Nodes
|
|
}
|
|
func (m mockRenderer) Stats(rpt report.Report, _ render.Decorator) render.Stats { return render.Stats{} }
|
|
|
|
// Prune returns a copy of the Nodes with all information not strictly
|
|
// necessary for rendering nodes and edges in the UI cut away.
|
|
func Prune(nodes report.Nodes) report.Nodes {
|
|
result := report.Nodes{}
|
|
for id, node := range nodes {
|
|
result[id] = PruneNode(node)
|
|
}
|
|
return result
|
|
}
|
|
|
|
// PruneNode returns a copy of the Node with all information not strictly
|
|
// necessary for rendering nodes and edges stripped away. Specifically, that
|
|
// means cutting out parts of the Node.
|
|
func PruneNode(node report.Node) report.Node {
|
|
prunedChildren := report.MakeNodeSet()
|
|
node.Children.ForEach(func(child report.Node) {
|
|
prunedChildren = prunedChildren.Add(PruneNode(child))
|
|
})
|
|
return report.MakeNode(
|
|
node.ID).
|
|
WithTopology(node.Topology).
|
|
WithAdjacent(node.Adjacency.Copy()...).
|
|
WithChildren(prunedChildren)
|
|
}
|
|
|
|
func TestReduceRender(t *testing.T) {
|
|
renderer := render.Reduce([]render.Renderer{
|
|
mockRenderer{Nodes: report.Nodes{"foo": report.MakeNode("foo")}},
|
|
mockRenderer{Nodes: report.Nodes{"bar": report.MakeNode("bar")}},
|
|
})
|
|
|
|
want := report.Nodes{
|
|
"foo": report.MakeNode("foo"),
|
|
"bar": report.MakeNode("bar"),
|
|
}
|
|
have := renderer.Render(report.MakeReport(), render.FilterNoop)
|
|
if !reflect.DeepEqual(want, have) {
|
|
t.Errorf("want %+v, have %+v", want, have)
|
|
}
|
|
}
|
|
|
|
func TestMapRender1(t *testing.T) {
|
|
// 1. Check when we return false, the node gets filtered out
|
|
mapper := render.Map{
|
|
MapFunc: func(nodes report.Node, _ report.Networks) report.Nodes {
|
|
return report.Nodes{}
|
|
},
|
|
Renderer: mockRenderer{Nodes: report.Nodes{
|
|
"foo": report.MakeNode("foo"),
|
|
}},
|
|
}
|
|
want := report.Nodes{}
|
|
have := mapper.Render(report.MakeReport(), render.FilterNoop)
|
|
if !reflect.DeepEqual(want, have) {
|
|
t.Errorf("want %+v, have %+v", want, have)
|
|
}
|
|
}
|
|
|
|
func TestMapRender2(t *testing.T) {
|
|
// 2. Check we can remap two nodes into one
|
|
mapper := render.Map{
|
|
MapFunc: func(nodes report.Node, _ report.Networks) report.Nodes {
|
|
return report.Nodes{
|
|
"bar": report.MakeNode("bar"),
|
|
}
|
|
},
|
|
Renderer: mockRenderer{Nodes: report.Nodes{
|
|
"foo": report.MakeNode("foo"),
|
|
"baz": report.MakeNode("baz"),
|
|
}},
|
|
}
|
|
want := report.Nodes{
|
|
"bar": report.MakeNode("bar"),
|
|
}
|
|
have := mapper.Render(report.MakeReport(), render.FilterNoop)
|
|
if !reflect.DeepEqual(want, have) {
|
|
t.Error(test.Diff(want, have))
|
|
}
|
|
}
|
|
|
|
func TestMapRender3(t *testing.T) {
|
|
// 3. Check we can remap adjacencies
|
|
mapper := render.Map{
|
|
MapFunc: func(nodes report.Node, _ report.Networks) report.Nodes {
|
|
id := "_" + nodes.ID
|
|
return report.Nodes{id: report.MakeNode(id)}
|
|
},
|
|
Renderer: mockRenderer{Nodes: report.Nodes{
|
|
"foo": report.MakeNode("foo").WithAdjacent("baz"),
|
|
"baz": report.MakeNode("baz").WithAdjacent("foo"),
|
|
}},
|
|
}
|
|
want := report.Nodes{
|
|
"_foo": report.MakeNode("_foo").WithAdjacent("_baz"),
|
|
"_baz": report.MakeNode("_baz").WithAdjacent("_foo"),
|
|
}
|
|
have := mapper.Render(report.MakeReport(), render.FilterNoop)
|
|
if !reflect.DeepEqual(want, have) {
|
|
t.Error(test.Diff(want, have))
|
|
}
|
|
}
|
|
|
|
func newu64(value uint64) *uint64 { return &value }
|