hashmap
treemap
Our great sponsors
| hashmap | treemap | |
|---|---|---|
| 8 | 0 | |
| 1,626 | 48 | |
| - | - | |
| 5.3 | 1.8 | |
| about 2 months ago | over 1 year ago | |
| Go | Go | |
| Apache License 2.0 | The Unlicense |
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.
hashmap
-
Go 1.20 Released
Glad to see this make it into the core.
I've been using this library for ages now...
https://github.com/cornelk/hashmap
Always entertains me to see developers write all the lock/unlock code when they could just use that.
- Ask HN: Was it worth it for Go to add generics
- Gojq: Pure Go Implementation of Jq
-
HaxMap, a concurrent hashmap faster and more memory-efficient than golang's sync.Map
Assuming it is issue 54 and its age, I am now unsure about the usability.
Pre-allocating would not fix https://github.com/cornelk/hashmap/issues/47 as the bug is in the linked list. This is not grow related but an issue with concurrent Add/Delete on the list.
-
A Go implementation of the concurrency control algorithm in paper <Left-Right -A Concurrency Control Technique with Wait-Free Population Oblivious Reads>
Would be interesting to compare with https://github.com/cornelk/hashmap
treemap
We haven't tracked posts mentioning treemap yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
skiplist - A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist
go-left-right - A faster RWLock primitive in Go, 2-3 times faster than RWMutex. A Go implementation of concurrency control algorithm in paper <Left-Right - A Concurrency Control Technique with Wait-Free Population Oblivious Reads>
sonic - A blazingly fast JSON serializing & deserializing library
trie - Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
haxmap - Fastest and most memory efficient golang concurrent hashmap
pq - Like jq, but with Python
go-datastructures - A collection of useful, performant, and threadsafe Go datastructures.
immutable-js - Immutable persistent data collections for Javascript which increase efficiency and simplicity.
xxHash - Pure Go implementation of xxHash (32 and 64 bits versions)
go - The Go programming language
boomfilters - Probabilistic data structures for processing continuous, unbounded streams.
query-json - Faster, simpler and more portable implementation of `jq` in Reason