forked from mirrors/jj
fc1731a180
We don't really need a BTreeMap for keeping the unchanged ranges. The only place it helps a bit is when refining a diff because we may then insert some more unchanged ranges in the list. I think there has to be very many unchanged ranges for that to matter, however. This patch therefore replace the BTreeMap by a sorted Vec. `cargo bench` says that a few tests got ~20% faster. I'm looking into this code now because I'm thinking of copying some of it for the "partial conflict resolution" tool I'm working on for Mercurial. |
||
---|---|---|
.. | ||
protos | ||
src | ||
tests | ||
build.rs | ||
Cargo.toml |