C 14 lock-free queue.

A collection of lock-free data structures written in standard C 11

Fast ring-buffer deque (double-ended queue)

⏪️ Go package providing multiple queue implementations. Developed in a thread-safe generic way.

Lock-free MPMC Ring Buffer (Generic) for SMP, in golang. Some posts in chinese:

Easy implementation of various Data Structures in Java language. Red-Black Tree, Splay Tree, AVLTree, PriorityQueue, Doubly-Linked-List, Stack, Queue, Array, ArrayList, Disjoint-Set,Binary-Search Tree, B-Tree.

Single Header Constexpr Circular Queue

Follow my daily journey of mastering Data Structures & Algorithms in C with hands-on coding. Explore my progress and code snippets!

Implementation of a circular queue in hardware using verilog.

Data Structure and Algorithms

(Incomplete, In Continuation) Implementation of Data Structures like Stacks, Queues, etc. using C programming language

C/C Non-Blocking Lock-Free/Wait-Free Circular-Queue

Network Flows Optimization - Shortest Path, Max Flow and Min Cost Flow Algorithms in Python

An queue data structure implementation for PAWN using circular algorithm.

A ringbuffer implementation in golang

3 different C , multi-threaded queues including a lock-free one

Algorithms and ADTs • binary search algorithm • conditions necessary for the use of a binary search • performance of a binary search • implement an insertion sort • implement a bubble sort • performance of a sort routine • find an item in : linked list, binary tree, hash table • insert an item: stack, queue, linked list, binary tree, hash table …

Basic programs written in C using ANSI for GNU-GCC

FIFO queue for generalised items, implemented as a circular buffer

CircularDict is a high-performance Python data structure that blends the functionality of dictionaries and circular buffers. Inheriting the usage of traditional dictionaries, it allows you to define constraints on size and memory usage. Ideal for caching large data structures while maintaining control over memory footprint.