Portable C, C++ code for hash tables, bloom filters, string-search, string utilities, hash functions, arc4random
-
Updated
Jul 30, 2024 - C
Portable C, C++ code for hash tables, bloom filters, string-search, string utilities, hash functions, arc4random
Implementation of shared-memory ring-buffers
A thread-safe queue faster and more resource efficient than golang's native channels
A bounded single-producer single-consumer wait-free and lock-free queue written in C++11
SPSC channels in Rust transmitted over e.g. TCP
Single-producer single-consumer ring buffer
a single producer single customer lock-free (atomic) queue
A single-producer single-consumer Rust queue with smart batching
A collection of lockless, concurrent queues
Built a kernel from scratch with a menu-based interactive responsive shell
C/C++Non-Blocking Lock-Free/Wait-Free Circular-Queue
Various collections which are completely unmanaged by the GC
lock-free data structures: SPSC ring buffer, MPMC ring buffer, MPMC single linked list queue, MPMC single linked list stack; lock free memory management library using fix sized memory managed in single linked list
Fast and easy to use SPSC Circular Ringbuffer using core principles presented by the developers of the LMAX Disruptor.
A fast, concurrent, bounded, single producer, single consumer queue
Add a description, image, and links to the spsc-queue topic page so that developers can more easily learn about it.
To associate your repository with the spsc-queue topic, visit your repo's landing page and select "manage topics."