go-trie

module

v0.0.0-...-fe74c50 Latest Latest Go to latest Published: Nov 10, 2016 License: MIT

Details

Valid go.mod file
Redistributable license
Tagged version
Stable version
Learn more about best practices

Repository

github.com/ctdk/go-trie

Links

Open Source Insights

README ¶

About

This library implements tries, also known as prefix trees, using minimal acyclic finite-state automata for the Go programming language (http://golang.org/).

The implementation is based on Jan Daciuk, Stoyan Mihov, Bruce W. Watson, Richard E. Watson (2000). "Incremental Construction of Minimal Acyclic Finite-State Automata". Computational Linguistics: March 2000, Vol. 26, No. 1, Pages 3-16.

The javascript equivalent of this library can be found at MathieuTurcotte/node-trie.

Installing

$ go get github.com/MathieuTurcotte/go-trie/gtrie

Documentation

Read it online or run

$ go doc github.com/MathieuTurcotte/go-trie/gtrie

License

This code is free to use under the terms of the MIT license.

Directories ¶

Path	Synopsis
gtrie Package gtrie provides a trie implementation based on a minimal acyclic finite-state automaton.	Package gtrie provides a trie implementation based on a minimal acyclic finite-state automaton.

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL