trie alternatives and similar packages
Based on the "Data Structures" category
Do you think we are missing an alternative of trie or a related project?
Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
Create a Trie with:
t := trie.New()
Add Keys with:
// Add can take in meta information which can be stored with the key. // i.e. you could store any information you would like to associate with // this particular key. t.Add("foobar", 1)
Find a key with:
node, ok := t.Find("foobar") meta := node.Meta() // use meta with meta.(type)
Remove Keys with:
Prefix search with:
Fast test for valid prefix:
Fuzzy search with:
Fork this repo and run tests with:
Create a feature branch, write your tests and code and submit a pull request.
*Note that all licence references and agreements mentioned in the trie README section above are relevant to that project's source code only.