Module type Map_intf.Creators_genericSource
include Map.Creators_generic
include Base.Dictionary_immutable.Creators
with type 'key key := 'key key
and type ('key, 'data, 'cmp) t := ('key, 'data, 'cmp) t
and type ('fn, 'key, _, 'cmp) creator := ('key, 'cmp, 'fn) create_options
val empty : ('k, 'cmp, ('k, _, 'cmp) t) create_optionsval singleton : ('k, 'cmp, 'k key -> 'v -> ('k, 'v, 'cmp) t) create_optionsval map_keys_exn :
('k2,
'cmp2,
('k1, 'v, 'cmp1) t ->
f:('k1 key -> 'k2 key) ->
('k2, 'v, 'cmp2) t)
create_optionsval transpose_keys :
('k1,
'cmp1,
('k2,
'cmp2,
('k1, ('k2, 'a, 'cmp2) t, 'cmp1) t ->
('k2, ('k1, 'a, 'cmp1) t, 'cmp2) t)
create_options)
access_optionsval of_sorted_array :
('k, 'cmp, ('k key * 'v) array -> ('k, 'v, 'cmp) t Base.Or_error.t)
create_optionsval of_sorted_array_unchecked :
('k, 'cmp, ('k key * 'v) array -> ('k, 'v, 'cmp) t) create_optionsval of_increasing_iterator_unchecked :
('k, 'cmp, len:int -> f:(int -> 'k key * 'v) -> ('k, 'v, 'cmp) t)
create_optionsval of_alist :
('k,
'cmp,
('k key * 'v) list ->
[ `Ok of ('k, 'v, 'cmp) t | `Duplicate_key of 'k key ])
create_optionsval of_alist_or_error :
('k, 'cmp, ('k key * 'v) list -> ('k, 'v, 'cmp) t Base.Or_error.t)
create_optionsval of_alist_exn :
('k, 'cmp, ('k key * 'v) list -> ('k, 'v, 'cmp) t) create_optionsval of_alist_multi :
('k, 'cmp, ('k key * 'v) list -> ('k, 'v list, 'cmp) t) create_optionsval of_alist_fold :
('k,
'cmp,
('k key * 'v1) list ->
init:'v2 ->
f:('v2 -> 'v1 -> 'v2) ->
('k, 'v2, 'cmp) t)
create_optionsval of_alist_reduce :
('k, 'cmp, ('k key * 'v) list -> f:('v -> 'v -> 'v) -> ('k, 'v, 'cmp) t)
create_optionsval of_increasing_sequence :
('k, 'cmp, ('k key * 'v) Base.Sequence.t -> ('k, 'v, 'cmp) t Base.Or_error.t)
create_optionsval of_sequence :
('k,
'cmp,
('k key * 'v) Base.Sequence.t ->
[ `Ok of ('k, 'v, 'cmp) t | `Duplicate_key of 'k key ])
create_optionsval of_sequence_or_error :
('k, 'cmp, ('k key * 'v) Base.Sequence.t -> ('k, 'v, 'cmp) t Base.Or_error.t)
create_optionsval of_sequence_exn :
('k, 'cmp, ('k key * 'v) Base.Sequence.t -> ('k, 'v, 'cmp) t) create_optionsval of_sequence_multi :
('k, 'cmp, ('k key * 'v) Base.Sequence.t -> ('k, 'v list, 'cmp) t)
create_optionsval of_sequence_fold :
('k,
'cmp,
('k key * 'v1) Base.Sequence.t ->
init:'v2 ->
f:('v2 -> 'v1 -> 'v2) ->
('k, 'v2, 'cmp) t)
create_optionsval of_sequence_reduce :
('k,
'cmp,
('k key * 'v) Base.Sequence.t ->
f:('v -> 'v -> 'v) ->
('k, 'v, 'cmp) t)
create_optionsval of_list_with_key :
('k,
'cmp,
'v list ->
get_key:('v -> 'k key) ->
[ `Ok of ('k, 'v, 'cmp) t | `Duplicate_key of 'k key ])
create_optionsval of_list_with_key_or_error :
('k,
'cmp,
'v list ->
get_key:('v -> 'k key) ->
('k, 'v, 'cmp) t Base.Or_error.t)
create_optionsval of_list_with_key_exn :
('k, 'cmp, 'v list -> get_key:('v -> 'k key) -> ('k, 'v, 'cmp) t)
create_optionsval of_list_with_key_multi :
('k, 'cmp, 'v list -> get_key:('v -> 'k key) -> ('k, 'v list, 'cmp) t)
create_optionsval of_list_with_key_fold :
('k,
'cmp,
'v list ->
get_key:('v -> 'k key) ->
init:'acc ->
f:('acc -> 'v -> 'acc) ->
('k, 'acc, 'cmp) t)
create_optionsval of_list_with_key_reduce :
('k,
'cmp,
'v list ->
get_key:('v -> 'k key) ->
f:('v -> 'v -> 'v) ->
('k, 'v, 'cmp) t)
create_optionsval of_iteri :
('k,
'cmp,
iteri:(f:(key:'k key -> data:'v -> unit) -> unit) ->
[ `Ok of ('k, 'v, 'cmp) t | `Duplicate_key of 'k key ])
create_optionsval of_iteri_exn :
('k,
'cmp,
iteri:(f:(key:'k key -> data:'v -> unit) -> unit) ->
('k, 'v, 'cmp) t)
create_optionsval of_tree :
('k, 'cmp, ('k key, 'v, 'cmp) tree -> ('k, 'v, 'cmp) t) create_optionsval of_hashtbl_exn :
('k, 'cmp, ('k key, 'v) Core.Hashtbl.t -> ('k, 'v, 'cmp) t) create_optionsval of_key_set :
('k key, 'cmp cmp) Base.Set.t ->
f:('k key -> 'v) ->
('k, 'v, 'cmp) tNever requires a comparator because it can get one from the input Set.t.
val quickcheck_generator :
('k,
'cmp,
'k key Core.Quickcheck.Generator.t ->
'v Core.Quickcheck.Generator.t ->
('k, 'v, 'cmp) t Core.Quickcheck.Generator.t)
create_options