generic finger-tree structure (http://staff.city.ac.uk/~ross/papers/FingerTree.html)
#17Help: Non-overlapping sub-intervals
I'm trying to find a way to search IntervalMaps for sub-intervals that don't overlap, resulting in the largest intervals. For example, If I have the following intervals:
(0, 10)
(2, 4)
(5, 10)
(7, 10)And I search the interval (2, 10), I want the result to be [(2, 4), (5, 10)], leaving out the sub-interval (7,10) of (5, 10).
I have managed to get this working using a combination of FingerTree's split, viewl, and viewr. However, since the constructor is not exported, I cannot use it outside of this repository. Finally, my question is: does this belong here in this repository, or would it be better to provide split, viewl, viewr, et all for IntervalMap?