Finite maps from integers to arbitrary values. Current implementation is a big endian Patricia tree which is an efficient binary search tree on (positive) integer keys.
- Haskell’s
containers, Data.IntMap.Strict - Chris Okasaki and Andy Gill, "Fast Mergeable Integer Maps" Workshop on ML, September 1998, pages 77-86