Univ_map
Sourceinclude S with type 'a data = 'a and module Key := Type_id_key
include Base.Invariant.S with type t := t
to_alist t
returns all values in t
, in increasing order of key type-id name.
This binding is convenient because existing call sites often refer to Univ_map.Key.create
.
module Merge
(Key : Key)
(Input1_data : Data)
(Input2_data : Data)
(Output_data : Data) :
sig ... end
module Merge1
(Key : Key)
(Input1_data : sig ... end)
(Input2_data : sig ... end)
(Output_data : sig ... end) :
sig ... end
keys with associated default values, so that find
is no longer partial
keys that map to an accumulator value with an associated fold operation