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

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

@@ -1,105 +0,0 @@
-use super::*;
-
-#[test]
-fn same_range_first_consumers_return_correct_answer() {
-    let find_op = |x: &i32| x % 2 == 0;
-    let first_found = AtomicUsize::new(usize::max_value());
-    let far_right_consumer = FindConsumer::new(&find_op, MatchPosition::Leftmost, &first_found);
-
-    // We save a consumer that will be far to the right of the main consumer (and therefore not
-    // sharing an index range with that consumer) for fullness testing
-    let consumer = far_right_consumer.split_off_left();
-
-    // split until we have an indivisible range
-    let bits_in_usize = usize::min_value().count_zeros();
-
-    for _ in 0..bits_in_usize {
-        consumer.split_off_left();
-    }
-
-    let reducer = consumer.to_reducer();
-    // the left and right folders should now have the same range, having
-    // exhausted the resolution of usize
-    let left_folder = consumer.split_off_left().into_folder();
-    let right_folder = consumer.into_folder();
-
-    let left_folder = left_folder.consume(0).consume(1);
-    assert_eq!(left_folder.boundary, right_folder.boundary);
-    // expect not full even though a better match has been found because the
-    // ranges are the same
-    assert!(!right_folder.full());
-    assert!(far_right_consumer.full());
-    let right_folder = right_folder.consume(2).consume(3);
-    assert_eq!(
-        reducer.reduce(left_folder.complete(), right_folder.complete()),
-        Some(0)
-    );
-}
-
-#[test]
-fn same_range_last_consumers_return_correct_answer() {
-    let find_op = |x: &i32| x % 2 == 0;
-    let last_found = AtomicUsize::new(0);
-    let consumer = FindConsumer::new(&find_op, MatchPosition::Rightmost, &last_found);
-
-    // We save a consumer that will be far to the left of the main consumer (and therefore not
-    // sharing an index range with that consumer) for fullness testing
-    let far_left_consumer = consumer.split_off_left();
-
-    // split until we have an indivisible range
-    let bits_in_usize = usize::min_value().count_zeros();
-    for _ in 0..bits_in_usize {
-        consumer.split_off_left();
-    }
-
-    let reducer = consumer.to_reducer();
-    // due to the exact calculation in split_off_left, the very last consumer has a
-    // range of width 2, so we use the second-to-last consumer instead to get
-    // the same boundary on both folders
-    let consumer = consumer.split_off_left();
-    let left_folder = consumer.split_off_left().into_folder();
-    let right_folder = consumer.into_folder();
-    let right_folder = right_folder.consume(2).consume(3);
-    assert_eq!(left_folder.boundary, right_folder.boundary);
-    // expect not full even though a better match has been found because the
-    // ranges are the same
-    assert!(!left_folder.full());
-    assert!(far_left_consumer.full());
-    let left_folder = left_folder.consume(0).consume(1);
-    assert_eq!(
-        reducer.reduce(left_folder.complete(), right_folder.complete()),
-        Some(2)
-    );
-}
-
-// These tests requires that a folder be assigned to an iterator with more than
-// one element. We can't necessarily determine when that will happen for a given
-// input to find_first/find_last, so we test the folder directly here instead.
-#[test]
-fn find_first_folder_does_not_clobber_first_found() {
-    let best_found = AtomicUsize::new(usize::max_value());
-    let f = FindFolder {
-        find_op: &(|&_: &i32| -> bool { true }),
-        boundary: 0,
-        match_position: MatchPosition::Leftmost,
-        best_found: &best_found,
-        item: None,
-    };
-    let f = f.consume(0_i32).consume(1_i32).consume(2_i32);
-    assert!(f.full());
-    assert_eq!(f.complete(), Some(0_i32));
-}
-
-#[test]
-fn find_last_folder_yields_last_match() {
-    let best_found = AtomicUsize::new(0);
-    let f = FindFolder {
-        find_op: &(|&_: &i32| -> bool { true }),
-        boundary: 0,
-        match_position: MatchPosition::Rightmost,
-        best_found: &best_found,
-        item: None,
-    };
-    let f = f.consume(0_i32).consume(1_i32).consume(2_i32);
-    assert_eq!(f.complete(), Some(2_i32));
-}

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

@@ -1,154 +0,0 @@
-use super::plumbing::*;
-use super::*;
-
-use std::fmt::{self, Debug};
-
-/// `FlatMap` maps each element to a parallel iterator, then flattens these iterators together.
-/// This struct is created by the [`flat_map()`] method on [`ParallelIterator`]
-///
-/// [`flat_map()`]: trait.ParallelIterator.html#method.flat_map
-/// [`ParallelIterator`]: trait.ParallelIterator.html
-#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-#[derive(Clone)]
-pub struct FlatMap<I: ParallelIterator, F> {
-    base: I,
-    map_op: F,
-}
-
-impl<I: ParallelIterator + Debug, F> Debug for FlatMap<I, F> {
-    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
-        f.debug_struct("FlatMap").field("base", &self.base).finish()
-    }
-}
-
-impl<I: ParallelIterator, F> FlatMap<I, F> {
-    /// Creates a new `FlatMap` iterator.
-    pub(super) fn new(base: I, map_op: F) -> Self {
-        FlatMap { base, map_op }
-    }
-}
-
-impl<I, F, PI> ParallelIterator for FlatMap<I, F>
-where
-    I: ParallelIterator,
-    F: Fn(I::Item) -> PI + Sync + Send,
-    PI: IntoParallelIterator,
-{
-    type Item = PI::Item;
-
-    fn drive_unindexed<C>(self, consumer: C) -> C::Result
-    where
-        C: UnindexedConsumer<Self::Item>,
-    {
-        let consumer = FlatMapConsumer::new(consumer, &self.map_op);
-        self.base.drive_unindexed(consumer)
-    }
-}
-
-/// ////////////////////////////////////////////////////////////////////////
-/// Consumer implementation
-
-struct FlatMapConsumer<'f, C, F> {
-    base: C,
-    map_op: &'f F,
-}
-
-impl<'f, C, F> FlatMapConsumer<'f, C, F> {
-    fn new(base: C, map_op: &'f F) -> Self {
-        FlatMapConsumer { base, map_op }
-    }
-}
-
-impl<'f, T, U, C, F> Consumer<T> for FlatMapConsumer<'f, C, F>
-where
-    C: UnindexedConsumer<U::Item>,
-    F: Fn(T) -> U + Sync,
-    U: IntoParallelIterator,
-{
-    type Folder = FlatMapFolder<'f, C, F, C::Result>;
-    type Reducer = C::Reducer;
-    type Result = C::Result;
-
-    fn split_at(self, index: usize) -> (Self, Self, C::Reducer) {
-        let (left, right, reducer) = self.base.split_at(index);
-        (
-            FlatMapConsumer::new(left, self.map_op),
-            FlatMapConsumer::new(right, self.map_op),
-            reducer,
-        )
-    }
-
-    fn into_folder(self) -> Self::Folder {
-        FlatMapFolder {
-            base: self.base,
-            map_op: self.map_op,
-            previous: None,
-        }
-    }
-
-    fn full(&self) -> bool {
-        self.base.full()
-    }
-}
-
-impl<'f, T, U, C, F> UnindexedConsumer<T> for FlatMapConsumer<'f, C, F>
-where
-    C: UnindexedConsumer<U::Item>,
-    F: Fn(T) -> U + Sync,
-    U: IntoParallelIterator,
-{
-    fn split_off_left(&self) -> Self {
-        FlatMapConsumer::new(self.base.split_off_left(), self.map_op)
-    }
-
-    fn to_reducer(&self) -> Self::Reducer {
-        self.base.to_reducer()
-    }
-}
-
-struct FlatMapFolder<'f, C, F, R> {
-    base: C,
-    map_op: &'f F,
-    previous: Option<R>,
-}
-
-impl<'f, T, U, C, F> Folder<T> for FlatMapFolder<'f, C, F, C::Result>
-where
-    C: UnindexedConsumer<U::Item>,
-    F: Fn(T) -> U + Sync,
-    U: IntoParallelIterator,
-{
-    type Result = C::Result;
-
-    fn consume(self, item: T) -> Self {
-        let map_op = self.map_op;
-        let par_iter = map_op(item).into_par_iter();
-        let consumer = self.base.split_off_left();
-        let result = par_iter.drive_unindexed(consumer);
-
-        let previous = match self.previous {
-            None => Some(result),
-            Some(previous) => {
-                let reducer = self.base.to_reducer();
-                Some(reducer.reduce(previous, result))
-            }
-        };
-
-        FlatMapFolder {
-            base: self.base,
-            map_op,
-            previous,
-        }
-    }
-
-    fn complete(self) -> Self::Result {
-        match self.previous {
-            Some(previous) => previous,
-            None => self.base.into_folder().complete(),
-        }
-    }
-
-    fn full(&self) -> bool {
-        self.base.full()
-    }
-}

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

@@ -1,147 +0,0 @@
-use super::plumbing::*;
-use super::*;
-
-use std::fmt::{self, Debug};
-
-/// `FlatMapIter` maps each element to a serial iterator, then flattens these iterators together.
-/// This struct is created by the [`flat_map_iter()`] method on [`ParallelIterator`]
-///
-/// [`flat_map_iter()`]: trait.ParallelIterator.html#method.flat_map_iter
-/// [`ParallelIterator`]: trait.ParallelIterator.html
-#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-#[derive(Clone)]
-pub struct FlatMapIter<I: ParallelIterator, F> {
-    base: I,
-    map_op: F,
-}
-
-impl<I: ParallelIterator + Debug, F> Debug for FlatMapIter<I, F> {
-    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
-        f.debug_struct("FlatMapIter")
-            .field("base", &self.base)
-            .finish()
-    }
-}
-
-impl<I: ParallelIterator, F> FlatMapIter<I, F> {
-    /// Creates a new `FlatMapIter` iterator.
-    pub(super) fn new(base: I, map_op: F) -> Self {
-        FlatMapIter { base, map_op }
-    }
-}
-
-impl<I, F, SI> ParallelIterator for FlatMapIter<I, F>
-where
-    I: ParallelIterator,
-    F: Fn(I::Item) -> SI + Sync + Send,
-    SI: IntoIterator,
-    SI::Item: Send,
-{
-    type Item = SI::Item;
-
-    fn drive_unindexed<C>(self, consumer: C) -> C::Result
-    where
-        C: UnindexedConsumer<Self::Item>,
-    {
-        let consumer = FlatMapIterConsumer::new(consumer, &self.map_op);
-        self.base.drive_unindexed(consumer)
-    }
-}
-
-/// ////////////////////////////////////////////////////////////////////////
-/// Consumer implementation
-
-struct FlatMapIterConsumer<'f, C, F> {
-    base: C,
-    map_op: &'f F,
-}
-
-impl<'f, C, F> FlatMapIterConsumer<'f, C, F> {
-    fn new(base: C, map_op: &'f F) -> Self {
-        FlatMapIterConsumer { base, map_op }
-    }
-}
-
-impl<'f, T, U, C, F> Consumer<T> for FlatMapIterConsumer<'f, C, F>
-where
-    C: UnindexedConsumer<U::Item>,
-    F: Fn(T) -> U + Sync,
-    U: IntoIterator,
-{
-    type Folder = FlatMapIterFolder<'f, C::Folder, F>;
-    type Reducer = C::Reducer;
-    type Result = C::Result;
-
-    fn split_at(self, index: usize) -> (Self, Self, C::Reducer) {
-        let (left, right, reducer) = self.base.split_at(index);
-        (
-            FlatMapIterConsumer::new(left, self.map_op),
-            FlatMapIterConsumer::new(right, self.map_op),
-            reducer,
-        )
-    }
-
-    fn into_folder(self) -> Self::Folder {
-        FlatMapIterFolder {
-            base: self.base.into_folder(),
-            map_op: self.map_op,
-        }
-    }
-
-    fn full(&self) -> bool {
-        self.base.full()
-    }
-}
-
-impl<'f, T, U, C, F> UnindexedConsumer<T> for FlatMapIterConsumer<'f, C, F>
-where
-    C: UnindexedConsumer<U::Item>,
-    F: Fn(T) -> U + Sync,
-    U: IntoIterator,
-{
-    fn split_off_left(&self) -> Self {
-        FlatMapIterConsumer::new(self.base.split_off_left(), self.map_op)
-    }
-
-    fn to_reducer(&self) -> Self::Reducer {
-        self.base.to_reducer()
-    }
-}
-
-struct FlatMapIterFolder<'f, C, F> {
-    base: C,
-    map_op: &'f F,
-}
-
-impl<'f, T, U, C, F> Folder<T> for FlatMapIterFolder<'f, C, F>
-where
-    C: Folder<U::Item>,
-    F: Fn(T) -> U,
-    U: IntoIterator,
-{
-    type Result = C::Result;
-
-    fn consume(self, item: T) -> Self {
-        let map_op = self.map_op;
-        let base = self.base.consume_iter(map_op(item));
-        FlatMapIterFolder { base, map_op }
-    }
-
-    fn consume_iter<I>(self, iter: I) -> Self
-    where
-        I: IntoIterator<Item = T>,
-    {
-        let map_op = self.map_op;
-        let iter = iter.into_iter().flat_map(map_op);
-        let base = self.base.consume_iter(iter);
-        FlatMapIterFolder { base, map_op }
-    }
-
-    fn complete(self) -> Self::Result {
-        self.base.complete()
-    }
-
-    fn full(&self) -> bool {
-        self.base.full()
-    }
-}

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

@@ -1,140 +0,0 @@
-use super::plumbing::*;
-use super::*;
-
-/// `Flatten` turns each element to a parallel iterator, then flattens these iterators
-/// together. This struct is created by the [`flatten()`] method on [`ParallelIterator`].
-///
-/// [`flatten()`]: trait.ParallelIterator.html#method.flatten
-/// [`ParallelIterator`]: trait.ParallelIterator.html
-#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-#[derive(Debug, Clone)]
-pub struct Flatten<I: ParallelIterator> {
-    base: I,
-}
-
-impl<I> Flatten<I>
-where
-    I: ParallelIterator,
-    I::Item: IntoParallelIterator,
-{
-    /// Creates a new `Flatten` iterator.
-    pub(super) fn new(base: I) -> Self {
-        Flatten { base }
-    }
-}
-
-impl<I> ParallelIterator for Flatten<I>
-where
-    I: ParallelIterator,
-    I::Item: IntoParallelIterator,
-{
-    type Item = <I::Item as IntoParallelIterator>::Item;
-
-    fn drive_unindexed<C>(self, consumer: C) -> C::Result
-    where
-        C: UnindexedConsumer<Self::Item>,
-    {
-        let consumer = FlattenConsumer::new(consumer);
-        self.base.drive_unindexed(consumer)
-    }
-}
-
-/// ////////////////////////////////////////////////////////////////////////
-/// Consumer implementation
-
-struct FlattenConsumer<C> {
-    base: C,
-}
-
-impl<C> FlattenConsumer<C> {
-    fn new(base: C) -> Self {
-        FlattenConsumer { base }
-    }
-}
-
-impl<T, C> Consumer<T> for FlattenConsumer<C>
-where
-    C: UnindexedConsumer<T::Item>,
-    T: IntoParallelIterator,
-{
-    type Folder = FlattenFolder<C, C::Result>;
-    type Reducer = C::Reducer;
-    type Result = C::Result;
-
-    fn split_at(self, index: usize) -> (Self, Self, C::Reducer) {
-        let (left, right, reducer) = self.base.split_at(index);
-        (
-            FlattenConsumer::new(left),
-            FlattenConsumer::new(right),
-            reducer,
-        )
-    }
-
-    fn into_folder(self) -> Self::Folder {
-        FlattenFolder {
-            base: self.base,
-            previous: None,
-        }
-    }
-
-    fn full(&self) -> bool {
-        self.base.full()
-    }
-}
-
-impl<T, C> UnindexedConsumer<T> for FlattenConsumer<C>
-where
-    C: UnindexedConsumer<T::Item>,
-    T: IntoParallelIterator,
-{
-    fn split_off_left(&self) -> Self {
-        FlattenConsumer::new(self.base.split_off_left())
-    }
-
-    fn to_reducer(&self) -> Self::Reducer {
-        self.base.to_reducer()
-    }
-}
-
-struct FlattenFolder<C, R> {
-    base: C,
-    previous: Option<R>,
-}
-
-impl<T, C> Folder<T> for FlattenFolder<C, C::Result>
-where
-    C: UnindexedConsumer<T::Item>,
-    T: IntoParallelIterator,
-{
-    type Result = C::Result;
-
-    fn consume(self, item: T) -> Self {
-        let par_iter = item.into_par_iter();
-        let consumer = self.base.split_off_left();
-        let result = par_iter.drive_unindexed(consumer);
-
-        let previous = match self.previous {
-            None => Some(result),
-            Some(previous) => {
-                let reducer = self.base.to_reducer();
-                Some(reducer.reduce(previous, result))
-            }
-        };
-
-        FlattenFolder {
-            base: self.base,
-            previous,
-        }
-    }
-
-    fn complete(self) -> Self::Result {
-        match self.previous {
-            Some(previous) => previous,
-            None => self.base.into_folder().complete(),
-        }
-    }
-
-    fn full(&self) -> bool {
-        self.base.full()
-    }
-}

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

@@ -1,132 +0,0 @@
-use super::plumbing::*;
-use super::*;
-
-/// `FlattenIter` turns each element to a serial iterator, then flattens these iterators
-/// together. This struct is created by the [`flatten_iter()`] method on [`ParallelIterator`].
-///
-/// [`flatten_iter()`]: trait.ParallelIterator.html#method.flatten_iter
-/// [`ParallelIterator`]: trait.ParallelIterator.html
-#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-#[derive(Debug, Clone)]
-pub struct FlattenIter<I: ParallelIterator> {
-    base: I,
-}
-
-impl<I> FlattenIter<I>
-where
-    I: ParallelIterator,
-    I::Item: IntoIterator,
-    <I::Item as IntoIterator>::Item: Send,
-{
-    /// Creates a new `FlattenIter` iterator.
-    pub(super) fn new(base: I) -> Self {
-        FlattenIter { base }
-    }
-}
-
-impl<I> ParallelIterator for FlattenIter<I>
-where
-    I: ParallelIterator,
-    I::Item: IntoIterator,
-    <I::Item as IntoIterator>::Item: Send,
-{
-    type Item = <I::Item as IntoIterator>::Item;
-
-    fn drive_unindexed<C>(self, consumer: C) -> C::Result
-    where
-        C: UnindexedConsumer<Self::Item>,
-    {
-        let consumer = FlattenIterConsumer::new(consumer);
-        self.base.drive_unindexed(consumer)
-    }
-}
-
-/// ////////////////////////////////////////////////////////////////////////
-/// Consumer implementation
-
-struct FlattenIterConsumer<C> {
-    base: C,
-}
-
-impl<C> FlattenIterConsumer<C> {
-    fn new(base: C) -> Self {
-        FlattenIterConsumer { base }
-    }
-}
-
-impl<T, C> Consumer<T> for FlattenIterConsumer<C>
-where
-    C: UnindexedConsumer<T::Item>,
-    T: IntoIterator,
-{
-    type Folder = FlattenIterFolder<C::Folder>;
-    type Reducer = C::Reducer;
-    type Result = C::Result;
-
-    fn split_at(self, index: usize) -> (Self, Self, C::Reducer) {
-        let (left, right, reducer) = self.base.split_at(index);
-        (
-            FlattenIterConsumer::new(left),
-            FlattenIterConsumer::new(right),
-            reducer,
-        )
-    }
-
-    fn into_folder(self) -> Self::Folder {
-        FlattenIterFolder {
-            base: self.base.into_folder(),
-        }
-    }
-
-    fn full(&self) -> bool {
-        self.base.full()
-    }
-}
-
-impl<T, C> UnindexedConsumer<T> for FlattenIterConsumer<C>
-where
-    C: UnindexedConsumer<T::Item>,
-    T: IntoIterator,
-{
-    fn split_off_left(&self) -> Self {
-        FlattenIterConsumer::new(self.base.split_off_left())
-    }
-
-    fn to_reducer(&self) -> Self::Reducer {
-        self.base.to_reducer()
-    }
-}
-
-struct FlattenIterFolder<C> {
-    base: C,
-}
-
-impl<T, C> Folder<T> for FlattenIterFolder<C>
-where
-    C: Folder<T::Item>,
-    T: IntoIterator,
-{
-    type Result = C::Result;
-
-    fn consume(self, item: T) -> Self {
-        let base = self.base.consume_iter(item);
-        FlattenIterFolder { base }
-    }
-
-    fn consume_iter<I>(self, iter: I) -> Self
-    where
-        I: IntoIterator<Item = T>,
-    {
-        let iter = iter.into_iter().flatten();
-        let base = self.base.consume_iter(iter);
-        FlattenIterFolder { base }
-    }
-
-    fn complete(self) -> Self::Result {
-        self.base.complete()
-    }
-
-    fn full(&self) -> bool {
-        self.base.full()
-    }
-}