TrieTree

Documentation

Index

• type Node
  • func NewTrieTree() *Node
  • func (this *Node) Add(str string, count, incr int) int
  • func (this *Node) FuzzySearch(fuzzy string, topCount int) SearchResult
  • func (this *Node) PrefixSearch(prefix string, topCount int) SearchResult
  • func (this *Node) SubstrSearch(sub string, topCount int) SearchResult
• type SearchResult
  • func (this SearchResult) Len() int
  • func (this SearchResult) Less(i, j int) bool
  • func (this SearchResult) Sort()
  • func (this SearchResult) Swap(i, j int)
• type WordCount

Types

type Node

type Node struct {
	Count    int
	Children map[rune]*Node
}

func NewTrieTree

func NewTrieTree() *Node

func (*Node) Add

func (this *Node) Add(str string, count, incr int) int

func (*Node) FuzzySearch

func (this *Node) FuzzySearch(fuzzy string, topCount int) SearchResult

func (*Node) PrefixSearch

func (this *Node) PrefixSearch(prefix string, topCount int) SearchResult

func (*Node) SubstrSearch

func (this *Node) SubstrSearch(sub string, topCount int) SearchResult

type SearchResult

type SearchResult []*WordCount

func (SearchResult) Len

func (this SearchResult) Len() int

func (SearchResult) Less

func (this SearchResult) Less(i, j int) bool

func (SearchResult) Sort

func (this SearchResult) Sort()

func (SearchResult) Swap

func (this SearchResult) Swap(i, j int)

type WordCount

type WordCount struct {
	Word  string
	Count int
}