It would be nice to have time complexities in the documentation every IntervalMapfunctions, as they differ from the complexities of Data.Map. For instance IntervalMap.insert is $O(n)$ contrarily to Map.insert which is $O(\log n)$.
I'm willing to do this work.
It would be nice to have time complexities in the documentation every$O(n)$ contrarily to $O(\log n)$ .
IntervalMapfunctions, as they differ from the complexities ofData.Map. For instanceIntervalMap.insertisMap.insertwhich isI'm willing to do this work.