dataflow::pipeline

Struct MapReduce

Source 
pub struct MapReduce<I, K, V, O, Map: Fn(I) -> Vec<(K, V)>, Reduce: Fn((K, Vec<V>)) -> Vec<O>> { /* private fields */ }
Expand description

Implements the MapReduce operation as seen here: https://research.google/pubs/pub62/

Implementations§

Source§

impl<I, K: Ord, V, O, Map: Fn(I) -> Vec<(K, V)>, Reduce: Fn((K, Vec<V>)) -> Vec<O>> MapReduce<I, K, V, O, Map, Reduce>

Source

pub fn new(map: Map, reduce: Reduce) -> Self

Trait Implementations§

Source§

impl<I, K, V, O, Map: Fn(I) -> Vec<(K, V)> + Clone, Reduce: Fn((K, Vec<V>)) -> Vec<O> + Clone> Clone for MapReduce<I, K, V, O, Map, Reduce>

Source§

fn clone(&self) -> Self

Returns a copy of the value. Read more
1.0.0 · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl<I, K: Ord, V, O, Map: Fn(I) -> Vec<(K, V)>, Reduce: Fn((K, Vec<V>)) -> Vec<O>> Node<Vec<I>> for MapReduce<I, K, V, O, Map, Reduce>

Source§

type Output = Vec<O>

Source§

fn process(&mut self, input: Vec<I>) -> Self::Output

Process a batch of data
Source§

fn reset(&mut self)

Reset signal propogates through pipeline
Source§

fn data_remaining(&self, before: usize) -> usize

Get number of examples left

Auto Trait Implementations§

§

impl<I, K, V, O, Map, Reduce> Freeze for MapReduce<I, K, V, O, Map, Reduce>
where Map: Freeze, Reduce: Freeze,

§

impl<I, K, V, O, Map, Reduce> RefUnwindSafe for MapReduce<I, K, V, O, Map, Reduce>
where Map: RefUnwindSafe, Reduce: RefUnwindSafe, I: RefUnwindSafe, K: RefUnwindSafe, V: RefUnwindSafe, O: RefUnwindSafe,

§

impl<I, K, V, O, Map, Reduce> Send for MapReduce<I, K, V, O, Map, Reduce>
where Map: Send, Reduce: Send, I: Send, K: Send, V: Send, O: Send,

§

impl<I, K, V, O, Map, Reduce> Sync for MapReduce<I, K, V, O, Map, Reduce>
where Map: Sync, Reduce: Sync, I: Sync, K: Sync, V: Sync, O: Sync,

§

impl<I, K, V, O, Map, Reduce> Unpin for MapReduce<I, K, V, O, Map, Reduce>
where Map: Unpin, Reduce: Unpin, I: Unpin, K: Unpin, V: Unpin, O: Unpin,

§

impl<I, K, V, O, Map, Reduce> UnwindSafe for MapReduce<I, K, V, O, Map, Reduce>
where Map: UnwindSafe, Reduce: UnwindSafe, I: UnwindSafe, K: UnwindSafe, V: UnwindSafe, O: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<Input, Output, E> ExtendNode<Input, Output, E> for E
where E: Node<Input, Output = Output>,

Source§

fn chain<O, N>(self, node: N) -> (E, N)
where N: Node<Output, Output = O>,

Source§

impl<Input, Output, E> ExtendNodeMap<Input, Output, E> for E
where E: Node<Input, Output = Vec<Output>>,

Source§

fn map<O, N>(self, node: N) -> (E, Map<Output, N>)
where N: Node<Output, Output = O>,

Source§

fn filter_map<O, N>(self, node: N) -> (E, FilterMap<Output, N>)
where N: Node<Output, Output = Option<O>>,

Source§

fn filter<F>(self, function: F) -> (E, Filter<Output, F>)
where F: FnMut(&Output) -> bool,

Source§

impl<Input, Output, E> ExtendNodeSplit<Input, Output, E> for E
where Output: Clone, E: Node<Input, Output = Output>,

Source§

fn split<O1, O2, E1, E2>( self, node1: E1, node2: E2, ) -> (E, Duplicator<Output>, Pair<Output, Output, E1, E2>)
where E1: Node<Output, Output = O1>, E2: Node<Output, Output = O2>,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V