Module nolock::queues::spsc::bounded

This implements a bounded lock-free Queue

Example

use nolock::queues::spsc::bounded;

// Creates a new BoundedQueue with the Capacity for 5 Items
let (mut rx, mut tx) = bounded::queue(5);

// Enqueues the Value 13 on the Queue
tx.try_enqueue(13);
// Dequeues 13 from the Queue again
assert_eq!(Ok(13), rx.try_dequeue());

Reference:

• FastForward for Efficient Pipeline Parallelism - A Cache-Optimized Concurrent Lock-Free Queue

Structs

AsyncBoundedReceiver

An async variant of the BoundedReceiver that allows your to efficiently use this Queue in async Contexts as well.

AsyncBoundedSender

An async variant of the BoundedSender that allows your to efficiently use this Queue in async Contexts as well.

BoundedReceiver

The Receiving-Half for the Queue

BoundedSender

The Sending-Half for the queue

DequeueFuture

The Future returned when dequeue an Item

EnqueueFuture

The Future returned when enqueueing an Item

Functions

async_queue

Creates an async BoundedQueue and returns its respecitive (AsyncBoundedReceiver, AsyncBoundedSender)

queue

Creates a new Bounded-Queue with the given Capacity and returns the corresponding Handles (BoundedReceiver, BoundedSender)