Martin von Zweigbergk 934564bf8d diff: also sort base ranges by end point ... I wanted to replace the BTreeMap by a Vec and noticed that we actually sometimes end up having a `0..n` range followed by a `0..0` after refinement. We currently compare those two as equal because I had not thought that we could end up attempting to add two ranges with the same start point. When trying to insert the second range (`0..0`), the BTreeMap will keep the existing key (`0..n`) and replace the value. That's probably works, but it's clearly not what I intended. Let's fix by sorting by the end point if the start point is equal. This actually improves some benchmarks by a few percent (maybe because the subsequent compaction can then remove the `0..0` range).		2022-03-10 00:33:17 -08:00
..
protos	working_copy: stop keeping track of commit ID	2022-02-12 17:22:37 -08:00
src	diff: also sort base ranges by end point	2022-03-10 00:33:17 -08:00
tests	build: use assert_matches crate	2022-02-20 22:21:14 -08:00
build.rs	build: conditionally use map_first_last feature if available	2022-02-20 22:21:14 -08:00
Cargo.toml	build: conditionally use map_first_last feature if available	2022-02-20 22:21:14 -08:00