bloom
levenshtein
| bloom | levenshtein | |
|---|---|---|
| - | 2 | |
| 147 | 319 | |
| 0.0% | - | |
| 0.0 | 0.0 | |
| about 6 years ago | about 1 year 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.
bloom
We haven't tracked posts mentioning bloom yet.
Tracking mentions began in Dec 2020.
levenshtein
- Levenshtein Distance
-
find the difference between two strings ?
Wow, the original post has been deleted but replying still as somebody might hear about Levenshtein distance for the first time. https://github.com/agnivade/levenshtein
What are some alternatives?
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
trie - Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom
bitset - Go package implementing bitsets
merkletree - A Merkle Tree implementation written in Go.
mafsa
willf/bloom - Go package implementing Bloom filters, used by Milvus and Beego.
gocache - ☔️ A complete Go cache library that brings you multiple ways of managing your caches
go-geoindex - Go native library for fast point tracking and K-Nearest queries