Function TestNodeWalk

tree/node_test.go:209–276

(t *testing.T)

}

func TestNodeWalk(t *testing.T) {
	parent := NewNodeBase()
	testdata.NewNodeEmbed(parent).SetName("child0")
	child1 := NewNodeBase(parent).SetName("child1")
	testdata.NewNodeEmbed(parent).SetName("child2")
	schild1 := testdata.NewNodeEmbed(child1).SetName("subchild1")
	NewNodeBase(parent).SetName("child3")

	res := []string{}

	schild1.WalkUp(func(n Node) bool {
		res = append(res, n.AsTree().Name)
		return Continue
	})

	trg := []string{"subchild1", "child1", "node-base"}
	assert.Equal(t, trg, res)
	res = res[:0]

	parent.WalkDownPost(func(n Node) bool {
		return Continue
	},
		func(n Node) bool {
			res = append(res, fmt.Sprintf("[%s]", n.AsTree().Name))
			return Continue
		})
	trg = []string{"[child0]", "[subchild1]", "[child1]", "[child2]", "[child3]", "[node-base]"}
	assert.Equal(t, trg, res)
	res = res[:0]

	// test for Break working
	parent.WalkDownPost(func(n Node) bool {
		if n.AsTree().Name == "child1" {
			return Break
		}
		return Continue
	},
		func(n Node) bool {
			if n.AsTree().Name == "child1" {
				return Break
			}
			res = append(res, fmt.Sprintf("[%s]", n.AsTree().Name))
			return Continue
		})
	trg = []string{"[child0]", "[child2]", "[child3]", "[node-base]"}
	assert.Equal(t, trg, res)
	res = res[:0]

	parent.WalkDownBreadth(func(n Node) bool {
		res = append(res, fmt.Sprintf("[%v]", n.AsTree().Name))
		return Continue
	})
	trg = []string{"[node-base]", "[child0]", "[child1]", "[child2]", "[child3]", "[subchild1]"}
	assert.Equal(t, trg, res)
	res = res[:0]

	// test for return false
	parent.WalkDownBreadth(func(n Node) bool {