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> (by csimplestring)
hashmap
A Golang lock-free thread-safe HashMap optimized for fastest read access. (by cornelk)
| go-left-right | hashmap | |
|---|---|---|
| 1 | 8 | |
| 44 | 1,719 | |
| - | - | |
| 0.0 | 2.9 | |
| over 1 year ago | 9 months ago | |
| Go | Go | |
| - | Apache License 2.0 |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
go-left-right
Posts with mentions or reviews of go-left-right.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-08-18.
hashmap
Posts with mentions or reviews of hashmap.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-02-01.
-
SwissMap: A smaller, faster Golang Hash Table
I generally just use this one: https://github.com/cornelk/hashmap
Mostly in that it also gives me lock free performance, which cleans up a lot of defers.
-
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
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
-
how does lock-free (or lockless) hashmap works?
I ran across this library recently - https://github.com/cornelk/hashmap
What are some alternatives?
When comparing go-left-right and hashmap you can also consider the following projects:
concurrent-map - a thread-safe concurrent map for go
haxmap - Fastest and most memory efficient golang concurrent hashmap