ANNOUNCE: IntervalMap-0.2.0 An implementation of maps from intervals to values. The key intervals may overlap, and the implementation supports an efficient stabbing query. It offers most of the functions in Data.Map, but Interval k instead of just k as the key type. In addition, there are functions specific to maps of intervals, for example to search for all keys containing a given point or contained in a given interval. The implementation is a red-black tree augmented with the maximum upper bound of all keys. Home page: http://www.chr-breitkopf.de/comp/IntervalMap/ Hackage: http://hackage.haskell.org/package/IntervalMap-0.2.0 This is the first release, and I'm sure that there are many holes to fix. Please don't hesitate to report even minor quibbles. Regards, Chris