index

Jun 3, 2024

Changes in this version

type Node

+ func (n *Node[V]) UpdateDescendantsSize() int

Jan 5, 2024

Changes in this version

+ type TokenType int

+ const End

+ const Start

+ const Text

+ func (c TokenType) ToString() string

type Tree

+ func (t *Tree[V]) TokensBetween(from int, to int, callback func(token TreeToken[V], ended bool)) error

+ type TreeToken struct

+ Node V

+ TokenType TokenType

Dec 4, 2023

Changes in this version

type Node

+ func (n *Node[V]) SetChildrenInternal(children []*Node[V]) error

Nov 25, 2023

Changes in this version

type Node

+ func (n *Node[V]) HasTextChild() bool

Aug 25, 2023

Changes in this version

type Node

+ func (n *Node[V]) FindOffset(node *Node[V]) (int, error)

+ type TagContained int

+ const AllContained

+ const ClosingContained

+ const OpeningContained

+ func (c TagContained) ToString() string

type Tree

+ func (t *Tree[V]) LeftSiblingsSize(parent *Node[V], offset int) (int, error)

+ func (t *Tree[V]) PathToIndex(path []int) (int, error)

Jul 4, 2023

Changes in this version

+ var ErrChildNotFound = errors.New("child not found")

+ var ErrInvalidMethodCallForTextNode = errors.New("text node cannot have children")

+ var ErrInvalidTreePos = errors.New("invalid tree pos")

+ var ErrUnreachablePath = errors.New("unreachable path")

Jun 29, 2023

Changes in this version

+ func TraverseAll(tree *Tree[V], callback func(node *Node[V], depth int))

type Node

+ func (n *Node[V]) RemoveChild(child *Node[V])

Jun 19, 2023

Changes in this version

type Value

+ Attributes func() string

Jun 5, 2023

Changes in this version

+ const DefaultTextType

+ func ToXML(node *Node[V]) string

+ func Traverse(tree *Tree[V], callback func(node *Node[V], depth int))

+ func TraverseNode(node *Node[V], callback func(node *Node[V], depth int))

+ type Node struct

+ Length int

+ Parent *Node[V]

+ Type string

+ Value V

+ func NewNode(nodeType string, value V, children ...*Node[V]) *Node[V]

+ func (n *Node[V]) Append(newNodes ...*Node[V])

+ func (n *Node[V]) Child(index int) *Node[V]

+ func (n *Node[V]) Children(includeRemovedNode ...bool) []*Node[V]

+ func (n *Node[V]) FindBranchOffset(node *Node[V]) int

+ func (n *Node[V]) InsertAfter(newNode, referenceNode *Node[V])

+ func (n *Node[V]) InsertAfterInternal(newNode, prevNode *Node[V])

+ func (n *Node[V]) InsertAt(newNode *Node[V], offset int)

+ func (n *Node[V]) InsertBefore(newNode, referenceNode *Node[V])

+ func (n *Node[V]) IsAncestorOf(node *Node[V]) bool

+ func (n *Node[V]) IsText() bool

+ func (n *Node[V]) Len() int

+ func (n *Node[V]) OffsetOfChild(node *Node[V]) int

+ func (n *Node[V]) PaddedLength() int

+ func (n *Node[V]) Prepend(children ...*Node[V])

+ func (n *Node[V]) SetChildren(children []*Node[V])

+ func (n *Node[V]) UpdateAncestorsSize()

+ type Tree struct

+ func NewTree(root *Node[V]) *Tree[V]

+ func (t *Tree[V]) FindCommonAncestor(nodeA, nodeB *Node[V]) V

+ func (t *Tree[V]) FindLeftmost(node *Node[V]) V

+ func (t *Tree[V]) FindPostorderRight(pos *TreePos[V]) V

+ func (t *Tree[V]) FindTreePos(index int, preferTexts ...bool) *TreePos[V]

+ func (t *Tree[V]) GetAncestors(node *Node[V]) []*Node[V]

+ func (t *Tree[V]) IndexOf(node *Node[V]) int

+ func (t *Tree[V]) NodesBetween(from int, to int, callback func(node V))

+ func (t *Tree[V]) PathToTreePos(path []int) *TreePos[V]

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

+ func (t *Tree[V]) TreePosToPath(treePos *TreePos[V]) []int

+ type TreePos struct

+ Node *Node[V]

+ Offset int

+ type Value interface

+ IsRemoved func() bool

+ Length func() int

+ String func() string