runite 0.1.0

An event-loop-per-thread async runtime built on io_uring (Linux), kqueue (macOS), and IOCP (Windows)
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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
//! Stream trait and combinators for asynchronous sequences.
//!
//! This module defines runite's lightweight [`Stream`] abstraction and
//! [`StreamExt`] combinators. Streams yield values over time on the current
//! thread and are used by APIs such as channel receivers and line-oriented I/O.
//! Combinators are sequential and current-thread: for example,
//! [`StreamExt::for_each`] does not poll the next item until the future returned
//! for the previous item has completed.
//!
//! # Examples
//!
//! ```
//! use core::pin::Pin;
//! use core::task::{Context, Poll};
//!
//! use runite::io::{Stream, StreamExt};
//!
//! struct Counter {
//!     next: u8,
//!     end: u8,
//! }
//!
//! impl Stream for Counter {
//!     type Item = u8;
//!
//!     fn poll_next(mut self: Pin<&mut Self>, _cx: &mut Context<'_>) -> Poll<Option<Self::Item>> {
//!         if self.next == self.end {
//!             Poll::Ready(None)
//!         } else {
//!             let item = self.next;
//!             self.next += 1;
//!             Poll::Ready(Some(item))
//!         }
//!     }
//! }
//!
//! runite::spawn(async {
//!     let values = Counter { next: 0, end: 6 }
//!         .filter(|item| item % 2 == 0)
//!         .map(|item| item * 10)
//!         .collect::<Vec<_>>()
//!         .await;
//!     assert_eq!(values, [0, 20, 40]);
//! });
//! runite::run();
//! ```

use core::future::Future;
use core::pin::Pin;
use core::task::{Context, Poll};

/// Asynchronous sequence of values.
///
/// A stream is the asynchronous counterpart to [`Iterator`]. Each call to
/// [`poll_next`](Self::poll_next) attempts to produce the next item without
/// blocking. Returning [`Poll::Pending`] means the stream stored the current
/// waker and will wake it when another item, or the end of the stream, may be
/// available.
///
/// # Examples
///
/// ```
/// use core::pin::Pin;
/// use core::task::{Context, Poll};
///
/// use runite::io::{Stream, StreamExt};
///
/// struct Counter { next: u8, end: u8 }
///
/// impl Stream for Counter {
///     type Item = u8;
///
///     fn poll_next(mut self: Pin<&mut Self>, _cx: &mut Context<'_>) -> Poll<Option<Self::Item>> {
///         if self.next == self.end {
///             Poll::Ready(None)
///         } else {
///             let item = self.next;
///             self.next += 1;
///             Poll::Ready(Some(item))
///         }
///     }
///
///     fn size_hint(&self) -> (usize, Option<usize>) {
///         let remaining = (self.end - self.next) as usize;
///         (remaining, Some(remaining))
///     }
/// }
///
/// runite::spawn(async {
///     let values = Counter { next: 0, end: 3 }.collect::<Vec<_>>().await;
///     assert_eq!(values, [0, 1, 2]);
/// });
/// runite::run();
/// ```
pub trait Stream {
    /// The type of item yielded by this stream.
    type Item;

    /// Attempts to resolve the next item in the stream.
    ///
    /// Return `Poll::Ready(Some(item))` when an item is available,
    /// `Poll::Ready(None)` after the stream has ended, or [`Poll::Pending`]
    /// when the stream cannot currently make progress.
    fn poll_next(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Option<Self::Item>>;

    /// Returns bounds on the remaining length of the stream.
    ///
    /// The first element is a lower bound and the second is an optional upper
    /// bound, following [`Iterator::size_hint`].
    fn size_hint(&self) -> (usize, Option<usize>) {
        (0, None)
    }
}

/// Extension methods for [`Stream`].
///
/// This trait is implemented for all streams and provides futures and stream
/// combinators similar to those in the broader Rust async ecosystem. The
/// combinators run on the polling task and do not introduce parallelism.
///
/// # Examples
///
/// ```
/// # use core::pin::Pin;
/// # use core::task::{Context, Poll};
/// # use runite::io::{Stream, StreamExt};
/// # struct Counter { next: u8, end: u8 }
/// # impl Stream for Counter {
/// #     type Item = u8;
/// #     fn poll_next(mut self: Pin<&mut Self>, _cx: &mut Context<'_>) -> Poll<Option<Self::Item>> {
/// #         if self.next == self.end { Poll::Ready(None) } else { let item = self.next; self.next += 1; Poll::Ready(Some(item)) }
/// #     }
/// # }
/// runite::spawn(async {
///     let values = Counter { next: 0, end: 6 }
///         .skip(1)
///         .take(3)
///         .map(|item| item * 2)
///         .collect::<Vec<_>>()
///         .await;
///     assert_eq!(values, [2, 4, 6]);
/// });
/// runite::run();
/// ```
pub trait StreamExt: Stream {
    /// Returns a future that resolves to the next item from this stream.
    ///
    /// # Examples
    ///
    /// ```
    /// # use core::pin::Pin;
    /// # use core::task::{Context, Poll};
    /// # use runite::io::{Stream, StreamExt};
    /// # struct Counter { next: u8, end: u8 }
    /// # impl Stream for Counter { type Item = u8; fn poll_next(mut self: Pin<&mut Self>, _cx: &mut Context<'_>) -> Poll<Option<u8>> { if self.next == self.end { Poll::Ready(None) } else { let item = self.next; self.next += 1; Poll::Ready(Some(item)) } } }
    /// runite::spawn(async {
    ///     let mut stream = Counter { next: 4, end: 6 };
    ///     assert_eq!(stream.next().await, Some(4));
    ///     assert_eq!(stream.next().await, Some(5));
    ///     assert_eq!(stream.next().await, None);
    /// });
    /// runite::run();
    /// ```
    fn next(&mut self) -> Next<'_, Self>
    where
        Self: Unpin,
    {
        Next { stream: self }
    }

    /// Creates a stream that transforms each item with `f`.
    ///
    /// # Examples
    ///
    /// ```
    /// # use core::pin::Pin;
    /// # use core::task::{Context, Poll};
    /// # use runite::io::{Stream, StreamExt};
    /// # struct Counter { next: u8, end: u8 }
    /// # impl Stream for Counter { type Item = u8; fn poll_next(mut self: Pin<&mut Self>, _cx: &mut Context<'_>) -> Poll<Option<u8>> { if self.next == self.end { Poll::Ready(None) } else { let item = self.next; self.next += 1; Poll::Ready(Some(item)) } } }
    /// runite::spawn(async {
    ///     let values = Counter { next: 1, end: 4 }.map(|item| item * 10).collect::<Vec<_>>().await;
    ///     assert_eq!(values, [10, 20, 30]);
    /// });
    /// runite::run();
    /// ```
    fn map<F, B>(self, f: F) -> Map<Self, F>
    where
        Self: Sized,
        F: FnMut(Self::Item) -> B,
    {
        Map { stream: self, f }
    }

    /// Creates a stream that yields only items for which `predicate` returns `true`.
    ///
    /// # Examples
    ///
    /// ```
    /// # use core::pin::Pin;
    /// # use core::task::{Context, Poll};
    /// # use runite::io::{Stream, StreamExt};
    /// # struct Counter { next: u8, end: u8 }
    /// # impl Stream for Counter { type Item = u8; fn poll_next(mut self: Pin<&mut Self>, _cx: &mut Context<'_>) -> Poll<Option<u8>> { if self.next == self.end { Poll::Ready(None) } else { let item = self.next; self.next += 1; Poll::Ready(Some(item)) } } }
    /// runite::spawn(async {
    ///     let values = Counter { next: 0, end: 6 }.filter(|item| item % 2 == 0).collect::<Vec<_>>().await;
    ///     assert_eq!(values, [0, 2, 4]);
    /// });
    /// runite::run();
    /// ```
    fn filter<F>(self, predicate: F) -> Filter<Self, F>
    where
        Self: Sized,
        F: FnMut(&Self::Item) -> bool,
    {
        Filter {
            stream: self,
            predicate,
        }
    }

    /// Collects all remaining stream items into a collection.
    ///
    /// The collection type must implement [`Default`] and [`Extend`].
    ///
    /// # Examples
    ///
    /// ```
    /// # use core::pin::Pin;
    /// # use core::task::{Context, Poll};
    /// # use runite::io::{Stream, StreamExt};
    /// # struct Counter { next: u8, end: u8 }
    /// # impl Stream for Counter { type Item = u8; fn poll_next(mut self: Pin<&mut Self>, _cx: &mut Context<'_>) -> Poll<Option<u8>> { if self.next == self.end { Poll::Ready(None) } else { let item = self.next; self.next += 1; Poll::Ready(Some(item)) } } }
    /// runite::spawn(async {
    ///     let values = Counter { next: 2, end: 5 }.collect::<Vec<_>>().await;
    ///     assert_eq!(values, [2, 3, 4]);
    /// });
    /// runite::run();
    /// ```
    fn collect<C>(self) -> Collect<Self, C>
    where
        Self: Sized,
        C: Default + Extend<Self::Item>,
    {
        Collect {
            stream: self,
            collection: C::default(),
        }
    }

    /// Runs an async closure for each remaining item.
    ///
    /// Items are processed sequentially: the next stream item is not polled until
    /// the future returned for the previous item has completed.
    ///
    /// # Examples
    ///
    /// ```
    /// # use core::pin::Pin;
    /// # use core::task::{Context, Poll};
    /// # use std::{cell::RefCell, rc::Rc};
    /// # use runite::io::{Stream, StreamExt};
    /// # struct Counter { next: u8, end: u8 }
    /// # impl Stream for Counter { type Item = u8; fn poll_next(mut self: Pin<&mut Self>, _cx: &mut Context<'_>) -> Poll<Option<u8>> { if self.next == self.end { Poll::Ready(None) } else { let item = self.next; self.next += 1; Poll::Ready(Some(item)) } } }
    /// let seen = Rc::new(RefCell::new(Vec::new()));
    /// let observed = Rc::clone(&seen);
    /// runite::spawn(async move {
    ///     Counter { next: 0, end: 3 }
    ///         .for_each(|item| {
    ///             let seen = Rc::clone(&seen);
    ///             async move { seen.borrow_mut().push(item) }
    ///         })
    ///         .await;
    /// });
    /// runite::run();
    /// assert_eq!(&*observed.borrow(), &[0, 1, 2]);
    /// ```
    fn for_each<F, Fut>(self, f: F) -> ForEach<Self, F, Fut>
    where
        Self: Sized,
        F: FnMut(Self::Item) -> Fut,
        Fut: Future<Output = ()>,
    {
        ForEach {
            stream: self,
            f,
            pending: None,
        }
    }

    /// Creates a stream that yields at most `n` items.
    ///
    /// # Examples
    ///
    /// ```
    /// # use core::pin::Pin;
    /// # use core::task::{Context, Poll};
    /// # use runite::io::{Stream, StreamExt};
    /// # struct Counter { next: u8, end: u8 }
    /// # impl Stream for Counter { type Item = u8; fn poll_next(mut self: Pin<&mut Self>, _cx: &mut Context<'_>) -> Poll<Option<u8>> { if self.next == self.end { Poll::Ready(None) } else { let item = self.next; self.next += 1; Poll::Ready(Some(item)) } } }
    /// runite::spawn(async {
    ///     let values = Counter { next: 0, end: 10 }.take(2).collect::<Vec<_>>().await;
    ///     assert_eq!(values, [0, 1]);
    /// });
    /// runite::run();
    /// ```
    fn take(self, n: usize) -> Take<Self>
    where
        Self: Sized,
    {
        Take {
            stream: self,
            remaining: n,
        }
    }

    /// Creates a stream that drops the first `n` items, then yields the rest.
    ///
    /// # Examples
    ///
    /// ```
    /// # use core::pin::Pin;
    /// # use core::task::{Context, Poll};
    /// # use runite::io::{Stream, StreamExt};
    /// # struct Counter { next: u8, end: u8 }
    /// # impl Stream for Counter { type Item = u8; fn poll_next(mut self: Pin<&mut Self>, _cx: &mut Context<'_>) -> Poll<Option<u8>> { if self.next == self.end { Poll::Ready(None) } else { let item = self.next; self.next += 1; Poll::Ready(Some(item)) } } }
    /// runite::spawn(async {
    ///     let values = Counter { next: 0, end: 5 }.skip(3).collect::<Vec<_>>().await;
    ///     assert_eq!(values, [3, 4]);
    /// });
    /// runite::run();
    /// ```
    fn skip(self, n: usize) -> Skip<Self>
    where
        Self: Sized,
    {
        Skip {
            stream: self,
            remaining: n,
        }
    }
}

impl<S: Stream + ?Sized> StreamExt for S {}

impl<S: Stream + Unpin + ?Sized> Stream for &mut S {
    type Item = S::Item;

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

    fn size_hint(&self) -> (usize, Option<usize>) {
        (**self).size_hint()
    }
}

/// Future returned by [`StreamExt::next`].
#[must_use = "futures do nothing unless awaited or polled"]
pub struct Next<'a, S: ?Sized> {
    stream: &'a mut S,
}

impl<S: Stream + Unpin + ?Sized> Future for Next<'_, S> {
    type Output = Option<S::Item>;

    fn poll(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output> {
        Pin::new(&mut *self.stream).poll_next(cx)
    }
}

/// Stream returned by [`StreamExt::map`].
#[must_use = "streams do nothing unless polled"]
pub struct Map<S, F> {
    stream: S,
    f: F,
}

impl<S, F> Unpin for Map<S, F> {}

impl<S, F, B> Stream for Map<S, F>
where
    S: Stream + Unpin,
    F: FnMut(S::Item) -> B,
{
    type Item = B;

    fn poll_next(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Option<Self::Item>> {
        let this = self.get_mut();
        Pin::new(&mut this.stream)
            .poll_next(cx)
            .map(|item| item.map(&mut this.f))
    }

    fn size_hint(&self) -> (usize, Option<usize>) {
        self.stream.size_hint()
    }
}

/// Stream returned by [`StreamExt::filter`].
#[must_use = "streams do nothing unless polled"]
pub struct Filter<S, F> {
    stream: S,
    predicate: F,
}

impl<S, F> Unpin for Filter<S, F> {}

impl<S, F> Stream for Filter<S, F>
where
    S: Stream + Unpin,
    F: FnMut(&S::Item) -> bool,
{
    type Item = S::Item;

    fn poll_next(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Option<Self::Item>> {
        let this = self.get_mut();
        loop {
            match Pin::new(&mut this.stream).poll_next(cx) {
                Poll::Ready(Some(item)) if (this.predicate)(&item) => {
                    return Poll::Ready(Some(item));
                }
                Poll::Ready(Some(_)) => {}
                Poll::Ready(None) => return Poll::Ready(None),
                Poll::Pending => return Poll::Pending,
            }
        }
    }
}

/// Future returned by [`StreamExt::collect`].
#[must_use = "futures do nothing unless awaited or polled"]
pub struct Collect<S, C> {
    stream: S,
    collection: C,
}

impl<S, C> Unpin for Collect<S, C> {}

impl<S, C> Future for Collect<S, C>
where
    S: Stream + Unpin,
    C: Default + Extend<S::Item>,
{
    type Output = C;

    fn poll(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output> {
        let this = self.get_mut();
        loop {
            match Pin::new(&mut this.stream).poll_next(cx) {
                Poll::Ready(Some(item)) => this.collection.extend(core::iter::once(item)),
                Poll::Ready(None) => return Poll::Ready(core::mem::take(&mut this.collection)),
                Poll::Pending => return Poll::Pending,
            }
        }
    }
}

/// Future returned by [`StreamExt::for_each`].
#[must_use = "futures do nothing unless awaited or polled"]
pub struct ForEach<S, F, Fut> {
    stream: S,
    f: F,
    pending: Option<Pin<Box<Fut>>>,
}

impl<S, F, Fut> Unpin for ForEach<S, F, Fut> {}

impl<S, F, Fut> Future for ForEach<S, F, Fut>
where
    S: Stream + Unpin,
    F: FnMut(S::Item) -> Fut,
    Fut: Future<Output = ()>,
{
    type Output = ();

    fn poll(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output> {
        let this = self.get_mut();
        loop {
            if let Some(pending) = this.pending.as_mut() {
                match pending.as_mut().poll(cx) {
                    Poll::Ready(()) => {
                        this.pending = None;
                    }
                    Poll::Pending => return Poll::Pending,
                }
            }

            match Pin::new(&mut this.stream).poll_next(cx) {
                Poll::Ready(Some(item)) => {
                    this.pending = Some(Box::pin((this.f)(item)));
                }
                Poll::Ready(None) => return Poll::Ready(()),
                Poll::Pending => return Poll::Pending,
            }
        }
    }
}

/// Stream returned by [`StreamExt::take`].
#[must_use = "streams do nothing unless polled"]
pub struct Take<S> {
    stream: S,
    remaining: usize,
}

impl<S> Unpin for Take<S> {}

impl<S> Stream for Take<S>
where
    S: Stream + Unpin,
{
    type Item = S::Item;

    fn poll_next(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Option<Self::Item>> {
        let this = self.get_mut();
        if this.remaining == 0 {
            return Poll::Ready(None);
        }
        match Pin::new(&mut this.stream).poll_next(cx) {
            Poll::Ready(Some(item)) => {
                this.remaining -= 1;
                Poll::Ready(Some(item))
            }
            other => other,
        }
    }

    fn size_hint(&self) -> (usize, Option<usize>) {
        let (lower, upper) = self.stream.size_hint();
        (
            lower.min(self.remaining),
            upper.map_or(Some(self.remaining), |upper| {
                Some(upper.min(self.remaining))
            }),
        )
    }
}

/// Stream returned by [`StreamExt::skip`].
#[must_use = "streams do nothing unless polled"]
pub struct Skip<S> {
    stream: S,
    remaining: usize,
}

impl<S> Unpin for Skip<S> {}

impl<S> Stream for Skip<S>
where
    S: Stream + Unpin,
{
    type Item = S::Item;

    fn poll_next(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Option<Self::Item>> {
        let this = self.get_mut();
        while this.remaining > 0 {
            match Pin::new(&mut this.stream).poll_next(cx) {
                Poll::Ready(Some(_)) => this.remaining -= 1,
                Poll::Ready(None) => return Poll::Ready(None),
                Poll::Pending => return Poll::Pending,
            }
        }
        Pin::new(&mut this.stream).poll_next(cx)
    }

    fn size_hint(&self) -> (usize, Option<usize>) {
        let (lower, upper) = self.stream.size_hint();
        (
            lower.saturating_sub(self.remaining),
            upper.map(|upper| upper.saturating_sub(self.remaining)),
        )
    }
}

#[cfg(test)]
mod tests {
    use super::{Stream, StreamExt};
    use core::pin::Pin;
    use core::task::{Context, Poll};
    use std::collections::VecDeque;
    use std::sync::{Arc, Mutex};

    use crate::{queue_macrotask, run, spawn};

    struct VecDequeStream<T> {
        items: VecDeque<T>,
    }

    impl<T> Unpin for VecDequeStream<T> {}

    impl<T> Stream for VecDequeStream<T> {
        type Item = T;

        fn poll_next(self: Pin<&mut Self>, _cx: &mut Context<'_>) -> Poll<Option<Self::Item>> {
            Poll::Ready(self.get_mut().items.pop_front())
        }
    }

    #[test]
    fn stream_ext_map_and_take_compose() {
        let observed = Arc::new(Mutex::new(None::<Vec<u32>>));
        let observed_for_task = Arc::clone(&observed);

        queue_macrotask(move || {
            spawn(async move {
                let stream = VecDequeStream {
                    items: VecDeque::from(vec![1, 1, 1, 1, 1]),
                };
                let values = stream.map(|x| x * 2).take(3).collect::<Vec<_>>().await;
                *observed_for_task.lock().unwrap() = Some(values);
            });
        });

        run();
        assert_eq!(*observed.lock().unwrap(), Some(vec![2, 2, 2]));
    }
}