MyGoLib

Jul 14, 2024

Changes in this version

+ type GenericLinkedStack struct

+ func NewGenericLinkedStack[T any](values ...T) *GenericLinkedStack[T]

+ func (stack *GenericLinkedStack[T]) Capacity() int

+ func (stack *GenericLinkedStack[T]) Clear()

+ func (stack *GenericLinkedStack[T]) Copy() uc.Copier

+ func (stack *GenericLinkedStack[T]) CutNilValues()

+ func (stack *GenericLinkedStack[T]) GoString() string

+ func (stack *GenericLinkedStack[T]) IsEmpty() bool

+ func (stack *GenericLinkedStack[T]) IsFull() bool

+ func (stack *GenericLinkedStack[T]) Iterator() uc.Iterater[T]

+ func (stack *GenericLinkedStack[T]) Peek() (T, bool)

+ func (stack *GenericLinkedStack[T]) Pop() (T, bool)

+ func (stack *GenericLinkedStack[T]) Push(value T) bool

+ func (stack *GenericLinkedStack[T]) Size() int

+ func (stack *GenericLinkedStack[T]) Slice() []T

+ type IntLinkedStack struct

+ func NewIntLinkedStack[T any](values ...T) *IntLinkedStack[T]

+ func (stack *IntLinkedStack[T]) Capacity() int

+ func (stack *IntLinkedStack[T]) Clear()

+ func (stack *IntLinkedStack[T]) Copy() uc.Copier

+ func (stack *IntLinkedStack[T]) CutNilValues()

+ func (stack *IntLinkedStack[T]) GoString() string

+ func (stack *IntLinkedStack[T]) IsEmpty() bool

+ func (stack *IntLinkedStack[T]) IsFull() bool

+ func (stack *IntLinkedStack[T]) Iterator() uc.Iterater[T]

+ func (stack *IntLinkedStack[T]) Peek() (T, bool)

+ func (stack *IntLinkedStack[T]) Pop() (T, bool)

+ func (stack *IntLinkedStack[T]) Push(value T) bool

+ func (stack *IntLinkedStack[T]) Size() int

+ func (stack *IntLinkedStack[T]) Slice() []T

+ type Stacker interface

+ Capacity func() int

+ Clear func()

+ IsEmpty func() bool

+ IsFull func() bool

+ Peek func() (T, bool)

+ Pop func() (T, bool)

+ Push func(value T) bool

+ PushMany func(values []T) int

+ Size func() int

Jul 13, 2024

Changes in this version

+ type MyType struct

+ type TreeNode struct

+ FirstChild *TreeNode[T]

+ LastChild *TreeNode[T]

+ NextSibling *TreeNode[T]

+ Parent *TreeNode[T]

+ PrevSibling *TreeNode[T]

+ func NewTreeNode[T any]() *TreeNode[T]

+ func (tn *TreeNode[T]) AddChild(child tr.Noder)

+ func (tn *TreeNode[T]) AddChildren(children []*TreeNode[T])

+ func (tn *TreeNode[T]) Cleanup()

+ func (tn *TreeNode[T]) Copy() uc.Copier

+ func (tn *TreeNode[T]) DeleteChild(target tr.Noder) []tr.Noder

+ func (tn *TreeNode[T]) FString(trav *ffs.Traversor, opts ...ffs.Option) error

+ func (tn *TreeNode[T]) GetAncestors() []tr.Noder

+ func (tn *TreeNode[T]) GetChildren() []tr.Noder

+ func (tn *TreeNode[T]) GetFirstChild() tr.Noder

+ func (tn *TreeNode[T]) GetFirstSibling() *TreeNode[T]

+ func (tn *TreeNode[T]) GetLastSibling() *TreeNode[T]

+ func (tn *TreeNode[T]) GetLeaves() []tr.Noder

+ func (tn *TreeNode[T]) GetParent() tr.Noder

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

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

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

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

+ func (tn *TreeNode[T]) IsSingleton() bool

+ func (tn *TreeNode[T]) Iterator() uc.Iterater[tr.Noder]

+ func (tn *TreeNode[T]) LinkChildren(children []tr.Noder)

+ func (tn *TreeNode[T]) RemoveNode() []tr.Noder

+ func (tn *TreeNode[T]) SetParent(parent tr.Noder) bool

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

+ type TreeNodeIterator struct

+ func (iter *TreeNodeIterator[T]) Consume() (tr.Noder, error)

+ func (iter *TreeNodeIterator[T]) Restart()