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

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

@@ -1,241 +0,0 @@
-use super::plumbing::*;
-use super::*;
-use std::iter;
-use std::usize;
-
-/// Iterator adaptor for [the `repeat()` function](fn.repeat.html).
-#[derive(Debug, Clone)]
-pub struct Repeat<T: Clone + Send> {
-    element: T,
-}
-
-/// Creates a parallel iterator that endlessly repeats `elt` (by
-/// cloning it). Note that this iterator has "infinite" length, so
-/// typically you would want to use `zip` or `take` or some other
-/// means to shorten it, or consider using
-/// [the `repeatn()` function](fn.repeatn.html) instead.
-///
-/// # Examples
-///
-/// ```
-/// use rayon::prelude::*;
-/// use rayon::iter::repeat;
-/// let x: Vec<(i32, i32)> = repeat(22).zip(0..3).collect();
-/// assert_eq!(x, vec![(22, 0), (22, 1), (22, 2)]);
-/// ```
-pub fn repeat<T: Clone + Send>(elt: T) -> Repeat<T> {
-    Repeat { element: elt }
-}
-
-impl<T> Repeat<T>
-where
-    T: Clone + Send,
-{
-    /// Takes only `n` repeats of the element, similar to the general
-    /// [`take()`](trait.IndexedParallelIterator.html#method.take).
-    ///
-    /// The resulting `RepeatN` is an `IndexedParallelIterator`, allowing
-    /// more functionality than `Repeat` alone.
-    pub fn take(self, n: usize) -> RepeatN<T> {
-        repeatn(self.element, n)
-    }
-
-    /// Iterates tuples, repeating the element with items from another
-    /// iterator, similar to the general
-    /// [`zip()`](trait.IndexedParallelIterator.html#method.zip).
-    pub fn zip<Z>(self, zip_op: Z) -> Zip<RepeatN<T>, Z::Iter>
-    where
-        Z: IntoParallelIterator,
-        Z::Iter: IndexedParallelIterator,
-    {
-        let z = zip_op.into_par_iter();
-        let n = z.len();
-        self.take(n).zip(z)
-    }
-}
-
-impl<T> ParallelIterator for Repeat<T>
-where
-    T: Clone + Send,
-{
-    type Item = T;
-
-    fn drive_unindexed<C>(self, consumer: C) -> C::Result
-    where
-        C: UnindexedConsumer<Self::Item>,
-    {
-        let producer = RepeatProducer {
-            element: self.element,
-        };
-        bridge_unindexed(producer, consumer)
-    }
-}
-
-/// Unindexed producer for `Repeat`.
-struct RepeatProducer<T: Clone + Send> {
-    element: T,
-}
-
-impl<T: Clone + Send> UnindexedProducer for RepeatProducer<T> {
-    type Item = T;
-
-    fn split(self) -> (Self, Option<Self>) {
-        (
-            RepeatProducer {
-                element: self.element.clone(),
-            },
-            Some(RepeatProducer {
-                element: self.element,
-            }),
-        )
-    }
-
-    fn fold_with<F>(self, folder: F) -> F
-    where
-        F: Folder<T>,
-    {
-        folder.consume_iter(iter::repeat(self.element))
-    }
-}
-
-/// Iterator adaptor for [the `repeatn()` function](fn.repeatn.html).
-#[derive(Debug, Clone)]
-pub struct RepeatN<T: Clone + Send> {
-    element: T,
-    count: usize,
-}
-
-/// Creates a parallel iterator that produces `n` repeats of `elt`
-/// (by cloning it).
-///
-/// # Examples
-///
-/// ```
-/// use rayon::prelude::*;
-/// use rayon::iter::repeatn;
-/// let x: Vec<(i32, i32)> = repeatn(22, 3).zip(0..3).collect();
-/// assert_eq!(x, vec![(22, 0), (22, 1), (22, 2)]);
-/// ```
-pub fn repeatn<T: Clone + Send>(elt: T, n: usize) -> RepeatN<T> {
-    RepeatN {
-        element: elt,
-        count: n,
-    }
-}
-
-impl<T> ParallelIterator for RepeatN<T>
-where
-    T: Clone + Send,
-{
-    type Item = T;
-
-    fn drive_unindexed<C>(self, consumer: C) -> C::Result
-    where
-        C: UnindexedConsumer<Self::Item>,
-    {
-        bridge(self, consumer)
-    }
-
-    fn opt_len(&self) -> Option<usize> {
-        Some(self.count)
-    }
-}
-
-impl<T> IndexedParallelIterator for RepeatN<T>
-where
-    T: Clone + Send,
-{
-    fn drive<C>(self, consumer: C) -> C::Result
-    where
-        C: Consumer<Self::Item>,
-    {
-        bridge(self, consumer)
-    }
-
-    fn with_producer<CB>(self, callback: CB) -> CB::Output
-    where
-        CB: ProducerCallback<Self::Item>,
-    {
-        callback.callback(RepeatNProducer {
-            element: self.element,
-            count: self.count,
-        })
-    }
-
-    fn len(&self) -> usize {
-        self.count
-    }
-}
-
-/// Producer for `RepeatN`.
-struct RepeatNProducer<T: Clone + Send> {
-    element: T,
-    count: usize,
-}
-
-impl<T: Clone + Send> Producer for RepeatNProducer<T> {
-    type Item = T;
-    type IntoIter = Iter<T>;
-
-    fn into_iter(self) -> Self::IntoIter {
-        Iter {
-            element: self.element,
-            count: self.count,
-        }
-    }
-
-    fn split_at(self, index: usize) -> (Self, Self) {
-        (
-            RepeatNProducer {
-                element: self.element.clone(),
-                count: index,
-            },
-            RepeatNProducer {
-                element: self.element,
-                count: self.count - index,
-            },
-        )
-    }
-}
-
-/// Iterator for `RepeatN`.
-///
-/// This is conceptually like `std::iter::Take<std::iter::Repeat<T>>`, but
-/// we need `DoubleEndedIterator` and unconditional `ExactSizeIterator`.
-struct Iter<T: Clone> {
-    element: T,
-    count: usize,
-}
-
-impl<T: Clone> Iterator for Iter<T> {
-    type Item = T;
-
-    #[inline]
-    fn next(&mut self) -> Option<T> {
-        if self.count > 0 {
-            self.count -= 1;
-            Some(self.element.clone())
-        } else {
-            None
-        }
-    }
-
-    #[inline]
-    fn size_hint(&self) -> (usize, Option<usize>) {
-        (self.count, Some(self.count))
-    }
-}
-
-impl<T: Clone> DoubleEndedIterator for Iter<T> {
-    #[inline]
-    fn next_back(&mut self) -> Option<T> {
-        self.next()
-    }
-}
-
-impl<T: Clone> ExactSizeIterator for Iter<T> {
-    #[inline]
-    fn len(&self) -> usize {
-        self.count
-    }
-}

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

@@ -1,123 +0,0 @@
-use super::plumbing::*;
-use super::*;
-use std::iter;
-
-/// `Rev` is an iterator that produces elements in reverse order. This struct
-/// is created by the [`rev()`] method on [`IndexedParallelIterator`]
-///
-/// [`rev()`]: trait.IndexedParallelIterator.html#method.rev
-/// [`IndexedParallelIterator`]: trait.IndexedParallelIterator.html
-#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-#[derive(Debug, Clone)]
-pub struct Rev<I: IndexedParallelIterator> {
-    base: I,
-}
-
-impl<I> Rev<I>
-where
-    I: IndexedParallelIterator,
-{
-    /// Creates a new `Rev` iterator.
-    pub(super) fn new(base: I) -> Self {
-        Rev { base }
-    }
-}
-
-impl<I> ParallelIterator for Rev<I>
-where
-    I: IndexedParallelIterator,
-{
-    type Item = I::Item;
-
-    fn drive_unindexed<C>(self, consumer: C) -> C::Result
-    where
-        C: UnindexedConsumer<Self::Item>,
-    {
-        bridge(self, consumer)
-    }
-
-    fn opt_len(&self) -> Option<usize> {
-        Some(self.len())
-    }
-}
-
-impl<I> IndexedParallelIterator for Rev<I>
-where
-    I: IndexedParallelIterator,
-{
-    fn drive<C: Consumer<Self::Item>>(self, consumer: C) -> C::Result {
-        bridge(self, consumer)
-    }
-
-    fn len(&self) -> usize {
-        self.base.len()
-    }
-
-    fn with_producer<CB>(self, callback: CB) -> CB::Output
-    where
-        CB: ProducerCallback<Self::Item>,
-    {
-        let len = self.base.len();
-        return self.base.with_producer(Callback { callback, len });
-
-        struct Callback<CB> {
-            callback: CB,
-            len: usize,
-        }
-
-        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 producer = RevProducer {
-                    base,
-                    len: self.len,
-                };
-                self.callback.callback(producer)
-            }
-        }
-    }
-}
-
-struct RevProducer<P> {
-    base: P,
-    len: usize,
-}
-
-impl<P> Producer for RevProducer<P>
-where
-    P: Producer,
-{
-    type Item = P::Item;
-    type IntoIter = iter::Rev<P::IntoIter>;
-
-    fn into_iter(self) -> Self::IntoIter {
-        self.base.into_iter().rev()
-    }
-
-    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(self.len - index);
-        (
-            RevProducer {
-                base: right,
-                len: index,
-            },
-            RevProducer {
-                base: left,
-                len: self.len - index,
-            },
-        )
-    }
-}

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

@@ -1,94 +0,0 @@
-use super::noop::NoopConsumer;
-use super::plumbing::*;
-use super::*;
-
-/// `Skip` is an iterator that skips over the first `n` elements.
-/// This struct is created by the [`skip()`] method on [`IndexedParallelIterator`]
-///
-/// [`skip()`]: trait.IndexedParallelIterator.html#method.skip
-/// [`IndexedParallelIterator`]: trait.IndexedParallelIterator.html
-#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-#[derive(Debug, Clone)]
-pub struct Skip<I> {
-    base: I,
-    n: usize,
-}
-
-impl<I> Skip<I>
-where
-    I: IndexedParallelIterator,
-{
-    /// Creates a new `Skip` iterator.
-    pub(super) fn new(base: I, n: usize) -> Self {
-        let n = Ord::min(base.len(), n);
-        Skip { base, n }
-    }
-}
-
-impl<I> ParallelIterator for Skip<I>
-where
-    I: IndexedParallelIterator,
-{
-    type Item = I::Item;
-
-    fn drive_unindexed<C>(self, consumer: C) -> C::Result
-    where
-        C: UnindexedConsumer<Self::Item>,
-    {
-        bridge(self, consumer)
-    }
-
-    fn opt_len(&self) -> Option<usize> {
-        Some(self.len())
-    }
-}
-
-impl<I> IndexedParallelIterator for Skip<I>
-where
-    I: IndexedParallelIterator,
-{
-    fn len(&self) -> usize {
-        self.base.len() - self.n
-    }
-
-    fn drive<C: Consumer<Self::Item>>(self, consumer: C) -> C::Result {
-        bridge(self, consumer)
-    }
-
-    fn with_producer<CB>(self, callback: CB) -> CB::Output
-    where
-        CB: ProducerCallback<Self::Item>,
-    {
-        return self.base.with_producer(Callback {
-            callback,
-            n: self.n,
-        });
-
-        struct Callback<CB> {
-            callback: CB,
-            n: usize,
-        }
-
-        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>,
-            {
-                crate::in_place_scope(|scope| {
-                    let Self { callback, n } = self;
-                    let (before_skip, after_skip) = base.split_at(n);
-
-                    // Run the skipped part separately for side effects.
-                    // We'll still get any panics propagated back by the scope.
-                    scope.spawn(move |_| bridge_producer_consumer(n, before_skip, NoopConsumer));
-
-                    callback.callback(after_skip)
-                })
-            }
-        }
-    }
-}

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

@@ -1,144 +0,0 @@
-use super::plumbing::*;
-use super::*;
-use std::sync::atomic::{AtomicUsize, Ordering};
-
-/// `SkipAny` is an iterator that skips over `n` elements from anywhere in `I`.
-/// This struct is created by the [`skip_any()`] method on [`ParallelIterator`]
-///
-/// [`skip_any()`]: trait.ParallelIterator.html#method.skip_any
-/// [`ParallelIterator`]: trait.ParallelIterator.html
-#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-#[derive(Clone, Debug)]
-pub struct SkipAny<I: ParallelIterator> {
-    base: I,
-    count: usize,
-}
-
-impl<I> SkipAny<I>
-where
-    I: ParallelIterator,
-{
-    /// Creates a new `SkipAny` iterator.
-    pub(super) fn new(base: I, count: usize) -> Self {
-        SkipAny { base, count }
-    }
-}
-
-impl<I> ParallelIterator for SkipAny<I>
-where
-    I: ParallelIterator,
-{
-    type Item = I::Item;
-
-    fn drive_unindexed<C>(self, consumer: C) -> C::Result
-    where
-        C: UnindexedConsumer<Self::Item>,
-    {
-        let consumer1 = SkipAnyConsumer {
-            base: consumer,
-            count: &AtomicUsize::new(self.count),
-        };
-        self.base.drive_unindexed(consumer1)
-    }
-}
-
-/// ////////////////////////////////////////////////////////////////////////
-/// Consumer implementation
-
-struct SkipAnyConsumer<'f, C> {
-    base: C,
-    count: &'f AtomicUsize,
-}
-
-impl<'f, T, C> Consumer<T> for SkipAnyConsumer<'f, C>
-where
-    C: Consumer<T>,
-    T: Send,
-{
-    type Folder = SkipAnyFolder<'f, C::Folder>;
-    type Reducer = 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);
-        (
-            SkipAnyConsumer { base: left, ..self },
-            SkipAnyConsumer {
-                base: right,
-                ..self
-            },
-            reducer,
-        )
-    }
-
-    fn into_folder(self) -> Self::Folder {
-        SkipAnyFolder {
-            base: self.base.into_folder(),
-            count: self.count,
-        }
-    }
-
-    fn full(&self) -> bool {
-        self.base.full()
-    }
-}
-
-impl<'f, T, C> UnindexedConsumer<T> for SkipAnyConsumer<'f, C>
-where
-    C: UnindexedConsumer<T>,
-    T: Send,
-{
-    fn split_off_left(&self) -> Self {
-        SkipAnyConsumer {
-            base: self.base.split_off_left(),
-            ..*self
-        }
-    }
-
-    fn to_reducer(&self) -> Self::Reducer {
-        self.base.to_reducer()
-    }
-}
-
-struct SkipAnyFolder<'f, C> {
-    base: C,
-    count: &'f AtomicUsize,
-}
-
-fn checked_decrement(u: &AtomicUsize) -> bool {
-    u.fetch_update(Ordering::Relaxed, Ordering::Relaxed, |u| u.checked_sub(1))
-        .is_ok()
-}
-
-impl<'f, T, C> Folder<T> for SkipAnyFolder<'f, C>
-where
-    C: Folder<T>,
-{
-    type Result = C::Result;
-
-    fn consume(mut self, item: T) -> Self {
-        if !checked_decrement(self.count) {
-            self.base = self.base.consume(item);
-        }
-        self
-    }
-
-    fn consume_iter<I>(mut self, iter: I) -> Self
-    where
-        I: IntoIterator<Item = T>,
-    {
-        self.base = self.base.consume_iter(
-            iter.into_iter()
-                .skip_while(move |_| checked_decrement(self.count)),
-        );
-        self
-    }
-
-    fn complete(self) -> C::Result {
-        self.base.complete()
-    }
-
-    fn full(&self) -> bool {
-        self.base.full()
-    }
-}