Note: You should use Data.Map.Strict instead of this module if:
An efficient implementation of ordered maps from keys to values (dictionaries).
These modules are intended to be imported qualified, to avoid name clashes with Prelude functions, e.g.
import qualified Data.Map as Map
The implementation of
Map is based on size balanced binary trees (or
trees of bounded balance) as described by:
Operation comments contain the operation time complexity in the Big-O notation (http://en.wikipedia.org/wiki/Big_O_notation).