GolangDS: Data structures on Golang
-
Updated
Nov 28, 2019 - Go
GolangDS: Data structures on Golang
Generic optimistic concurrent container for Go
An approach of Golang's Pipelines
Multi-producer multi-consumer queue implemented using circular buffers
Various implementations of linked list based set
Provides several non-blocking B+Tree data structures
Go safe counter is a counter which can be used by multiple go routines at same time
Abstract channel type
Set Data Structure
Generic concurrent lock-free map for Golang
In-memory immutable wait-free consistent hashing ring data structure, supporting virtual nodes & replication.
Go Stale While Asynchronously Revalidate Memoization
🦄 LRU cache for Go @bilibili. (beats 100% submissions @ leetcode)
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>
Ordered-concurrently a library for concurrent processing with ordered output in Go. Process work concurrently and returns output in a channel in the order of input. It is useful in concurrently processing items in a queue, and get output in the order provided by the queue.
A light, high-performance, concurrent, thread-safe skip list implementation written in Golang.
skipset is a high-performance, scalable concurrent sorted set based on skip-list. Up to 15x faster than sync.Map in the typical pattern.
Add a description, image, and links to the concurrent-data-structure topic page so that developers can more easily learn about it.
To associate your repository with the concurrent-data-structure topic, visit your repo's landing page and select "manage topics."