From 7f5def4361bbd3b9ecfb6ca76b0e53013a64eefe Mon Sep 17 00:00:00 2001 From: Jordan Liggitt Date: Fri, 6 Apr 2018 20:46:25 -0400 Subject: [PATCH] fix graph test sorting --- plugin/pkg/auth/authorizer/node/graph_test.go | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/plugin/pkg/auth/authorizer/node/graph_test.go b/plugin/pkg/auth/authorizer/node/graph_test.go index 3f38b285d35..a8c970fdf42 100644 --- a/plugin/pkg/auth/authorizer/node/graph_test.go +++ b/plugin/pkg/auth/authorizer/node/graph_test.go @@ -146,7 +146,7 @@ func TestDeleteEdges_locked(t *testing.T) { return expectNodes[i].ID() < expectNodes[j].ID() }) startNodes := c.start.graph.Nodes() - sort.Slice(expectNodes, func(i, j int) bool { + sort.Slice(startNodes, func(i, j int) bool { return startNodes[i].ID() < startNodes[j].ID() }) assert.Equal(t, expectNodes, startNodes) @@ -161,7 +161,7 @@ func TestDeleteEdges_locked(t *testing.T) { return expectEdges[i].From().ID() < expectEdges[j].From().ID() }) startEdges := c.start.graph.Edges() - sort.Slice(expectEdges, func(i, j int) bool { + sort.Slice(startEdges, func(i, j int) bool { if startEdges[i].From().ID() == startEdges[j].From().ID() { return startEdges[i].To().ID() < startEdges[j].To().ID() }