Struct tinysort::TinySort

pub struct TinySort { /* fields omitted */ }

A truly memory-efficient sort implementation.

See the module documentation for more details. To retrieve the values sorted in this sorter, use the IntoIter implementation. It will yield the sorted values from smallest to largest.

Methods

impl TinySort

pub fn new(extra: usize, amount: u32, maxval: u32) -> Option<TinySort>

Create a new TinySort.

extra is the allowed memory overhead in units of 4 bytes. It should at least be 1 for the algorithm to function properly. amount is the amount of values to be sorted. This needs to at least be 2. maxval is the maximum value that will be sorted. This needs to be at least 1.

pub fn used_space(&self) -> usize

The amount of memory, in bytes, used by the algorithm. This is roughly equal to (amount*log2(1+amount/maxval) + maxval*log2(1+maxval/amount)) / 8 + extra * 4.

pub fn insert(&mut self, value: u32)

Insert a value to be sorted.

This might panic if there were more values inserted than amount, or if this value is higher than the maximum value specified.

Trait Implementations

impl Clone for TinySort

fn clone(&self) -> TinySort

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for TinySort

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl IntoIterator for TinySort

type Item = u32

The type of the elements being iterated over.

type IntoIter = TinySortIterator

Which kind of iterator are we turning this into?

fn into_iter(self) -> TinySortIterator

Creates an iterator from a value.