trietree

type DNode struct {
	// Label is a rune assigned this node. The label is unique among sibling
	// nodes
	Label rune

	// EdgeID indicates the node has a corresponding key or not.
	EdgeID int

	// Level is equals key length when EdgeID is not zero.
	Level int

	// Low is sibling nodes which have smaller Label.
	Low *DNode

	// High is sibling node which have greater Label.
	High *DNode

	// Child is a top node of children nods.
	Child *DNode

	// Failure is used as a search destination when the desired Label is not
	// found in Child. This will be filled by FillFailure().
	Failure *DNode
}

type DTree struct {
	Root DNode
	// contains filtered or unexported fields
}

type Prediction struct {
	Start int // Start is start index of key in query.
	End   int // End is end index of key in query.
	ID    int // ID is for edge node identifier.
}

type PredictionIter func() *Prediction

type SNode struct {
	Label  rune
	Start  int // start index for children (inclusive)
	End    int // end index of children (exclusive)
	Fail   int // index to failure node
	EdgeID int
}

type STree struct {
	Nodes  []SNode
	Levels []int
}

type ScanEvent struct {
	Index int
	Label rune
	Nodes []ScanNode
}

type ScanNode struct {
	ID    int
	Level int
}

type ScanReportFunc func(ev ScanEvent)

type ScanReporter interface {
	ScanReport(ev ScanEvent)
}