willf/bloom
Go package implementing Bloom filters, used by Milvus and Beego. (by willf)
levenshtein
Go implementation to calculate Levenshtein Distance. (by agnivade)
| willf/bloom | levenshtein | |
|---|---|---|
| 2 | 2 | |
| 2,287 | 319 | |
| 1.0% | - | |
| 4.8 | 0.0 | |
| about 2 months ago | about 1 year ago | |
| Go | Go | |
| BSD 2-clause "Simplified" License | MIT License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
willf/bloom
Posts with mentions or reviews of willf/bloom.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-03-17.
-
willf/bloom VS bloom_cpp - a user suggested alternative
2 projects | 17 Mar 2023
-
There are 87 bloom filter crates. Strategies for choosing one?
I also have a lot of sympathy for the casual user that has a bloom-filter-shaped hole in their program that all of these filters will fill, and having reduced this part of their task to a well-known solved problem, just want to plug in a random thing & move on, with the possibility of revisiting the selection later if bloomfiltering shows up in the profiler.
levenshtein
Posts with mentions or reviews of levenshtein.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-04-07.
- 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?
When comparing willf/bloom and levenshtein you can also consider the following projects:
bit - Bitset data structure
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
boomfilters - Probabilistic data structures for processing continuous, unbounded streams.
bitset - Go package implementing bitsets
go-geoindex - Go native library for fast point tracking and K-Nearest queries
mafsa
bloom - Bloom filters implemented in Go.
willf/bloom vs bit
levenshtein vs gods
willf/bloom vs go-adaptive-radix-tree
levenshtein vs ttlcache
willf/bloom vs boomfilters
levenshtein vs bitset
willf/bloom vs go-geoindex
levenshtein vs go-adaptive-radix-tree
willf/bloom vs mafsa
levenshtein vs bloom
willf/bloom vs bloom
levenshtein vs go-geoindex