Function ilc::sort

pub fn sort(
    ctx: &Context, 
    input: &mut BufRead, 
    decoder: &mut Decode, 
    output: &mut Write, 
    encoder: &Encode
) -> Result<(), Error>

Memory-intensive Sort the input, discarding faulty events. This will read all events into memory, then sort them by time and write them back. Behaviour is undefined if events lack full date information.

This should be an external merge-sort, but is a placeholder until implementation