Module `Univ.LMap`

Polymorphic maps from universe levels to 'a

include CMap.ExtS with type key = Level.t and module Set := LSet

The underlying Map library

include CSig.MapS

val empty : 'a t
val is_empty : 'a t -> bool
val mem : key -> 'a t -> bool
val add : key -> 'a -> 'a t -> 'a t
val singleton : key -> 'a -> 'a t
val remove : key -> 'a t -> 'a t
val merge : (key -> 'a option -> 'b option -> 'c option) -> 'a t -> 'b t -> 'c t
val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val cardinal : 'a t -> int
val bindings : 'a t -> (key * 'a) list
val min_binding : 'a t -> key * 'a
val max_binding : 'a t -> key * 'a
val choose : 'a t -> key * 'a
val split : key -> 'a t -> 'a t * 'a option * 'a t
val find : key -> 'a t -> 'a
val find_opt : key -> 'a t -> 'a option
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

module Set : CSig.SetS with type elt = key: Sets used by the domain function

val get : key -> 'a t -> 'a: Same as find but fails an assertion instead of raising Not_found

val set : key -> 'a -> 'a t -> 'a t

Same as add, but expects the key to be present, and thus faster.

val modify : key -> (key -> 'a -> 'a) -> 'a t -> 'a t

Apply the given function to the binding of the given key.

val bind : (key -> 'a) -> Set.t -> 'a t: bind f s transform the set x1; ...; xn into x1 := f x1; ...; xn := f xn.

val fold_left : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b: Alias for fold, to easily track where we depend on fold order.

val fold_right : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b: Folding keys in decreasing order.

val filter_range : (key -> int) -> 'a t -> 'a t: find_range in_range m Given a comparison function in_range x, that tests if x is below, above, or inside a given range filter_range returns the submap of m whose keys are in range. Note that in_range has to define a continouous range.

val update : key -> ('a option -> 'a option) -> 'a t -> 'a t: update x f m returns a map containing the same bindings as m, except for the binding of x. Depending on the value of y where y is f (find_opt x m), the binding of x is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then x is associated to z in the resulting map. If x was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

module Smart : sig ... end

module Unsafe : sig ... end

module Monad : functor (M : CMap.MonadS) -> sig ... end: Fold operators parameterized by any monad.

val lunion : 'a t -> 'a t -> 'a t: lunion x y favors the bindings in the first map.

val diff : 'a t -> 'a t -> 'a t: diff x y removes bindings from x that appear in y (whatever the value).

val subst_union : 'a option t -> 'a option t -> 'a option t: subst_union x y favors the bindings of the first map that are Some, otherwise takes y's bindings.