mosaik 0.3.17

A Rust runtime for building self-organizing, leaderless distributed systems.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60

use {
	core::{
		future::pending,
		pin::Pin,
		task::{Context, Poll},
	},
	futures::{Stream, StreamExt, stream::FuturesUnordered},
};

/// An asynchronous work queue that manages a set of futures to be executed
/// concurrently. This is often used in worker loops to enqueue async tasks that
/// need to be processed without blocking the main event loop.
#[derive(Debug)]
pub struct AsyncWorkQueue<T: Send + 'static = ()>(
	FuturesUnordered<Pin<Box<dyn futures::Future<Output = T> + Send + 'static>>>,
);

impl<T: Send + 'static> Default for AsyncWorkQueue<T> {
	fn default() -> Self {
		Self::new()
	}
}

impl<T: Send + 'static> AsyncWorkQueue<T> {
	/// Creates a new, empty `AsyncWorkQueue`.
	pub fn new() -> Self {
		let inner = FuturesUnordered::<
			Pin<Box<dyn futures::Future<Output = T> + Send + 'static>>,
		>::new();
		inner.push(Box::pin(pending::<T>()));
		Self(inner)
	}

	/// Checks if the work queue has any pending futures.
	#[allow(dead_code)]
	pub fn is_empty(&self) -> bool {
		// Internally the work queue always has at
		// least one future (the forever pending one).
		self.0.len() == 1
	}

	/// Adds a new future to the work queue.
	pub fn enqueue<F>(&self, fut: F)
	where
		F: Future<Output = T> + Send + 'static,
	{
		self.0.push(Box::pin(fut));
	}
}

impl<T: Send + 'static> Stream for AsyncWorkQueue<T> {
	type Item = T;

	fn poll_next(
		mut self: Pin<&mut Self>,
		cx: &mut Context<'_>,
	) -> Poll<Option<Self::Item>> {
		self.0.poll_next_unpin(cx)
	}
}