encoding
gods
Our great sponsors
| encoding | gods | |
|---|---|---|
| 1 | 9 | |
| 128 | 15,418 | |
| 0.0% | - | |
| 0.0 | 3.1 | |
| over 6 years ago | 17 days ago | |
| Go | Go | |
| Apache License 2.0 | GNU General Public License v3.0 or later |
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.
encoding
-
q_compress 0.7: still has 35% higher compression ratio than .zstd.parquet for numerical sequences, now with delta encoding and 2x faster than before
I tried q_compress out on some of the datasets you linked and got these compressed sizes:
gods
-
How do you go about the lack of built in data structure like stack, queue for LeetCode
for len(stack) > 0 { n := len(stack) - 1 // Top element fmt.Print(stack[n]) stack = stack[:n] // Pop } ``` Another solution would be to import a package like https://github.com/emirpasic/gods
-
Go Structures - Custom made generic data structures for Golang
What is the goal of this project? A learning exercise? There are many fairly matured solutions already available like https://github.com/emirpasic/gods. It also does not look implemented effectively. For example Stack uses for its push/pop operations costly List methods.
- Golang & Data Structures
-
Hash Array Mapped Trie (HAMT) implemented in Go (1.18+ generics)
Doesn't say why it's here instead of trying to get into GoDS or something else.
-
Are there implementations of data structures with generics? Are they needed?
I've found GoDS (https://github.com/emirpasic/gods) but it is not using generics, it's using "interface{}" as a type for everything.
- Gods Go Data Structures
- Experimental generic implementations of various data structures (map, b-tree, AVL tree, rope, and more)
-
Have you used a trie in Go?
You may want to try this implementation
What are some alternatives?
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
go-datastructures - A collection of useful, performant, and threadsafe Go datastructures.
hilbert - Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves.
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
fsm - Finite State Machine for Go
gomarkdoc - Generate markdown documentation for Go (golang) code
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom
gota - Gota: DataFrames and data wrangling in Go (Golang)
conjungo - A small flexible merge library in go
levenshtein - Go implementation to calculate Levenshtein Distance.
ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]