gota
go-adaptive-radix-tree
gota | go-adaptive-radix-tree | |
---|---|---|
4 | - | |
3,071 | 365 | |
2.3% | - | |
0.0 | 3.4 | |
over 1 year ago | 7 days ago | |
Go | Go | |
GNU General Public License v3.0 or later | 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.
gota
-
Looking for some help on querying slice of map[string]any using group by fields and aggregate functions
Is the Gota project still maintained?
-
What libraries are missing?
Could give this a try https://github.com/go-gota/gota
-
Is Go a good language for a beginner in machine learning?
I did find a dataframe library for Go: gota. But compared to Pandas, it's API was just plain ugly, imo. Ofcourse it's further complicated by the fact that this doesn't use generics yet, so further uglified by interface{} littered everywhere.
-
Useful Go data engineering libraries
Maybe look at https://github.com/go-gota/gota for a start.
go-adaptive-radix-tree
We haven't tracked posts mentioning go-adaptive-radix-tree yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
bloom - Bloom filters implemented in Go.
go-datastructures - A collection of useful, performant, and threadsafe Go datastructures.
bitmap - Simple dense bitmap index in Go with binary operators
gocache - ☔️ A complete Go cache library that brings you multiple ways of managing your caches
bitset - Go package implementing bitsets
algorithms - CLRS study. Codes are written with golang.
levenshtein - Go implementation to calculate Levenshtein Distance.
trie - Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
merkletree - A Merkle Tree implementation written in Go.