trie

Documentation

Index

• Variables
• func HasEOS(t *TrieNode) bool
• func PotentialDir(t *TrieNode) bool
• func PotentialTerminalDir(t *TrieNode) bool
• type Trie
  • func New(alphabetizer *alphabet) *Trie
  • func (t *Trie) Apply(f func(*TrieNode))
  • func (t *Trie) BreadthFirstApply(apply func(interface{}))
  • func (t *Trie) BreadthFirstWalk(levelApply func([]interface{})) (bch chan interface{})
  • func (t *Trie) Get(key string) (value interface{}, ok bool)
  • func (t *Trie) Match(pass func(*TrieNode) bool) (matches chan *TrieNode)
  • func (t *Trie) MatchAndHarvest(pass func(*TrieNode) bool) (matches chan *TrieNode)
  • func (t *Trie) Pop(key string) (popd interface{}, ok bool)
  • func (t *Trie) Set(key string, value interface{}) (prev interface{})
  • func (t *Trie) Tag(pass func(*TrieNode) bool, tag interface{}) int
  • func (t *Trie) Walk() chan interface{}
• type TrieNode
  • func (tn *TrieNode) EOS() bool
  • func (tn *TrieNode) Match(pass func(*TrieNode) bool) (matches chan *TrieNode)

Variables

var (
	NumericStart = 0
	NumericEnd   = 9
	NumericOther = (NumericEnd - NumericStart) + 1
)

var AsciiAlphabet = &alphabet{
	min:          0,
	max:          255,
	alphabetizer: indexResolver(asciiAlphabetizer),
}

var NumericAlphabet = &alphabet{
	min:          NumericStart,
	max:          NumericOther + 1,
	alphabetizer: indexResolver(numericAlphabetizer),
}

Functions

func HasEOS

func HasEOS(t *TrieNode) bool

func PotentialDir

func PotentialDir(t *TrieNode) bool

func PotentialTerminalDir

func PotentialTerminalDir(t *TrieNode) bool

Types

type Trie

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

func New

func New(alphabetizer *alphabet) *Trie

func (*Trie) Apply

func (t *Trie) Apply(f func(*TrieNode))

func (*Trie) BreadthFirstApply

func (t *Trie) BreadthFirstApply(apply func(interface{}))

func (*Trie) BreadthFirstWalk

func (t *Trie) BreadthFirstWalk(levelApply func([]interface{})) (bch chan interface{})

func (*Trie) Get

func (t *Trie) Get(key string) (value interface{}, ok bool)

func (*Trie) Match

func (t *Trie) Match(pass func(*TrieNode) bool) (matches chan *TrieNode)

func (*Trie) MatchAndHarvest

func (t *Trie) MatchAndHarvest(pass func(*TrieNode) bool) (matches chan *TrieNode)

func (*Trie) Pop

func (t *Trie) Pop(key string) (popd interface{}, ok bool)

func (*Trie) Set

func (t *Trie) Set(key string, value interface{}) (prev interface{})

func (*Trie) Tag

func (t *Trie) Tag(pass func(*TrieNode) bool, tag interface{}) int

func (*Trie) Walk

func (t *Trie) Walk() chan interface{}

type TrieNode

type TrieNode struct {
	Data interface{}
	// Tag should help to annotate a specific feature e.g color, discovered, isDir etc
	Tag      interface{}
	Children *[]*TrieNode
	// Eos(End-Of-Sequence) is designated to terminate a sequence.
	Eos bool
}

func (*TrieNode) EOS

func (tn *TrieNode) EOS() bool

func (*TrieNode) Match

func (tn *TrieNode) Match(pass func(*TrieNode) bool) (matches chan *TrieNode)