deque
Ring buffer
A fast ring-buffer data structure implementation with efficient O(1) operations at both ends and support for queue and stack modes.
Fast ring-buffer deque (double-ended queue)
621 stars
9 watching
59 forks
Language: Go
last commit: 3 months ago
Linked from 2 awesome lists
circular-buffercircular-queuedequequeuering-buffer
Related projects:
Repository | Description | Stars |
---|---|---|
| A high-performance data structure for efficient double-ended queue operations | 187 |
| A package offering concurrent-safe queue implementations with auto-expanding capacity and fixed capacities | 404 |
| A concurrency limiting goroutine pool that manages task execution without blocking task submission or exceeding system resource limits. | 1,342 |
| A lock-free data structure that enables concurrent, efficient exchange of data between multiple threads. | 36 |
| An unlimited job queue with concurrent worker pools for Go applications | 51 |
| A simple, in-memory queue with worker pooling and rate limiting. | 266 |
| Provides a flexible and multi-layered caching solution for Go applications using the Cache-Aside pattern. | 141 |
| A fast key-value store with expiration times and thread safety. | 97 |
| A high-performance cache implementation using two queues to efficiently handle cache lookups and updates. | 42 |
| Provides utilities and APIs for working with Go Protocol Buffers descriptors and gRPC reflection. | 1,363 |
| Manages and pipes queued streams sequentially to preserve content order. | 63 |
| A concurrent counter buffer implementation with periodic flushing of buffered counts. | 2 |
| A C# implementation of a high-performance priority queue optimized for pathfinding applications. | 1,178 |
| Fast and efficient sorting library for Go with concurrent and parallel capabilities | 133 |
| A library for populating structs with data from various formats. | 35 |