kubernetes/vendor/github.com/xlab/treeprint/treeprint.go

type Value …

type MetaValue …

type NodeVisitor …

type Tree …

type Node …

func (n *Node) FindLastNode() Tree { … }

func (n *Node) AddNode(v Value) Tree { … }

func (n *Node) AddMetaNode(meta MetaValue, v Value) Tree { … }

func (n *Node) AddBranch(v Value) Tree { … }

func (n *Node) AddMetaBranch(meta MetaValue, v Value) Tree { … }

func (n *Node) Branch() Tree { … }

func (n *Node) FindByMeta(meta MetaValue) Tree { … }

func (n *Node) FindByValue(value Value) Tree { … }

func (n *Node) Bytes() []byte { … }

func (n *Node) String() string { … }

func (n *Node) SetValue(value Value) { … }

func (n *Node) SetMetaValue(meta MetaValue) { … }

func (n *Node) VisitAll(fn NodeVisitor) { … }

func printNodes(wr io.Writer,
	level int, levelsEnded []int, nodes []*Node) { … }

func printValues(wr io.Writer,
	level int, levelsEnded []int, edge EdgeType, node *Node) { … }

func isEnded(levelsEnded []int, level int) bool { … }

func renderValue(level int, node *Node) Value { … }

// padding returns a padding for the multiline values with correctly placed link edges.
// It is generated by traversing the tree upwards (from leaf to the root of the tree)
// and, on each level, checking if the Node the last one of its siblings.
// If a Node is the last one, the padding on that level should be empty (there's nothing to link to below it).
// If a Node is not the last one, the padding on that level should be the link edge so the sibling below is correctly connected.
func padding(level int, node *Node) string { … }

// isLast checks if the Node is the last one in the slice of its parent children
func isLast(n *Node) bool { … }

type EdgeType …

var EdgeTypeLink …

var EdgeTypeMid …

var EdgeTypeEnd …

var IndentSize …

// New Generates new tree
func New() Tree { … }

// NewWithRoot Generates new tree with the given root value
func NewWithRoot(root Value) Tree { … }