trie
ttlcache
trie | ttlcache | |
---|---|---|
1 | 2 | |
12 | 388 | |
- | - | |
5.1 | 6.4 | |
about 2 months ago | about 2 years ago | |
Go | Go | |
MIT License | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
trie
ttlcache
-
Easy and Simple in-memory cache in Golang
And the library that will be used to cache our application data is ttlcache, because it is easy to use and has an immensely intuitive API.
-
Lazy cache with an interface as a key
My favourite form of caching is one that expires auto-magically https://github.com/ReneKroon/ttlcache
What are some alternatives?
trie - Missing Trie implementation for Go
gocache - ☔️ A complete Go cache library that brings you multiple ways of managing your caches
chtrie - Coordinate Hash Trie: A Trie Variant Balancing between Time, Space, and Simplicity
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
art - Adaptive Radix Tree done right
levenshtein - Go implementation to calculate Levenshtein Distance.
trie - A Trie implementation in Go meant for auto-completion use cases. Supports Levenshtein distance search.
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
data-structures - Go datastructures.
count-min-log - Go implementation of Count-Min-Log
go-succinct-data-structure-trie - Succinct Data Structure of Trie, written in Go
boomfilters - Probabilistic data structures for processing continuous, unbounded streams.