Tree

May 12, 2024

Changes in this version

type Tree

+ func (t *Tree[T]) GetDirectChildren() []*TreeNode[T]

type TreeNode

+ func (n *TreeNode[T]) GetData() T

May 9, 2024

Changes in this version

+ type NoInfo struct

+ func NewNoInfo() *NoInfo

+ func (n *NoInfo) Copy() intf.Copier

+ type NoInfoNextsFunc func(elem T) ([]T, error)

+ type NoInfoObserverFunc func(data T) error

+ type NoInfoTraversor struct

+ func NoInfoTraverse[T any](tree *Tree[T], f NoInfoObserverFunc[T]) *NoInfoTraversor[T]

+ func (t *NoInfoTraversor[T]) BFS() error

+ func (t *NoInfoTraversor[T]) DFS() error

type Tree

+ func NoInfoMakeTree[T any](elem T, f NoInfoNextsFunc[T]) (*Tree[T], error)

+ func TreeOf(elem any) *Tree[any]

+ type Treeer interface

+ TreeOf func() *Tree[T]

May 8, 2024

Changes in this version

+ type ErrNodeNotPartOfTree struct

+ func NewErrNodeNotPartOfTree() *ErrNodeNotPartOfTree

+ func (e *ErrNodeNotPartOfTree) Error() string

+ type LeafProcessor func(data T) ([]T, error)

+ type Traversor struct

+ func Traverse[T any, I intf.Copier](tree *Tree[T], init I, f ObserverFunc[T, I]) *Traversor[T, I]

+ func (t *Traversor[T, I]) BFS() error

+ func (t *Traversor[T, I]) DFS() error

type Tree

+ func MakeTree[T any, I intf.Copier](elem T, info I, f NextsFunc[T, I]) (*Tree[T], error)

+ func (t *Tree[T]) DeleteBranchContaining(tn *TreeNode[T]) error

+ func (t *Tree[T]) FString(indentLevel int) []string

+ func (t *Tree[T]) ProcessLeaves(f LeafProcessor[T]) error

+ func (t *Tree[T]) SearchNodes(f slext.PredicateFilter[T]) *TreeNode[T]

+ func (t *Tree[T]) SetChildren(children []*Tree[T]) error

+ type TreeNode struct

+ Data T

+ func (n *TreeNode[T]) AddChild(child *TreeNode[T])

+ func (n *TreeNode[T]) AddChildren(children ...*TreeNode[T])

+ func (n *TreeNode[T]) Copy() intf.Copier

+ func (n *TreeNode[T]) DeleteChild(target *TreeNode[T]) []*TreeNode[T]

+ func (n *TreeNode[T]) GetAncestors() []*TreeNode[T]

+ func (n *TreeNode[T]) GetChildren() []*TreeNode[T]

+ func (n *TreeNode[T]) HasChild(target *TreeNode[T]) bool

+ func (n *TreeNode[T]) IsChildOf(target *TreeNode[T]) bool

+ func (n *TreeNode[T]) IsLeaf() bool

+ func (n *TreeNode[T]) IsRoot() bool

+ func (n *TreeNode[T]) Leaves() []*TreeNode[T]

+ func (n *TreeNode[T]) Parent() *TreeNode[T]

+ func (n *TreeNode[T]) Size() int

+ func (n *TreeNode[T]) ToTree() *Tree[T]

+ func (t *TreeNode[T]) FString(indentLevel int) []string

+ func (tn *TreeNode[T]) FindBranchingPoint() (*TreeNode[T], *TreeNode[T], bool)

May 6, 2024

Changes in this version

+ func ExtractData[T any](nodes []*Node[T]) []T

+ func FilterNilNode[T any](node *Node[T]) bool

+ func FilterNilTree[T any](tree *Tree[T]) bool

+ type ErrMissingRoot struct

+ func NewErrMissingRoot() *ErrMissingRoot

+ func (e *ErrMissingRoot) Error() string

type Node

+ func FindCommonAncestor[T any](n1, n2 *Node[T]) *Node[T]

+ func (n *Node[T]) AddChildren(children ...*Node[T])

+ func (n *Node[T]) Copy() intf.Copier

+ func (n *Node[T]) GetAncestors() []*Node[T]

+ func (n *Node[T]) IsChildOf(target *Node[T]) bool

+ func (n *Node[T]) IsLeaf() bool

+ func (n *Node[T]) IsRoot() bool

+ func (n *Node[T]) Leaves() []*Node[T]

+ func (n *Node[T]) Size() int

+ func (n *Node[T]) ToTree() *Tree[T]

type Tree

+ func (t *Tree[T]) AddChild(child *Node[T])

+ func (t *Tree[T]) AddChildren(children ...*Node[T])

+ func (t *Tree[T]) FilterChildren(filter slext.PredicateFilter[T]) []*Node[T]

+ func (t *Tree[T]) IsSingleton() bool

+ func (t *Tree[T]) MergeTree(tree *Tree[T])

+ func (t *Tree[T]) MergeTrees(trees ...*Tree[T])

+ func (t *Tree[T]) PruneBranches(filter slext.PredicateFilter[T]) bool

+ func (t *Tree[T]) RegenerateLeaves() []*Node[T]

+ func (t *Tree[T]) Root() *Node[T]

+ func (t *Tree[T]) Size() int

+ func (t *Tree[T]) SkipFilter(filter slext.PredicateFilter[T])

+ func (t *Tree[T]) UpdateLeaves() []*Node[T]

May 5, 2024

Changes in this version

+ type NextsFunc func(node T) ([]T, error)

+ type Node struct

+ Data T

+ func NewNode[T any](data T) *Node[T]

+ func (n *Node[T]) AddChild(child *Node[T])

+ func (n *Node[T]) DeleteChild(target *Node[T]) []*Node[T]

+ func (n *Node[T]) FindBranchingPoint() *Node[T]

+ func (n *Node[T]) GetChildren() []*Node[T]

+ func (n *Node[T]) HasChild(target *Node[T]) bool

+ func (n *Node[T]) MakeChildren(children ...T)

+ func (n *Node[T]) Parent() *Node[T]

+ type ObserverFunc func(node T) error

+ type Traverser struct

+ func NewTraverser[T any](observer ObserverFunc[T], nexts NextsFunc[T]) Traverser[T]

+ func (t *Traverser[T]) BFS(node T) error

+ func (t *Traverser[T]) DFS(node T) error

+ func (t *Traverser[T]) MakeTree(elem T) (*Tree[T], error)

+ type Tree struct

+ func NewTree[T any](root *Node[T]) *Tree[T]

+ func (t *Tree[T]) BFSTraversal(observer itff.ObserverFunc[T]) error

+ func (t *Tree[T]) Cleanup()

+ func (t *Tree[T]) DFSTraversal(observer itff.ObserverFunc[T]) error

+ func (t *Tree[T]) GetChildren() []T

+ func (t *Tree[T]) GetLeaves() []T

+ func (t *Tree[T]) HasChild(filter slext.PredicateFilter[T]) *Node[T]

+ func (t *Tree[T]) HasChildren(filter slext.PredicateFilter[T]) []*Node[T]

+ func (t *Tree[T]) PruneFunc(filter slext.PredicateFilter[T])

+ func (t *Tree[T]) SkipFunc(filter slext.PredicateFilter[T])

+ func (t *Tree[T]) SnakeTraversal() [][]T