Wez Furlong 14f0162688 rangeset: fix accidentally quadratic complexity ... 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.		2022-07-24 12:48:02 -07:00
..
lib.rs	rangeset: fix accidentally quadratic complexity	2022-07-24 12:48:02 -07:00