Struct FilterMap
#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
pub struct FilterMap<I, P> { /* private fields */ }FilterMap creates an iterator that uses filter_op to both filter and map elements.
This struct is created by the filter_map() method on ParallelIterator.
Trait Implementations
impl<I, P, R> ParallelIterator for FilterMap<I, P>
where
I: ParallelIterator,
P: Fn(I::Item) -> Option<R> + Sync + Send,
R: Send,
type Item = R;fn drive_unindexed<C>(self, consumer: C) -> C::Result where C: UnindexedConsumer<Self::Item>,
impl<I: Clone, P: Clone> Clone for FilterMap<I, P>
fn clone(&self) -> FilterMap<I, P>
impl<I: Debug, P> Debug for FilterMap<I, P>
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Auto Trait Implementations
impl<I, P> Freeze for FilterMap<I, P>
where
I: Freeze,
P: Freeze,
impl<I, P> RefUnwindSafe for FilterMap<I, P>
where
I: RefUnwindSafe,
P: RefUnwindSafe,
impl<I, P> Send for FilterMap<I, P>
where
I: Send,
P: Send,
impl<I, P> Sync for FilterMap<I, P>
where
I: Sync,
P: Sync,
impl<I, P> Unpin for FilterMap<I, P>
where
I: Unpin,
P: Unpin,
impl<I, P> UnsafeUnpin for FilterMap<I, P>
where
I: UnsafeUnpin,
P: UnsafeUnpin,
impl<I, P> UnwindSafe for FilterMap<I, P>
where
I: UnwindSafe,
P: UnwindSafe,
Blanket Implementations
impl<T> Any for FilterMap<I, P>
where
T: 'static + ?Sized,
fn type_id(&self) -> TypeId
impl<T> Borrow<T> for FilterMap<I, P>
where
T: ?Sized,
fn borrow(&self) -> &T
impl<T> BorrowMut<T> for FilterMap<I, P>
where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
impl<T> CloneToUninit for FilterMap<I, P>
where
T: Clone,
unsafe fn clone_to_uninit(&self, dest: *mut u8)
impl<T> From<T> for FilterMap<I, P>
fn from(t: T) -> TReturns the argument unchanged.
impl<T> IntoEither for FilterMap<I, P>
impl<T> IntoParallelIterator for FilterMap<I, P>
where
T: ParallelIterator,
type Iter = T;type Item = <T as ParallelIterator>::Item;fn into_par_iter(self) -> T
impl<T> Pointable for FilterMap<I, P>
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 FilterMap<I, P>
where
T: Clone,
type Owned = T;fn to_owned(&self) -> Tfn clone_into(&self, target: &mut T)
impl<T, U> Into<U> for FilterMap<I, P>
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 FilterMap<I, P>
where
U: Into<T>,
type Error = never;fn try_from(value: U) -> Result<T, never>
impl<T, U> TryInto<U> for FilterMap<I, P>
where
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error;fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>