pub struct FlatMapOp<D: ParallelDataset, F> {
pub base: D,
pub op: F,
}
Fields§
§base: D
§op: F
Trait Implementations§
source§impl<D, F, PI> IntoParallelIterator for FlatMapOp<D, F>
impl<D, F, PI> IntoParallelIterator for FlatMapOp<D, F>
§type Iter = FlatMap<<D as IntoParallelIterator>::Iter, F>
type Iter = FlatMap<<D as IntoParallelIterator>::Iter, F>
The parallel iterator type that will be created.
§type Item = <PI as IntoParallelIterator>::Item
type Item = <PI as IntoParallelIterator>::Item
The type of item that the parallel iterator will produce.
source§fn into_par_iter(self) -> Self::Iter
fn into_par_iter(self) -> Self::Iter
Converts
self
into a parallel iterator. Read moresource§impl<D, F, PI> ParallelDataset for FlatMapOp<D, F>
impl<D, F, PI> ParallelDataset for FlatMapOp<D, F>
fn map<F, R>(self, op: F) -> MapOp<Self, F>
fn flat_map<F, R>(self, op: F) -> FlatMapOp<Self, F>
fn filter<F>(self, op: F) -> FilterOp<Self, F>
fn fold<T, ID, F>(self, identity: ID, op: F) -> FoldOp<Self, ID, F>
fn reduce<ID, F>(self, identity: ID, op: F) -> Self::Item
fn sort_by_key<F, K>(self, op: F, ascending: bool) -> SortByKeyOp<Self, F>
fn group_by<F, K>(self, key: F) -> MapDataset<K, Vec<Self::Item>>
fn group_by_map<K, V, F1, F2>(self, key: F1, value: F2) -> MapDataset<K, Vec<V>>
fn count(self) -> usize
fn take_any(self, n: usize) -> TakeAny<Self>
fn collect<C>(self) -> Cwhere
C: FromParallelDataset<Self::Item>,
Auto Trait Implementations§
impl<D, F> Freeze for FlatMapOp<D, F>
impl<D, F> RefUnwindSafe for FlatMapOp<D, F>where
D: RefUnwindSafe,
F: RefUnwindSafe,
impl<D, F> Send for FlatMapOp<D, F>where
F: Send,
impl<D, F> Sync for FlatMapOp<D, F>
impl<D, F> Unpin for FlatMapOp<D, F>
impl<D, F> UnwindSafe for FlatMapOp<D, F>where
D: UnwindSafe,
F: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more