extsort

Exposes external sorting (i.e. on disk sorting) capability on arbitrarily sized iterator, even if the generated content of the iterator doesn't fit in memory. Once sorted, it returns a new sorted iterator. In order to remain efficient for all implementations, the crate doesn't handle serialization, but leaves that to the user.

Example

```rust extern crate extsort; extern crate byteorder;

use extsort::*; use byteorder::{ReadBytesExt, WriteBytesExt}; use std::io::{Read, Write};

[derive(Debug, Eq, PartialEq, Ord, PartialOrd)]

struct MyStruct(u32);

impl Sortable for MyStruct { fn encode(item: &MyStruct, write: &mut Write) { write.write_u32::(item.0).unwrap(); }

fn decode(read: &mut Read) -> Option<MyStruct> {
    read.read_u32::<byteorder::LittleEndian>()
        .ok()
        .map(MyStruct)
}

}

let sorter = ExternalSorter::new(); let reverseddata = (0..1000).rev().map(MyStruct).intoiter(); let sortediter = sorter.sort(reverseddata).unwrap(); let sorteddata: Vec = sortediter.collect();

let expecteddata = (0..1000).map(MyStruct).collect::>(); asserteq!(sorteddata, expecteddata); ```