levenshtein
bitset
| levenshtein | bitset | |
|---|---|---|
| 2 | 1 | |
| 319 | 1,263 | |
| - | 0.7% | |
| 0.0 | 6.2 | |
| about 1 year ago | 4 days ago | |
| Go | Go | |
| MIT License | BSD 3-clause "New" or "Revised" 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
bitset
-
I have some questions about defining a series of bits in Golang
For (3), and if you’re interested in checking if specific bits are set or not, take a look at https://github.com/bits-and-blooms/bitset and https://github.com/RoaringBitmap/roaring.
What are some alternatives?
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
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
Bloomfilter
willf/bloom - Go package implementing Bloom filters, used by Milvus and Beego.
bitmap - Simple dense bitmap index in Go with binary operators
bloom - Bloom filters implemented in Go.
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
roaring - Roaring bitmaps in Go (golang), used by InfluxDB, Bleve, DataDog