code_ownership 2.0.0.pre.1 → 2.0.0.pre.3

data/ext/cargo-vendor/rayon-1.10.0/src/iter/panic_fuse.rs

@@ -1,342 +0,0 @@
-use super::plumbing::*;
-use super::*;
-use std::sync::atomic::{AtomicBool, Ordering};
-use std::thread;
-
-/// `PanicFuse` is an adaptor that wraps an iterator with a fuse in case
-/// of panics, to halt all threads as soon as possible.
-///
-/// This struct is created by the [`panic_fuse()`] method on [`ParallelIterator`]
-///
-/// [`panic_fuse()`]: trait.ParallelIterator.html#method.panic_fuse
-/// [`ParallelIterator`]: trait.ParallelIterator.html
-#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-#[derive(Debug, Clone)]
-pub struct PanicFuse<I: ParallelIterator> {
-    base: I,
-}
-
-/// Helper that sets a bool to `true` if dropped while unwinding.
-#[derive(Clone)]
-struct Fuse<'a>(&'a AtomicBool);
-
-impl<'a> Drop for Fuse<'a> {
-    #[inline]
-    fn drop(&mut self) {
-        if thread::panicking() {
-            self.0.store(true, Ordering::Relaxed);
-        }
-    }
-}
-
-impl<'a> Fuse<'a> {
-    #[inline]
-    fn panicked(&self) -> bool {
-        self.0.load(Ordering::Relaxed)
-    }
-}
-
-impl<I> PanicFuse<I>
-where
-    I: ParallelIterator,
-{
-    /// Creates a new `PanicFuse` iterator.
-    pub(super) fn new(base: I) -> PanicFuse<I> {
-        PanicFuse { base }
-    }
-}
-
-impl<I> ParallelIterator for PanicFuse<I>
-where
-    I: ParallelIterator,
-{
-    type Item = I::Item;
-
-    fn drive_unindexed<C>(self, consumer: C) -> C::Result
-    where
-        C: UnindexedConsumer<Self::Item>,
-    {
-        let panicked = AtomicBool::new(false);
-        let consumer1 = PanicFuseConsumer {
-            base: consumer,
-            fuse: Fuse(&panicked),
-        };
-        self.base.drive_unindexed(consumer1)
-    }
-
-    fn opt_len(&self) -> Option<usize> {
-        self.base.opt_len()
-    }
-}
-
-impl<I> IndexedParallelIterator for PanicFuse<I>
-where
-    I: IndexedParallelIterator,
-{
-    fn drive<C>(self, consumer: C) -> C::Result
-    where
-        C: Consumer<Self::Item>,
-    {
-        let panicked = AtomicBool::new(false);
-        let consumer1 = PanicFuseConsumer {
-            base: consumer,
-            fuse: Fuse(&panicked),
-        };
-        self.base.drive(consumer1)
-    }
-
-    fn len(&self) -> usize {
-        self.base.len()
-    }
-
-    fn with_producer<CB>(self, callback: CB) -> CB::Output
-    where
-        CB: ProducerCallback<Self::Item>,
-    {
-        return self.base.with_producer(Callback { callback });
-
-        struct Callback<CB> {
-            callback: CB,
-        }
-
-        impl<T, CB> ProducerCallback<T> for Callback<CB>
-        where
-            CB: ProducerCallback<T>,
-        {
-            type Output = CB::Output;
-
-            fn callback<P>(self, base: P) -> CB::Output
-            where
-                P: Producer<Item = T>,
-            {
-                let panicked = AtomicBool::new(false);
-                let producer = PanicFuseProducer {
-                    base,
-                    fuse: Fuse(&panicked),
-                };
-                self.callback.callback(producer)
-            }
-        }
-    }
-}
-
-/// ////////////////////////////////////////////////////////////////////////
-/// Producer implementation
-
-struct PanicFuseProducer<'a, P> {
-    base: P,
-    fuse: Fuse<'a>,
-}
-
-impl<'a, P> Producer for PanicFuseProducer<'a, P>
-where
-    P: Producer,
-{
-    type Item = P::Item;
-    type IntoIter = PanicFuseIter<'a, P::IntoIter>;
-
-    fn into_iter(self) -> Self::IntoIter {
-        PanicFuseIter {
-            base: self.base.into_iter(),
-            fuse: self.fuse,
-        }
-    }
-
-    fn min_len(&self) -> usize {
-        self.base.min_len()
-    }
-    fn max_len(&self) -> usize {
-        self.base.max_len()
-    }
-
-    fn split_at(self, index: usize) -> (Self, Self) {
-        let (left, right) = self.base.split_at(index);
-        (
-            PanicFuseProducer {
-                base: left,
-                fuse: self.fuse.clone(),
-            },
-            PanicFuseProducer {
-                base: right,
-                fuse: self.fuse,
-            },
-        )
-    }
-
-    fn fold_with<G>(self, folder: G) -> G
-    where
-        G: Folder<Self::Item>,
-    {
-        let folder1 = PanicFuseFolder {
-            base: folder,
-            fuse: self.fuse,
-        };
-        self.base.fold_with(folder1).base
-    }
-}
-
-struct PanicFuseIter<'a, I> {
-    base: I,
-    fuse: Fuse<'a>,
-}
-
-impl<'a, I> Iterator for PanicFuseIter<'a, I>
-where
-    I: Iterator,
-{
-    type Item = I::Item;
-
-    fn next(&mut self) -> Option<Self::Item> {
-        if self.fuse.panicked() {
-            None
-        } else {
-            self.base.next()
-        }
-    }
-
-    fn size_hint(&self) -> (usize, Option<usize>) {
-        self.base.size_hint()
-    }
-}
-
-impl<'a, I> DoubleEndedIterator for PanicFuseIter<'a, I>
-where
-    I: DoubleEndedIterator,
-{
-    fn next_back(&mut self) -> Option<Self::Item> {
-        if self.fuse.panicked() {
-            None
-        } else {
-            self.base.next_back()
-        }
-    }
-}
-
-impl<'a, I> ExactSizeIterator for PanicFuseIter<'a, I>
-where
-    I: ExactSizeIterator,
-{
-    fn len(&self) -> usize {
-        self.base.len()
-    }
-}
-
-/// ////////////////////////////////////////////////////////////////////////
-/// Consumer implementation
-
-struct PanicFuseConsumer<'a, C> {
-    base: C,
-    fuse: Fuse<'a>,
-}
-
-impl<'a, T, C> Consumer<T> for PanicFuseConsumer<'a, C>
-where
-    C: Consumer<T>,
-{
-    type Folder = PanicFuseFolder<'a, C::Folder>;
-    type Reducer = PanicFuseReducer<'a, C::Reducer>;
-    type Result = C::Result;
-
-    fn split_at(self, index: usize) -> (Self, Self, Self::Reducer) {
-        let (left, right, reducer) = self.base.split_at(index);
-        (
-            PanicFuseConsumer {
-                base: left,
-                fuse: self.fuse.clone(),
-            },
-            PanicFuseConsumer {
-                base: right,
-                fuse: self.fuse.clone(),
-            },
-            PanicFuseReducer {
-                base: reducer,
-                _fuse: self.fuse,
-            },
-        )
-    }
-
-    fn into_folder(self) -> Self::Folder {
-        PanicFuseFolder {
-            base: self.base.into_folder(),
-            fuse: self.fuse,
-        }
-    }
-
-    fn full(&self) -> bool {
-        self.fuse.panicked() || self.base.full()
-    }
-}
-
-impl<'a, T, C> UnindexedConsumer<T> for PanicFuseConsumer<'a, C>
-where
-    C: UnindexedConsumer<T>,
-{
-    fn split_off_left(&self) -> Self {
-        PanicFuseConsumer {
-            base: self.base.split_off_left(),
-            fuse: self.fuse.clone(),
-        }
-    }
-
-    fn to_reducer(&self) -> Self::Reducer {
-        PanicFuseReducer {
-            base: self.base.to_reducer(),
-            _fuse: self.fuse.clone(),
-        }
-    }
-}
-
-struct PanicFuseFolder<'a, C> {
-    base: C,
-    fuse: Fuse<'a>,
-}
-
-impl<'a, T, C> Folder<T> for PanicFuseFolder<'a, C>
-where
-    C: Folder<T>,
-{
-    type Result = C::Result;
-
-    fn consume(mut self, item: T) -> Self {
-        self.base = self.base.consume(item);
-        self
-    }
-
-    fn consume_iter<I>(mut self, iter: I) -> Self
-    where
-        I: IntoIterator<Item = T>,
-    {
-        fn cool<'a, T>(fuse: &'a Fuse<'_>) -> impl Fn(&T) -> bool + 'a {
-            move |_| !fuse.panicked()
-        }
-
-        self.base = {
-            let fuse = &self.fuse;
-            let iter = iter.into_iter().take_while(cool(fuse));
-            self.base.consume_iter(iter)
-        };
-        self
-    }
-
-    fn complete(self) -> C::Result {
-        self.base.complete()
-    }
-
-    fn full(&self) -> bool {
-        self.fuse.panicked() || self.base.full()
-    }
-}
-
-struct PanicFuseReducer<'a, C> {
-    base: C,
-    _fuse: Fuse<'a>,
-}
-
-impl<'a, T, C> Reducer<T> for PanicFuseReducer<'a, C>
-where
-    C: Reducer<T>,
-{
-    fn reduce(self, left: T, right: T) -> T {
-        self.base.reduce(left, right)
-    }
-}

data/ext/cargo-vendor/rayon-1.10.0/src/iter/par_bridge.rs

@@ -1,159 +0,0 @@
-#[cfg(not(feature = "web_spin_lock"))]
-use std::sync::Mutex;
-
-#[cfg(feature = "web_spin_lock")]
-use wasm_sync::Mutex;
-
-use std::sync::atomic::{AtomicBool, AtomicUsize, Ordering};
-
-use crate::iter::plumbing::{bridge_unindexed, Folder, UnindexedConsumer, UnindexedProducer};
-use crate::iter::ParallelIterator;
-use crate::{current_num_threads, current_thread_index};
-
-/// Conversion trait to convert an `Iterator` to a `ParallelIterator`.
-///
-/// This creates a "bridge" from a sequential iterator to a parallel one, by distributing its items
-/// across the Rayon thread pool. This has the advantage of being able to parallelize just about
-/// anything, but the resulting `ParallelIterator` can be less efficient than if you started with
-/// `par_iter` instead. However, it can still be useful for iterators that are difficult to
-/// parallelize by other means, like channels or file or network I/O.
-///
-/// Iterator items are pulled by `next()` one at a time, synchronized from each thread that is
-/// ready for work, so this may become a bottleneck if the serial iterator can't keep up with the
-/// parallel demand. The items are not buffered by `IterBridge`, so it's fine to use this with
-/// large or even unbounded iterators.
-///
-/// The resulting iterator is not guaranteed to keep the order of the original iterator.
-///
-/// # Examples
-///
-/// To use this trait, take an existing `Iterator` and call `par_bridge` on it. After that, you can
-/// use any of the `ParallelIterator` methods:
-///
-/// ```
-/// use rayon::iter::ParallelBridge;
-/// use rayon::prelude::ParallelIterator;
-/// use std::sync::mpsc::channel;
-///
-/// let rx = {
-///     let (tx, rx) = channel();
-///
-///     tx.send("one!");
-///     tx.send("two!");
-///     tx.send("three!");
-///
-///     rx
-/// };
-///
-/// let mut output: Vec<&'static str> = rx.into_iter().par_bridge().collect();
-/// output.sort_unstable();
-///
-/// assert_eq!(&*output, &["one!", "three!", "two!"]);
-/// ```
-pub trait ParallelBridge: Sized {
-    /// Creates a bridge from this type to a `ParallelIterator`.
-    fn par_bridge(self) -> IterBridge<Self>;
-}
-
-impl<T: Iterator + Send> ParallelBridge for T
-where
-    T::Item: Send,
-{
-    fn par_bridge(self) -> IterBridge<Self> {
-        IterBridge { iter: self }
-    }
-}
-
-/// `IterBridge` is a parallel iterator that wraps a sequential iterator.
-///
-/// This type is created when using the `par_bridge` method on `ParallelBridge`. See the
-/// [`ParallelBridge`] documentation for details.
-///
-/// [`ParallelBridge`]: trait.ParallelBridge.html
-#[derive(Debug, Clone)]
-pub struct IterBridge<Iter> {
-    iter: Iter,
-}
-
-impl<Iter: Iterator + Send> ParallelIterator for IterBridge<Iter>
-where
-    Iter::Item: Send,
-{
-    type Item = Iter::Item;
-
-    fn drive_unindexed<C>(self, consumer: C) -> C::Result
-    where
-        C: UnindexedConsumer<Self::Item>,
-    {
-        let num_threads = current_num_threads();
-        let threads_started: Vec<_> = (0..num_threads).map(|_| AtomicBool::new(false)).collect();
-
-        bridge_unindexed(
-            &IterParallelProducer {
-                split_count: AtomicUsize::new(num_threads),
-                iter: Mutex::new(self.iter.fuse()),
-                threads_started: &threads_started,
-            },
-            consumer,
-        )
-    }
-}
-
-struct IterParallelProducer<'a, Iter> {
-    split_count: AtomicUsize,
-    iter: Mutex<std::iter::Fuse<Iter>>,
-    threads_started: &'a [AtomicBool],
-}
-
-impl<Iter: Iterator + Send> UnindexedProducer for &IterParallelProducer<'_, Iter> {
-    type Item = Iter::Item;
-
-    fn split(self) -> (Self, Option<Self>) {
-        // Check if the iterator is exhausted
-        let update = self
-            .split_count
-            .fetch_update(Ordering::Relaxed, Ordering::Relaxed, |c| c.checked_sub(1));
-        (self, update.is_ok().then_some(self))
-    }
-
-    fn fold_with<F>(self, mut folder: F) -> F
-    where
-        F: Folder<Self::Item>,
-    {
-        // Guard against work-stealing-induced recursion, in case `Iter::next()`
-        // calls rayon internally, so we don't deadlock our mutex. We might also
-        // be recursing via `folder` methods, which doesn't present a mutex hazard,
-        // but it's lower overhead for us to just check this once, rather than
-        // updating additional shared state on every mutex lock/unlock.
-        // (If this isn't a rayon thread, then there's no work-stealing anyway...)
-        if let Some(i) = current_thread_index() {
-            // Note: If the number of threads in the pool ever grows dynamically, then
-            // we'll end up sharing flags and may falsely detect recursion -- that's
-            // still fine for overall correctness, just not optimal for parallelism.
-            let thread_started = &self.threads_started[i % self.threads_started.len()];
-            if thread_started.swap(true, Ordering::Relaxed) {
-                // We can't make progress with a nested mutex, so just return and let
-                // the outermost loop continue with the rest of the iterator items.
-                return folder;
-            }
-        }
-
-        loop {
-            if let Ok(mut iter) = self.iter.lock() {
-                if let Some(it) = iter.next() {
-                    drop(iter);
-                    folder = folder.consume(it);
-                    if folder.full() {
-                        return folder;
-                    }
-                } else {
-                    return folder;
-                }
-            } else {
-                // any panics from other threads will have been caught by the pool,
-                // and will be re-thrown when joined - just exit
-                return folder;
-            }
-        }
-    }
-}