Struct alumina::data::BoxedSet

pub struct BoxedSet { /* fields omitted */ }

Its just a box, but the newtype avoids deref not Sized nonsense

Trait Implementations

impl DataSet for BoxedSet

Important traits for Vec<u8>

impl Write for Vec<u8>

fn get(&mut self, i: usize) -> Vec<ArrayD<f32>>

Returns the ith element of the Dataset

fn length(&self) -> usize

Returns the number of elements in the Dataset

fn width(&self) -> usize

Returns the number of components

Important traits for Vec<u8>

impl Write for Vec<u8>

fn components(&self) -> Vec<String>

Returns the names of components

Important traits for Box<R>

impl<R> Read for Box<R> where
    R: Read + ?Sized, impl<W> Write for Box<W> where
    W: Write + ?Sized, impl<I> Iterator for Box<I> where
    I: Iterator + ?Sized,  type Item = <I as Iterator>::Item;

fn iter<'a>(&'a mut self) -> Box<Iterator<Item = Vec<ArrayD<f32>>> + 'a>

fn boxed(self) -> BoxedSet where     Self: 'static + Sized + Send,

fn reorder_components(self, order: &[usize]) -> ReorderComponents<Self> where     Self: Sized,

fn reorder_elements(self, order: &[usize]) -> ReorderElements<Self> where     Self: Sized,

fn concat_components<S: DataSet>(self, set: S) -> ConcatComponents<Self, S> where     Self: Sized,

fn concat_elements<S: DataSet>(self, set: S) -> ConcatElements<Self, S> where     Self: Sized,

fn map_all<F: FnMut(usize, Vec<ArrayD<f32>>) -> Vec<ArrayD<f32>>>(     self,     func: F,     names: Option<Vec<String>> ) -> MapAll<Self, F> where     Self: Sized,

fn map_one<F: FnMut(usize, ArrayD<f32>) -> ArrayD<f32>>(     self,     func: F,     component: usize ) -> MapOne<Self, F> where     Self: Sized,

fn crop(     self,     component: usize,     shape: &[usize],     cropping: Cropping ) -> Crop<Self> where     Self: Sized,

fn sequential(self) -> Sequential<Self> where     Self: Sized,

fn random(self) -> Random<Self> where     Self: Sized,

fn shuffle_random(self) -> ShuffleRandom<Self> where     Self: Sized,