Struct extsort_lily::ExtSorter

pub struct ExtSorter<T> { /* fields omitted */ }

Sort the data

Implementations

impl<T> ExtSorter<T> where
    T: Sortable<BufWriter<File>, BufReader<File>>,
    T::Error: From<Error>, 

pub fn new(buffer_n_items: usize) -> Result<Self>

Create an ExtSorter to sort your data.

It will buffer buffer_n_items items in memory and sort them, and then write them serialized into temporary files.

pub fn new_in<P: AsRef<Path>>(buffer_n_items: usize, tmp_dir: P) -> Result<Self>

Same as new but provide a directory to store temporary files instead of system default.

pub fn sort<I>(
    &self,
    unsorted: I
) -> Result<ExtSortedIterator<T, BufReader<File>, BufWriter<File>>, T::Error> where
    I: Iterator<Item = T>, 

Sort the data.

It returns an iterator to produce sorted results. The sort is unstable.