trie alternatives and similar packages
Based on the "Data Structures" category.
Alternatively, view trie alternatives based on common mentions on social networks and blogs.
-
gods
GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more -
go-datastructures
A collection of useful, performant, and threadsafe Go datastructures. -
golang-set
A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp. -
-
-
-
-
gocache
☔️ A complete Go cache library that brings you multiple ways of managing your caches -
boomfilters
Probabilistic data structures for processing continuous, unbounded streams. -
-
gostl
Data structure and algorithm library for go, designed to provide functions similar to C++ STL -
hyperloglog
HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom -
go-geoindex
Go native library for fast point tracking and K-Nearest queries -
ttlcache
An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache] -
-
hilbert
Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves. -
Bloomfilter
Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go -
go-adaptive-radix-tree
Adaptive Radix Trees implemented in Go -
goconcurrentqueue
Go concurrent-safe, goroutine-safe, thread-safe queue -
cuckoo-filter
Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现，优于布隆过滤器，可以定制化过滤器参数，并进行了空间优化 -
-
-
-
ring
Package ring provides a high performance and thread safe Go implementation of a bloom filter. -
-
go-rquad
:pushpin: State of the art point location and neighbour finding algorithms for region quadtrees, in Go -
set
A simple Set data structure implementation in Go (Golang) using LinkedHashMap. -
nan
Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers -
goset
Set is a useful collection but there is no built-in implementation in Go lang. -
-
Static code analysis for 29 languages.
Do you think we are missing an alternative of trie or a related project?
|
Access the most powerful time series database as a service
sponsored
www.influxdata.com
|
Popular Comparisons
|
SaaSHub - Software Alternatives and Reviews
sponsored
www.saashub.com
|
README
Trie
Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
Usage
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:
t.Remove("foobar")
Prefix search with:
t.PrefixSearch("foo")
Fast test for valid prefix:
t.HasKeysWithPrefix("foo")
Fuzzy search with:
t.FuzzySearch("fb")
Contributing
Fork this repo and run tests with:
go test
Create a feature branch, write your tests and code and submit a pull request.
License
MIT
*Note that all licence references and agreements mentioned in the trie README section above
are relevant to that project's source code only.