Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security Policy
  
  How Go can help keep you secure by default
Learn
Docs
- Effective Go
  
  Tips for writing clear, performant, and idiomatic Go code
- Go User Manual
  
  A complete introduction to building software with Go
- Standard library
  
  Reference documentation for Go's standard library
- Release Notes
  
  Learn what's new in each Go release
Packages
Community
- Recorded Talks
  
  Videos from prior events
- Meetups
  
  Meet other local Go developers
- Conferences
  
  Learn and network with Go developers from around the world
- Go blog
  
  The Go project's official blog.
- Go project
  
  Get help and stay informed from Go
- Get connected

mafsa

package module

Go to main page

Versions in this module

v1

v1.1.0

Jun 3, 2019

Changes in this version

type MinTree

+ func (t *MinTree) IterateDepthFirst() chan string

v1.0.0

Jun 3, 2019

Changes in this version

+ type BuildTree struct

+ Root *BuildTreeNode

+ func New() *BuildTree

+ func (t *BuildTree) Contains(word string) bool

+ func (t *BuildTree) Finish()

+ func (t *BuildTree) Insert(val string) error

+ func (t *BuildTree) MarshalBinary() ([]byte, error)

+ func (t *BuildTree) Save(filename string) error

+ func (t *BuildTree) String() string

+ func (t *BuildTree) Traverse(word []rune) *BuildTreeNode

+ type BuildTreeNode struct

+ Edges map[rune]*BuildTreeNode

+ func (tn *BuildTreeNode) OrderedEdges() []rune

+ type Decoder struct

+ func (d *Decoder) Decode(data []byte) (*MinTree, error)

+ func (d *Decoder) ReadFrom(r io.Reader) (*MinTree, error)

+ type Encoder struct

+ func (e *Encoder) Encode(t *BuildTree) ([]byte, error)

+ func (e *Encoder) WriteTo(wr io.Writer, t *BuildTree) error

+ type Entry struct

+ Index int

+ Value string

+ type MinTree struct

+ Root *MinTreeNode

+ func Load(filename string) (*MinTree, error)

+ func (t *MinTree) Contains(word string) bool

+ func (t *MinTree) IndexedTraverse(word []rune) (*MinTreeNode, int)

+ func (t *MinTree) String() string

+ func (t *MinTree) Traverse(word []rune) *MinTreeNode

+ func (t *MinTree) UnmarshalBinary(data []byte) error

+ type MinTreeNode struct

+ Edges map[rune]*MinTreeNode

+ Final bool

+ Number int

+ func (n *MinTreeNode) OrderedEdges() []rune