Jeff Parsons

IIRC my original reasoning for this is that if you're inserting an empty range, that has no meaning, and so I assume it is a program error and therefore suitable...

Thanks for answering this, @ripytide. I do plan to make coalescing (and therefore the `Eq` bound) opt-in eventually, but I can't promise any timelines at the moment.

Hi @jtmoon79! :wave: I'm unlikely to support non-coalescing use cases in the `rangemap` crate itself. (Never say never, though; maybe I'll come to understand the use cases for them and...

Hi Jay, thanks for getting in touch! :wave: > https://github.com/jeffparsons/rangemap/blob/master/src/map.rs#L155 Unfortunately the Rust BTreeMap API is quite limited at the moment, so I think removing all entries between the start...

> Do you see any reason why we cannot also add `RangeMap::overlapping_mut` to mutate the values? `BTreeMap` has `range_mut`, so it should be easy to implement. I can't see how...

In case you're curious, there is a PR open to add BTreeMap cursors here: https://github.com/rust-lang/rust/pull/105641

Neat trick. :) > I think this also shows that the internal coalescing can still be broken even with the current API. Well... you can use `RefCell` or an incorrect...

BTW, @jasonwhite, are you by any chance using a Nightly compiler? I'm planning to have a go at exposing some handy functions like `overlapping_mut` (behind an "unstable" feature gate) when...

Also, (sorry to spam your inbox with this stream of consciousness), I'm surprised by how many people have mentioned that they don't care about coalescing. I'm beginning to consider that...

I think I like option 4. We'll just need to make sure we catch any existing implementation details that assume everything is always coalesced after inserts. I don't _think_ there's...