David Laban cf93826eee sort --check refactor to use iterator ... This allows us to check files without bringing them entirely into memory. Also makes it easier to find the disorder in (seq 9; echo 0) | sort --check (points at the end of the file, where our previous version would point at the start of the file) Itertools' .coalesce() was the most useful helper that I could find for comparing adjacent values in an iterator. It is designed for implementing things like .dedup(), so the resulting code is a little unintuitive.		2016-08-13 00:42:44 +01:00
..
Cargo.toml	sort --merge --unique	2016-08-13 00:42:44 +01:00
main.rs	Refactor and simplify build for utilities.	2015-12-07 21:56:45 -05:00
sort.rs	sort --check refactor to use iterator	2016-08-13 00:42:44 +01:00