count-min-log
go-datastructures
Our great sponsors
| count-min-log | go-datastructures | |
|---|---|---|
| - | 2 | |
| 66 | 7,325 | |
| - | 0.6% | |
| 0.0 | 4.8 | |
| about 7 years ago | 16 days ago | |
| Go | Go | |
| MIT License | Apache License 2.0 |
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.
count-min-log
We haven't tracked posts mentioning count-min-log yet.
Tracking mentions began in Dec 2020.
go-datastructures
-
Golang & Data Structures
https://github.com/TheAlgorithms/Go https://github.com/Workiva/go-datastructures https://github.com/ua-nick/Data-Structures-and-Algorithms
- Experimental generic implementations of various data structures (map, b-tree, AVL tree, rope, and more)
What are some alternatives?
ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
binpacker - A binary stream packer and unpacker
trie - Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
skiplist - skiplist for golang
gota - Gota: DataFrames and data wrangling in Go (Golang)
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom
mafsa
blooming-bella - A simple implementation of Bloom Filters using murmur3, Super Fast Hash and marvin32 hashing algorithms.