README
¶
go-trie (WORK IN PROGRESS)
A pure-Go implementation of a Trie data structure for strings.
Installation
$ go get github.com/cespare/go-trie
Usage
Very simple example usage.
import (
"github.com/cespare/go-trie"
)
t = trie.New()
t.Add("Hello!")
t.Contains("Hello!") // => true
t.Contains("Goodbye!") // => false
Please see the API documentation for more information and more advanced usage.
Author
Caleb Spare (cespare)
To Do
- Finish a working implementation!
- The trie.Retrieve method(s) don't need to do a node-by-node walk -- they can do a more efficient search by doing a direct byte-by-byte comparison as soon as we get to the tail.
- Reading/writing from disk
License
MIT Licensed.
Documentation
¶
Overview ¶
The trie package implements a trie (prefix tree) data structure over byte slices.
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Node ¶
type Node struct {
// contains filtered or unexported fields
}
The Node abstraction is provided to allow for simple walking and inspection of the trie. It represents a single vertex of the logical trie structure.
type Trie ¶
type Trie struct {
// contains filtered or unexported fields
}
The core trie data structure.
func (*Trie) Add ¶
Add a []byte to a trie. The return value indicates whether s was added to the trie -- it is true if s was not already present; false otherwise.
func (*Trie) ChildrenWithPrefix ¶
Return all keys in the trie beginning with a certain prefix.
Source Files
Directories
Click to show internal directories.
Click to hide internal directories.