map -package:base -is:exact -is:exact -package:text -package:containers -package:dlist -package:Cabal is:module package:Agda

Partly invertible finite maps. Time complexities are given under the assumption that all relevant instance functions, as well as arguments of function type, take constant time, and "n" is the number of keys involved in the operation.
Maps containing non-overlapping intervals.