node

type Alternation interface {
	Node

	GetVariants() []Node

	VisitAlternation(
		scanner Scanner,
		input Input,
		from, to int,
		match AlternationCallback,
	)

	CopyAlternation() Alternation
}

type AlternationCallback func(x Node, from int, to int, empty bool) (stop bool)

type Callback func(x Node, from int, to int, empty bool)

type Container interface {
	Node

	GetValue() Node
}

type Input interface {
	ReadAt(int) rune
	Size() int
	Position() int
}

type Node interface {
	GetKey() string
	GetExpressions() structs.Set[string]
	AddExpression(string)
	GetNestedNodes() map[string]Node
	IsLeaf() bool

	Visit(Scanner, Input, int, int, Callback)

	// TODO : trie have few size / heights (leafs)
	// TODO : node with different sizes must have chain value instead trie to simpliy this moment
	Size() (int, bool)

	Copy() Node
}

type Output interface {
	Yield(
		n Node,
		subString string,
		sp quantity.Interface,
		groups []quantity.Interface,
		namedGroups map[string]quantity.Interface,
	)

	LastPosOf(n Node) (int, bool)
	String() string
}

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

type ScanOption uint

type Scanner interface {
	Position() int
	Rewind(pos int)

	MatchGroup(from int, to int)
	GroupsPosition() int
	GetGroup(idx int) (quantity.Interface, bool)
	RewindGroups(pos int)

	MatchNamedGroup(name string, from int, to int)
	NamedGroupsPosition() int
	GetNamedGroup(name string) (quantity.Interface, bool)
	RewindNamedGroups(pos int)

	MarkAsHole(from int, to int)
	HolesPosition() int
	RewindHoles(pos int)

	OptionsInclude(opt ScanOption) bool
	OptionsEnable(opt ScanOption)
	OptionsDisable(opt ScanOption)
	OptionsPosition() int
	RewindOptions(pos int)
}

type Table interface {
	Include(rune) bool
	Invert(rune) Table
	Empty() bool
	String() string
}