tree

package

v0.0.0-...-e50112c Latest Latest Go to latest Published: Mar 22, 2024 License: BSD-3-Clause Imports: 11 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

This section is empty.

This section is empty.

func RegisterNodeDataDecoder(typ string, f func(bytes []byte) (interface{}, error))

type EachOrder int

const (
	OrderPre  EachOrder = 1 // 前序遍历，先遍历根节点，然后再遍历子节点
	OrderPost EachOrder = 2 // 后序遍历，先遍历子节点，然后再遍历根节点
)

func (i EachOrder) String() string

type Node struct {
	// contains filtered or unexported fields
}

func (this *Node) AddChild(id string, typ string, data interface{}) (added *Node, err error)

func (this *Node) AddChildData(data ...NodeData) (added []*Node, err error)

func (this *Node) Children() []*Node

func (this *Node) Data() interface{}

func (this *Node) Each(order EachOrder, f func(node *Node, depth int) bool, maxDepth ...int)

遍历节点及其所有子孙节点。

order: 排序方式。 PreOrder=前序遍历; PostOrder=后序遍历。
f: 回调函数，如果 f 返回 false，则会中止遍历。
   depth: 当前遍历深度，从 0 开始累加。
maxDepth: 最大遍历深度。

func (this *Node) Id() string

func (this *Node) MustAddChild(id string, typ string, data interface{}) (added *Node)

func (this *Node) Parent() *Node

func (this *Node) SetData(typ string, data interface{}) *Node

func (this *Node) Type() string

type NodeData struct {
	Id   string
	Type string
	Data interface{}
}

type Tree struct {
	Name string `json:"name,omitempty"`
	// contains filtered or unexported fields
}

func (this *Tree) AddNode(pid, id string, typ string, data interface{}) (added *Node, err error)

func (this *Tree) Each(order EachOrder, f func(node *Node, depth int) bool, maxDepth ...int)

遍历节点及其所有子孙节点。

order: 排序方式。 PreOrder=前序遍历; PostOrder=后序遍历。
f: 回调函数，如果 f 返回 false，则会中止遍历。
   depth: 当前遍历深度，从 0 开始累加。
maxDepth: 最大遍历深度。

func (this *Tree) GetNode(id string) (node *Node)

func (this *Tree) MustAddNode(pid, id string, typ string, data interface{}) (added *Node)

func (this *Tree) Root() *Node

func (this *Tree) Update()