go-future provide function Go and return a result of an asynchronous computation. Methods Wait are provided to retrieve the result of the computation.
-
Updated
Nov 21, 2024 - Go
go-future provide function Go and return a result of an asynchronous computation. Methods Wait are provided to retrieve the result of the computation.
ZIO — A type-safe, composable library for async and concurrent programming in Scala
📶 A lock- and wait-free hashtable (and an array too)
🐛 mulle-multififo multi-producer/multi-consumer FIFO holding `void *`
🔜 fixed sized producer/consumer FIFOs holding void *
High performance containers and utilities for concurrent and asynchronous programming
Concurrent tree structure for in-memory index
java-practice
A high-performance, lock-free ring buffer for single-producer, single-consumer scenarios.
Blazing fast concurrent HashMap for Rust.
RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
ConcurrentSortedDictionary implementation in (c#, .NET 7) . It is implemented using a concurrent B+Tree
Set Data Structure
The seq library is a collection of original C++14 STL-like containers and related tools
Lock-free SPSC FIFO ring buffer with direct access to inner data
Extension of atomic triples in Iris with atomic postconditions and formal verification of the Lazy JellyFish skip list
Generic concurrent lock-free map for Golang
Generic optimistic concurrent container for Go
C++17 Library of various queue containers
A ZIO native cache with a simple and compositional interface
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."