mirror of
https://github.com/wez/wezterm.git
synced 2024-11-27 02:25:28 +03:00
14f0162688
When adding sparse ranges the cartesian product of range combinations was explored to find intersections, which is pretty awful if there are 1 million entries to be inserted. This commit employs binary search to reduce the complexity, at the expense of requiring that the internal range array is sorted. |
||
|---|---|---|
| .. | ||
| benches | ||
| src | ||
| Cargo.toml | ||