diff options
author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-07 09:22:09 +0000 |
---|---|---|
committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-07 09:22:09 +0000 |
commit | 43a97878ce14b72f0981164f87f2e35e14151312 (patch) | |
tree | 620249daf56c0258faa40cbdcf9cfba06de2a846 /third_party/rust/futures-0.1.31/tests/ready_queue.rs | |
parent | Initial commit. (diff) | |
download | firefox-43a97878ce14b72f0981164f87f2e35e14151312.tar.xz firefox-43a97878ce14b72f0981164f87f2e35e14151312.zip |
Adding upstream version 110.0.1.upstream/110.0.1upstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'third_party/rust/futures-0.1.31/tests/ready_queue.rs')
-rw-r--r-- | third_party/rust/futures-0.1.31/tests/ready_queue.rs | 164 |
1 files changed, 164 insertions, 0 deletions
diff --git a/third_party/rust/futures-0.1.31/tests/ready_queue.rs b/third_party/rust/futures-0.1.31/tests/ready_queue.rs new file mode 100644 index 0000000000..b0dc2375ba --- /dev/null +++ b/third_party/rust/futures-0.1.31/tests/ready_queue.rs @@ -0,0 +1,164 @@ +extern crate futures; + +use std::panic::{self, AssertUnwindSafe}; + +use futures::prelude::*; +use futures::Async::*; +use futures::future; +use futures::stream::FuturesUnordered; +use futures::sync::oneshot; + +trait AssertSendSync: Send + Sync {} +impl AssertSendSync for FuturesUnordered<()> {} + +#[test] +fn basic_usage() { + future::lazy(move || { + let mut queue = FuturesUnordered::new(); + let (tx1, rx1) = oneshot::channel(); + let (tx2, rx2) = oneshot::channel(); + let (tx3, rx3) = oneshot::channel(); + + queue.push(rx1); + queue.push(rx2); + queue.push(rx3); + + assert!(!queue.poll().unwrap().is_ready()); + + tx2.send("hello").unwrap(); + + assert_eq!(Ready(Some("hello")), queue.poll().unwrap()); + assert!(!queue.poll().unwrap().is_ready()); + + tx1.send("world").unwrap(); + tx3.send("world2").unwrap(); + + assert_eq!(Ready(Some("world")), queue.poll().unwrap()); + assert_eq!(Ready(Some("world2")), queue.poll().unwrap()); + assert_eq!(Ready(None), queue.poll().unwrap()); + + Ok::<_, ()>(()) + }).wait().unwrap(); +} + +#[test] +fn resolving_errors() { + future::lazy(move || { + let mut queue = FuturesUnordered::new(); + let (tx1, rx1) = oneshot::channel(); + let (tx2, rx2) = oneshot::channel(); + let (tx3, rx3) = oneshot::channel(); + + queue.push(rx1); + queue.push(rx2); + queue.push(rx3); + + assert!(!queue.poll().unwrap().is_ready()); + + drop(tx2); + + assert!(queue.poll().is_err()); + assert!(!queue.poll().unwrap().is_ready()); + + drop(tx1); + tx3.send("world2").unwrap(); + + assert!(queue.poll().is_err()); + assert_eq!(Ready(Some("world2")), queue.poll().unwrap()); + assert_eq!(Ready(None), queue.poll().unwrap()); + + Ok::<_, ()>(()) + }).wait().unwrap(); +} + +#[test] +fn dropping_ready_queue() { + future::lazy(move || { + let mut queue = FuturesUnordered::new(); + let (mut tx1, rx1) = oneshot::channel::<()>(); + let (mut tx2, rx2) = oneshot::channel::<()>(); + let (mut tx3, rx3) = oneshot::channel::<()>(); + + queue.push(rx1); + queue.push(rx2); + queue.push(rx3); + + assert!(!tx1.poll_cancel().unwrap().is_ready()); + assert!(!tx2.poll_cancel().unwrap().is_ready()); + assert!(!tx3.poll_cancel().unwrap().is_ready()); + + drop(queue); + + assert!(tx1.poll_cancel().unwrap().is_ready()); + assert!(tx2.poll_cancel().unwrap().is_ready()); + assert!(tx3.poll_cancel().unwrap().is_ready()); + + Ok::<_, ()>(()) + }).wait().unwrap(); +} + +#[test] +fn stress() { + const ITER: usize = 300; + + use std::sync::{Arc, Barrier}; + use std::thread; + + for i in 0..ITER { + let n = (i % 10) + 1; + + let mut queue = FuturesUnordered::new(); + + for _ in 0..5 { + let barrier = Arc::new(Barrier::new(n + 1)); + + for num in 0..n { + let barrier = barrier.clone(); + let (tx, rx) = oneshot::channel(); + + queue.push(rx); + + thread::spawn(move || { + barrier.wait(); + tx.send(num).unwrap(); + }); + } + + barrier.wait(); + + let mut sync = queue.wait(); + + let mut rx: Vec<_> = (&mut sync) + .take(n) + .map(|res| res.unwrap()) + .collect(); + + assert_eq!(rx.len(), n); + + rx.sort(); + + for num in 0..n { + assert_eq!(rx[num], num); + } + + queue = sync.into_inner(); + } + } +} + +#[test] +fn panicking_future_dropped() { + future::lazy(move || { + let mut queue = FuturesUnordered::new(); + queue.push(future::poll_fn(|| -> Poll<i32, i32> { + panic!() + })); + + let r = panic::catch_unwind(AssertUnwindSafe(|| queue.poll())); + assert!(r.is_err()); + assert!(queue.is_empty()); + assert_eq!(Ready(None), queue.poll().unwrap()); + + Ok::<_, ()>(()) + }).wait().unwrap(); +} |