     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

    use super::plumbing::*;
    use super::*;

    /// `InterleaveShortest` is an iterator that works similarly to
    /// `Interleave`, but this version stops returning elements once one
    /// of the iterators run out.
    ///
    /// This struct is created by the [`interleave_shortest()`] method on
    /// [`IndexedParallelIterator`].
    ///
    /// [`interleave_shortest()`]: trait.IndexedParallelIterator.html#method.interleave_shortest
    /// [`IndexedParallelIterator`]: trait.IndexedParallelIterator.html
    #[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
    #[derive(Debug, Clone)]
    pub struct InterleaveShortest<I, J>
    where
        I: IndexedParallelIterator,
        J: IndexedParallelIterator<Item = I::Item>,
    {
        interleave: Interleave<Take<I>, Take<J>>,
    }

    impl<I, J> InterleaveShortest<I, J>
    where
        I: IndexedParallelIterator,
        J: IndexedParallelIterator<Item = I::Item>,
    {
        /// Create a new `InterleaveShortest` iterator
        pub(super) fn new(i: I, j: J) -> Self {
            InterleaveShortest {
                interleave: if i.len() <= j.len() {
                    // take equal lengths from both iterators
                    let n = i.len();
                    i.take(n).interleave(j.take(n))
                } else {
                    // take one extra item from the first iterator
                    let n = j.len();
                    i.take(n + 1).interleave(j.take(n))
                },
            }
        }
    }

    impl<I, J> ParallelIterator for InterleaveShortest<I, J>
    where
        I: IndexedParallelIterator,
        J: IndexedParallelIterator<Item = I::Item>,
    {
        type Item = I::Item;

        fn drive_unindexed<C>(self, consumer: C) -> C::Result
        where
            C: Consumer<I::Item>,
        {
            bridge(self, consumer)
        }

        fn opt_len(&self) -> Option<usize> {
            Some(self.len())
        }
    }

    impl<I, J> IndexedParallelIterator for InterleaveShortest<I, J>
    where
        I: IndexedParallelIterator,
        J: IndexedParallelIterator<Item = I::Item>,
    {
        fn drive<C>(self, consumer: C) -> C::Result
        where
            C: Consumer<Self::Item>,
        {
            bridge(self, consumer)
        }

        fn len(&self) -> usize {
            self.interleave.len()
        }

        fn with_producer<CB>(self, callback: CB) -> CB::Output
        where
            CB: ProducerCallback<Self::Item>,
        {
            self.interleave.with_producer(callback)
        }
    }

# Help

## Keyboard Shortcuts

`?`
  Show this help dialog
`S`
  Focus the search field
`↑`
  Move up in search results
`↓`
  Move down in search results
`↹`
  Switch tab
`⏎`
  Go to active search result
`+`
  Expand all sections
`-`
  Collapse all sections

## Search Tricks

Prefix searches with a type followed by a colon (e.g., `fn:`) to restrict the search to a given type.

Accepted types are: `fn`, `mod`, `struct`, `enum`, `trait`, `type`, `macro`, and `const`.

Search functions by type signature (e.g., `vec -> usize` or `* -> vec`)

Search multiple things at once by splitting your query with comma (e.g., `str,u8` or `String,struct:Vec,test`)