mirror of
https://github.com/wez/wezterm.git
synced 2024-12-26 23:04:49 +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.
17 lines
222 B
TOML
17 lines
222 B
TOML
[package]
|
|
name = "rangeset"
|
|
version = "0.1.0"
|
|
authors = ["Wez Furlong <wez@wezfurlong.org>"]
|
|
edition = "2018"
|
|
|
|
[dependencies]
|
|
num = "0.3"
|
|
|
|
[dev-dependencies]
|
|
criterion = "0.3"
|
|
|
|
[[bench]]
|
|
name = "rangeset"
|
|
harness = false
|
|
|