ZIO — A type-safe, composable library for async and concurrent programming in Scala
-
Updated
Jun 9, 2024 - Scala
ZIO — A type-safe, composable library for async and concurrent programming in Scala
Concurrent tree structure for in-memory index
A high-performance, lock-free ring buffer for single-producer, single-consumer scenarios.
ConcurrentSortedDictionary implementation in (c#, .NET 7) . It is implemented using a concurrent B+Tree
BEAM friendly spinlocks for Elixir/Erlang
Implements a vector-based slab-like map with an interface similar to that of HashMap, and also provides tools for generating lightweight identifiers that can be type-safely used as keys for this map.
High performance containers and utilities for concurrent and asynchronous programming
Lock-free SPSC FIFO ring buffer with direct access to inner data
Blazing fast concurrent HashMap for Rust.
AtomicRingBuffer is a constant-size almost lock-free ring buffer with low memory overhead in Rust
Extension of atomic triples in Iris with atomic postconditions and formal verification of the Lazy JellyFish skip list
A blazingly fast™ single producer multiple consumer broadcast queue
Library for modelling Rust applications with actors
📶 A lock- and wait-free hashtable (and an array too)
🔜 fixed sized producer/consumer FIFOs holding void *
Fast, multi-reader, multi-writer, lockless data structures for parallel programming
🐛 mulle-multififo multi-producer/multi-consumer FIFO holding `void *`
The seq library is a collection of original C++14 STL-like containers and related tools
A bounded single-producer single-consumer wait-free and lock-free queue written in C++11
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."