levenshtein
conjungo
levenshtein | conjungo | |
---|---|---|
2 | - | |
319 | 125 | |
- | 0.8% | |
0.0 | 1.3 | |
about 1 year ago | 12 months 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.
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
conjungo
We haven't tracked posts mentioning conjungo yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
bit - Bitset data structure
ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
bitset - Go package implementing bitsets
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom
gostl - Data structure and algorithm library for go, designed to provide functions similar to C++ STL
willf/bloom - Go package implementing Bloom filters, used by Milvus and Beego.
gota - Gota: DataFrames and data wrangling in Go (Golang)
bloom - Bloom filters implemented in Go.
merkletree - A Merkle Tree implementation written in Go.