Module Heap.MapSource

Sourcetype key = t
Sourcetype 'a t = 'a map
Sourceval empty : 'a t
Sourceval add : key -> 'a -> 'a t -> 'a t
Sourceval mem : key -> 'a t -> bool
Sourceval find : key -> 'a t -> 'a
Sourceval findk : key -> 'a t -> key * 'a
Sourceval size : 'a t -> int
Sourceval is_empty : 'a t -> bool
Sourceval insert : (key -> 'a -> 'a -> 'a) -> key -> 'a -> 'a t -> 'a t
Sourceval change : (key -> 'b -> 'a option -> 'a option) -> key -> 'b -> 'a t -> 'a t
Sourceval map : ('a -> 'b) -> 'a t -> 'b t
Sourceval mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
Sourceval mapf : (key -> 'a -> 'b option) -> 'a t -> 'b t
Sourceval mapq : (key -> 'a -> 'a option) -> 'a t -> 'a t
Sourceval filter : (key -> 'a -> bool) -> 'a t -> 'a t
Sourceval partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
Sourceval iter : (key -> 'a -> unit) -> 'a t -> unit
Sourceval fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
Sourceval iter_sorted : (key -> 'a -> unit) -> 'a t -> unit
Sourceval fold_sorted : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
Sourceval union : (key -> 'a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
Sourceval inter : (key -> 'a -> 'b -> 'c) -> 'a t -> 'b t -> 'c t
Sourceval interf : (key -> 'a -> 'b -> 'c option) -> 'a t -> 'b t -> 'c t
Sourceval interq : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
Sourceval diffq : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
Sourceval subset : (key -> 'a -> 'b -> bool) -> 'a t -> 'b t -> bool
Sourceval equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
Sourceval iterk : (key -> 'a -> 'b -> unit) -> 'a t -> 'b t -> unit
Sourceval iter2 : (key -> 'a option -> 'b option -> unit) -> 'a t -> 'b t -> unit
Sourceval merge : (key -> 'a option -> 'b option -> 'c option) -> 'a t -> 'b t -> 'c t
Sourcetype domain = set
Sourceval domain : 'a t -> domain