Crates.io | mini-io-queue |
lib.rs | mini-io-queue |
version | 0.2.0 |
source | src |
created_at | 2022-08-28 11:18:20.301824 |
updated_at | 2023-02-16 11:16:49.863031 |
description | Fixed-length, allocation and lock-free, async I/O oriented single-producer single-consumer queues. |
homepage | https://github.com/cpdt/mini-io-queue |
repository | https://github.com/cpdt/mini-io-queue |
max_upload_size | |
id | 653822 |
size | 132,567 |
Fixed-length, allocation and lock-free, async I/O oriented single-producer single-consumer (SPSC) queues.
This library provides several fixed-length queues for different use-cases, based around the same core:
asyncio
is a generic async, thread-safe, lock-free queue using futures. Read
operations can pause until data is available, and write operations can pause until space is
returned. The queue can act as an efficient I/O buffer with futures::AsyncRead
and
futures::AsyncWrite
implementations.blocking
is a generic thread-safe queue. Read operations can block until data is
available, and write operations can block until space is returned. The queue can act as an
efficient I/O buffer with io::Read
and io::Write
implementations.nonblocking
is a generic thread-safe, lock-free queue that is guaranteed to not block.
It can act as an efficient I/O buffer when read and write speed is matched or no locks
are available.All queues have separate Reader
and Writer
ends which can be sent across threads. Queues are
designed with bulk operations in mind, so can safely be used with large read and write
operations, such as in a byte array I/O context.
The library also provides Ring
, a low-level atomic ring buffer building block used to
implement the various queues available.
The library supports no_std
with a reduced feature set, and is highly configurable. With the
default feature set, it does not require any dependencies.
use futures::executor::block_on;
use futures::join;
use mini_io_queue::asyncio::queue;
let (mut reader, mut writer) = queue(8);
let write_loop = async {
for i in 0..16 {
writer.write_all(&[i]).await.unwrap();
}
};
let read_loop = async {
for i in 0..16 {
let mut buf = [0];
reader.read_exact(&mut buf).await.unwrap();
assert_eq!(buf[0], i);
}
};
block_on(async { join!(write_loop, read_loop) });
use mini_io_queue::blocking::queue_from_parts;
use mini_io_queue::Ring;
use mini_io_queue::storage::{HeapBuffer, Storage};
// Create a queue with half of the underlying buffer in the read side.
let ring = Ring::new(10);
ring.advance_right(5);
let mut buffer = HeapBuffer::new(10);
buffer.slice_mut(0..5).copy_from_slice(&[1, 2, 3, 4, 5]);
let (mut reader, _) = queue_from_parts(ring, buffer);
for i in 1..=5 {
let mut buf = [0];
reader.read_exact(&mut buf).unwrap();
assert_eq!(buf[0], i);
}
Provided under the MIT license. Check the LICENSE file for details.