Struct dataflow::pipeline::Sort

pub struct Sort<T, F: Fn(&T, &T) -> Ordering> { /* private fields */ }

Implementations

impl<T, F: Fn(&T, &T) -> Ordering> Sort<T, F>

pub fn new(sort_fn: F) -> Self

Trait Implementations

impl<T, F: Fn(&T, &T) -> Ordering> ExplicitNode<Vec<T, Global>, Vec<T, Global>> for Sort<T, F>

fn process(&mut self, input: Vec<T>) -> Vec<T>

Process a batch of data

fn reset(&mut self)

Reset signal propogates through pipeline

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

Get number of examples left, defaults to same as previous remaining data

impl<T, F: Fn(&T, &T) -> Ordering> Node for Sort<T, F>

type Input = Vec<T, Global>

type Output = Vec<T, Global>

fn process(&mut self, input: Self::Input) -> Self::Output

Process a batch of data

fn reset(&mut self)

Reset signal propogates through pipeline

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

Get number of examples left

fn node<O, N: ExplicitNode<Self::Output, O>, T: Into<NodeContainer<Self::Output, O, N>>>(
    self,
    node: T
) -> Connector<Self, NodeContainer<Self::Output, O, N>>where
    Self: Sized,

fn pair<O1, O2, N3: Node<Input = O1>, N4: Node<Input = O2>>(
    self,
    node1: N3,
    node2: N4
) -> Connector<Self, Pair<N3, N4>>where
    Self: Sized + Node<Output = (O1, O2)>,