Struct timely_sort::LSBRadixSorter

pub struct LSBRadixSorter<T> {
    // some fields omitted
}

Methods

impl<T> RadixSorter<T>

fn new() -> RadixSorter<T>

fn extend<U: Unsigned, F: Fn(&T) -> U, I: Iterator<Item=T>>(&mut self, iterator: I, function: &F)

fn push<U: Unsigned, F: Fn(&T) -> U>(&mut self, element: T, function: &F)

fn push_batch<U: Unsigned, F: Fn(&T) -> U>(&mut self, batch: Vec<T>, function: &F)

fn sort<U: Unsigned, F: Fn(&T) -> U>(&mut self, batches: &mut Vec<Vec<T>>, function: &F)

fn finish<U: Unsigned, F: Fn(&T) -> U>(&mut self, function: &F) -> Vec<Vec<T>>

fn recycle(&mut self, buffers: Vec<Vec<T>>)