github.com/MathieuTurcotte/go-trie
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.
$ go get github.com/MathieuTurcotte/go-trie/gtrie
Read it online or run
$ go doc github.com/MathieuTurcotte/go-trie/gtrie
This code is free to use under the terms of the MIT license.
FAQs
Unknown package
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Security News
CISOs are racing to adopt AI for cybersecurity, but hurdles in budgets and governance may leave some falling behind in the fight against cyber threats.
Research
Security News
Socket researchers uncovered a backdoored typosquat of BoltDB in the Go ecosystem, exploiting Go Module Proxy caching to persist undetected for years.
Security News
Company News
Socket is joining TC54 to help develop standards for software supply chain security, contributing to the evolution of SBOMs, CycloneDX, and Package URL specifications.