mirror of
https://github.com/openfaas/faasd.git
synced 2025-06-08 16:06:47 +00:00
5b92e7793d
Graph logic moves into depgraph package and makes internal fields inaccessible. Completes feedback from @LucasRoesler from previous PR where the dependency graph was added for 0.9.1 Signed-off-by: Alex Ellis (OpenFaaS Ltd) <alexellis2@gmail.com>
42 lines
740 B
Go
42 lines
740 B
Go
package depgraph
|
|
|
|
import "testing"
|
|
|
|
func Test_RemoveMedial(t *testing.T) {
|
|
g := Graph{nodes: []*Node{}}
|
|
a := &Node{Name: "A"}
|
|
b := &Node{Name: "B"}
|
|
c := &Node{Name: "C"}
|
|
|
|
g.nodes = append(g.nodes, a)
|
|
g.nodes = append(g.nodes, b)
|
|
g.nodes = append(g.nodes, c)
|
|
|
|
g.Remove(b)
|
|
|
|
for _, n := range g.nodes {
|
|
if n.Name == b.Name {
|
|
t.Fatalf("Found deleted node: %s", n.Name)
|
|
}
|
|
}
|
|
}
|
|
|
|
func Test_RemoveFinal(t *testing.T) {
|
|
g := Graph{nodes: []*Node{}}
|
|
a := &Node{Name: "A"}
|
|
b := &Node{Name: "B"}
|
|
c := &Node{Name: "C"}
|
|
|
|
g.nodes = append(g.nodes, a)
|
|
g.nodes = append(g.nodes, b)
|
|
g.nodes = append(g.nodes, c)
|
|
|
|
g.Remove(c)
|
|
|
|
for _, n := range g.nodes {
|
|
if n.Name == c.Name {
|
|
t.Fatalf("Found deleted node: %s", c.Name)
|
|
}
|
|
}
|
|
}
|