hub.darcs.net :: ross -> fingertree -> issue

isovector

Great library! But it seems to be missing quite a lot of functionality that I'd like to use in anger. For example:

toList :: IntervalMap k a -> [(Interval k, a)]

greatestView :: Ord v => IntervalMap v a -> Maybe ((Interval v, a), IntervalMap v a)

partitionIntervals :: Ord v => (v -> Bool) -> IntervalMap v a -> (IntervalMap v a, IntervalMap v a)
-- law: forall p im. uncurry (<>) (partitionalIntervals p im) = im

partitionIntervals is quite interesting; since it allows us to generalize search, intersections and dominators to also return the complement of the selected intervalmap. Thus we can also get dominatees and nonintersections.

Example hacked up implementation:

https://github.com/isovector/denomusic/blob/75c427f4dd6a539d02f38ca5aa0e8c1634414fe1/src/Data/IntervalMap.hs