Struct InterleaveShortest
#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
pub struct InterleaveShortest<I, J> { /* private fields */ }
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.
Trait Implementations
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>,fn len(&self) -> usizefn with_producer<CB>(self, callback: CB) -> CB::Output where CB: ProducerCallback<Self::Item>,
impl<I, J> ParallelIterator for InterleaveShortest<I, J>
where
I: IndexedParallelIterator,
J: IndexedParallelIterator<Item = I::Item>,
type Item = <I as ParallelIterator>::Item;fn drive_unindexed<C>(self, consumer: C) -> C::Result where C: Consumer<I::Item>,fn opt_len(&self) -> Option<usize>
impl<I: Clone, J: Clone> Clone for InterleaveShortest<I, J>
fn clone(&self) -> InterleaveShortest<I, J>
impl<I: Debug, J: Debug> Debug for InterleaveShortest<I, J>
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Auto Trait Implementations
impl<I, J> Freeze for InterleaveShortest<I, J>
where
Interleave<Take<I>, Take<J>>: Freeze,
impl<I, J> RefUnwindSafe for InterleaveShortest<I, J>
where
Interleave<Take<I>, Take<J>>: RefUnwindSafe,
impl<I, J> Send for InterleaveShortest<I, J>
where
Interleave<Take<I>, Take<J>>: Send,
impl<I, J> Sync for InterleaveShortest<I, J>
where
Interleave<Take<I>, Take<J>>: Sync,
impl<I, J> Unpin for InterleaveShortest<I, J>
where
Interleave<Take<I>, Take<J>>: Unpin,
impl<I, J> UnsafeUnpin for InterleaveShortest<I, J>
where
Interleave<Take<I>, Take<J>>: UnsafeUnpin,
impl<I, J> UnwindSafe for InterleaveShortest<I, J>
where
Interleave<Take<I>, Take<J>>: UnwindSafe,
Blanket Implementations
impl<T> Any for InterleaveShortest<I, J>
where
T: 'static + ?Sized,
fn type_id(&self) -> TypeId
impl<T> Borrow<T> for InterleaveShortest<I, J>
where
T: ?Sized,
fn borrow(&self) -> &T
impl<T> BorrowMut<T> for InterleaveShortest<I, J>
where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
impl<T> CloneToUninit for InterleaveShortest<I, J>
where
T: Clone,
unsafe fn clone_to_uninit(&self, dest: *mut u8)
impl<T> From<T> for InterleaveShortest<I, J>
fn from(t: T) -> TReturns the argument unchanged.
impl<T> IntoEither for InterleaveShortest<I, J>
impl<T> IntoParallelIterator for InterleaveShortest<I, J>
where
T: ParallelIterator,
type Iter = T;type Item = <T as ParallelIterator>::Item;fn into_par_iter(self) -> T
impl<T> Pointable for InterleaveShortest<I, J>
const ALIGN: usize = _;type Init = T;unsafe fn init(init: <T as Pointable>::Init) -> usizeunsafe fn deref<'a>(ptr: usize) -> &'a Tunsafe fn deref_mut<'a>(ptr: usize) -> &'a mut Tunsafe fn drop(ptr: usize)
impl<T> ToOwned for InterleaveShortest<I, J>
where
T: Clone,
type Owned = T;fn to_owned(&self) -> Tfn clone_into(&self, target: &mut T)
impl<T, U> Into<U> for InterleaveShortest<I, J>
where
U: From<T>,
fn into(self) -> UCalls
U::from(self).That is, this conversion is whatever the implementation of
[From]<T> for Uchooses to do.
impl<T, U> TryFrom<U> for InterleaveShortest<I, J>
where
U: Into<T>,
type Error = never;fn try_from(value: U) -> Result<T, never>
impl<T, U> TryInto<U> for InterleaveShortest<I, J>
where
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error;fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>