Data.Map, Data.Set working together
ketil+haskell at ii.uib.no
Wed Apr 6 23:19:07 EDT 2005
I need to search intervals -- i.e. I'd like to store integer keys, and
looking up any integer should return the largest key less than my
query. (Ideally with it's associated datum, but that could of course
be stored in a separate map).
Do any of the set/map implementations support this?
If I haven't seen further, it is by standing in the footprints of giants
More information about the Libraries