A collection of lock-free data structures written in standard C++11
-
Updated
Apr 10, 2024 - C++
A collection of lock-free data structures written in standard C++11
Fast ring-buffer deque (double-ended queue)
A simple ring buffer (circular buffer) designed for embedded systems.
simple C++11 ring buffer implementation, allocated and evaluated at compile time
Swift Collection Data Structures Library
A fixed-size circular buffer written in Rust.
Lock-free MPMC Ring Buffer (Generic) for SMP, in golang. Some posts in chinese:
A constexpr STL style circular buffer implementation
A Lock Free Bipartite Buffer Library written in standard C11
Algorithmic reverb VST using FDN's
Lock-free queue implementations for Nim.
A lightweight C++ STL style circular buffer.
Circular Buffer/ Circular Array
An STL-like ring buffer for C++11.
This repository contains a circular buffer or a ring buffer implementation in C code suitable for embedded systems.
MOVED TO GITLAB
An optimized Ring Buffer implementation based on the POSIX shared memory trick
Generic data structures with C. There are implementation of Circular buffer, Linked List, Dynamic Array, Stack, Queue.
Add a description, image, and links to the circular-buffer topic page so that developers can more easily learn about it.
To associate your repository with the circular-buffer topic, visit your repo's landing page and select "manage topics."