Id.Map
Finite maps of identifiers.
include Util.Map.UExtS with type key := key and type 'a t := 'a t and module Set := Set
The underlying Map library
Apply the given function to the binding of the given key.
bind f s
transform the set x1; ...; xn
into x1 := f x1; ...;
xn := f xn
.
val height : 'a t -> int
An indication of the logarithmic size of a map
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.
Like map
but keeping only bindings mapped to Some
symmetric_diff f ml mr acc
will efficiently fold over the difference between ml
and mr
, assumed that they share most of their internal structure. A call to f k vl vr
means that if vl
is Some
, then k
exists in ml
. Similarly, if vr
is Some
, then k
exists in mr
. If both vl
and vr
are Some
, then vl != vr
.
module Smart : sig ... end
module Monad (M : Util.Map.MonadS) : sig ... end
Alias for fold
, to easily track where we depend on fold order.