minitask 0.1.2

MiniTask a simple wrapper for async tasks
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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121

use alloc::vec::Vec;
use core::{
  pin::Pin,
  task::{Context, Poll},
};

use fastrand::Rng;
use futures_core::Stream;
use pin_project_lite::pin_project;

pin_project! {
  pub struct FuturesMap<K, V> {
    rng: Rng,
    entries: Vec<(K, V)>,
  }
}

impl<K, V> FuturesMap<K, V> {
  pub fn new(rng: Rng) -> Self {
    FuturesMap {
      rng,
      entries: Vec::new(),
    }
  }

  pub fn with_capacity(rng: Rng, capacity: usize) -> Self {
    FuturesMap {
      rng,
      entries: Vec::with_capacity(capacity),
    }
  }

  pub fn is_empty(&self) -> bool {
    self.entries.is_empty()
  }

  pub fn contains<Q>(&mut self, key: &Q) -> bool
  where
    Q: PartialEq<K>,
  {
    self.entries.iter().any(|(k, _)| key == k)
  }

  pub fn insert(&mut self, key: K, value: V)
  where
    K: PartialEq,
  {
    assert!(!self.contains(&key));

    self.entries.push((key, value))
  }
}

#[cfg(feature = "std")]
#[cfg_attr(docsrs, doc(cfg(feature = "std")))]
impl<K, V> Default for FuturesMap<K, V> {
  fn default() -> Self {
    Self::new(Rng::new())
  }
}

impl<K, V> Stream for FuturesMap<K, V>
where
  V: Future + Unpin,
{
  type Item = (K, V::Output);

  fn poll_next(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Option<Self::Item>> {
    let this = self.project();

    if this.entries.is_empty() {
      return Poll::Ready(None);
    }

    let start = this.rng.usize(..this.entries.len());
    let mut idx = start;

    for _ in 0..this.entries.len() {
      let (_, stream) = &mut this.entries[idx];

      match Pin::new(stream).poll(cx) {
        Poll::Ready(val) => {
          let (key, _) = this.entries.swap_remove(idx);
          return Poll::Ready(Some((key, val)));
        }
        Poll::Pending => {
          idx = idx.wrapping_add(1) % this.entries.len();
        }
      }
    }

    if this.entries.is_empty() {
      Poll::Ready(None)
    } else {
      Poll::Pending
    }
  }
}

#[cfg(all(test, feature = "alloc"))]
mod tests {

  use alloc::collections::BTreeMap;

  use smol::{future, stream::StreamExt};

  use super::*;

  #[test]
  fn basic_futures_map() {
    let mut futures = FuturesMap::new(Rng::with_seed(1337));

    futures.insert(1, future::ready(123));
    futures.insert(3, future::ready(321));

    assert_eq!(
      smol::block_on(futures.collect::<BTreeMap<_, _>>()),
      BTreeMap::from([(1, 123), (3, 321)])
    );
  }
}