Using_comparator (docs.findlib-1.core.Core.Map.Using

include Map_intf.Creators_generic
  with type ('a, 'b, 'c) t := ('a, 'b, 'c) t
  with type ('a, 'b, 'c) tree := ('a, 'b, 'c) Tree.t
  with type 'k key := 'k
  with type 'c cmp := 'c
  with type ('a, 'b, 'c) create_options :=
         ('a, 'b, 'c) Base.Map.With_comparator.t
  with type ('a, 'b, 'c) access_options :=
         ('a, 'b, 'c) Base.Map.Without_comparator.t

include Base.Map.Creators_generic
  with type ('a, 'b, 'c) t := ('a, 'b, 'c) t
  with type ('a, 'b, 'c) tree := ('a, 'b, 'c) Tree.t
  with type 'k key := 'k
  with type 'c cmp := 'c
  with type ('a, 'b, 'c) create_options :=
         ('a, 'b, 'c) Base.Map.With_comparator.t
  with type ('a, 'b, 'c) access_options :=
         ('a, 'b, 'c) Base.Map.Without_comparator.t

val empty : ('k, 'cmp, ('k, _, 'cmp) t) Base.Map.With_comparator.t

val singleton : 
  ('k, 'cmp, 'k -> 'v -> ('k, 'v, 'cmp) t) Base.Map.With_comparator.t

val map_keys : 
  ('k2,
    'cmp2,
    ('k1, 'v, 'cmp1) t ->
    f:('k1 -> 'k2) ->
    [ `Ok of ('k2, 'v, 'cmp2) t | `Duplicate_key of 'k2 ])
    Base.Map.With_comparator.t

val map_keys_exn : 
  ('k2, 'cmp2, ('k1, 'v, 'cmp1) t -> f:('k1 -> 'k2) -> ('k2, 'v, 'cmp2) t)
    Base.Map.With_comparator.t

val transpose_keys : 
  ('k1,
    'cmp1,
    ('k2,
      'cmp2,
      ('k1, ('k2, 'a, 'cmp2) t, 'cmp1) t ->
      ('k2, ('k1, 'a, 'cmp1) t, 'cmp2) t)
      Base.Map.With_comparator.t)
    Base.Map.Without_comparator.t

val of_sorted_array : 
  ('k, 'cmp, ('k * 'v) array -> ('k, 'v, 'cmp) t Base.Or_error.t)
    Base.Map.With_comparator.t

val of_sorted_array_unchecked : 
  ('k, 'cmp, ('k * 'v) array -> ('k, 'v, 'cmp) t) Base.Map.With_comparator.t

val of_increasing_iterator_unchecked : 
  ('k, 'cmp, len:int -> f:(int -> 'k * 'v) -> ('k, 'v, 'cmp) t)
    Base.Map.With_comparator.t

val of_alist : 
  ('k,
    'cmp,
    ('k * 'v) list ->
    [ `Ok of ('k, 'v, 'cmp) t | `Duplicate_key of 'k ])
    Base.Map.With_comparator.t

val of_alist_or_error : 
  ('k, 'cmp, ('k * 'v) list -> ('k, 'v, 'cmp) t Base.Or_error.t)
    Base.Map.With_comparator.t

val of_alist_exn : 
  ('k, 'cmp, ('k * 'v) list -> ('k, 'v, 'cmp) t) Base.Map.With_comparator.t

val of_alist_multi : 
  ('k, 'cmp, ('k * 'v) list -> ('k, 'v list, 'cmp) t)
    Base.Map.With_comparator.t

val of_alist_fold : 
  ('k,
    'cmp,
    ('k * 'v1) list ->
    init:'v2 ->
    f:('v2 -> 'v1 -> 'v2) ->
    ('k, 'v2, 'cmp) t)
    Base.Map.With_comparator.t

val of_alist_reduce : 
  ('k, 'cmp, ('k * 'v) list -> f:('v -> 'v -> 'v) -> ('k, 'v, 'cmp) t)
    Base.Map.With_comparator.t

val of_increasing_sequence : 
  ('k, 'cmp, ('k * 'v) Base.Sequence.t -> ('k, 'v, 'cmp) t Base.Or_error.t)
    Base.Map.With_comparator.t

val of_sequence : 
  ('k,
    'cmp,
    ('k * 'v) Base.Sequence.t ->
    [ `Ok of ('k, 'v, 'cmp) t | `Duplicate_key of 'k ])
    Base.Map.With_comparator.t

val of_sequence_or_error : 
  ('k, 'cmp, ('k * 'v) Base.Sequence.t -> ('k, 'v, 'cmp) t Base.Or_error.t)
    Base.Map.With_comparator.t

val of_sequence_exn : 
  ('k, 'cmp, ('k * 'v) Base.Sequence.t -> ('k, 'v, 'cmp) t)
    Base.Map.With_comparator.t

val of_sequence_multi : 
  ('k, 'cmp, ('k * 'v) Base.Sequence.t -> ('k, 'v list, 'cmp) t)
    Base.Map.With_comparator.t

val of_sequence_fold : 
  ('k,
    'cmp,
    ('k * 'v1) Base.Sequence.t ->
    init:'v2 ->
    f:('v2 -> 'v1 -> 'v2) ->
    ('k, 'v2, 'cmp) t)
    Base.Map.With_comparator.t

val of_sequence_reduce : 
  ('k,
    'cmp,
    ('k * 'v) Base.Sequence.t ->
    f:('v -> 'v -> 'v) ->
    ('k, 'v, 'cmp) t)
    Base.Map.With_comparator.t

val of_list_with_key : 
  ('k,
    'cmp,
    'v list ->
    get_key:('v -> 'k) ->
    [ `Ok of ('k, 'v, 'cmp) t | `Duplicate_key of 'k ])
    Base.Map.With_comparator.t

val of_list_with_key_or_error : 
  ('k, 'cmp, 'v list -> get_key:('v -> 'k) -> ('k, 'v, 'cmp) t Base.Or_error.t)
    Base.Map.With_comparator.t

val of_list_with_key_exn : 
  ('k, 'cmp, 'v list -> get_key:('v -> 'k) -> ('k, 'v, 'cmp) t)
    Base.Map.With_comparator.t

val of_list_with_key_multi : 
  ('k, 'cmp, 'v list -> get_key:('v -> 'k) -> ('k, 'v list, 'cmp) t)
    Base.Map.With_comparator.t

val of_list_with_key_fold : 
  ('k,
    'cmp,
    'v list ->
    get_key:('v -> 'k) ->
    init:'acc ->
    f:('acc -> 'v -> 'acc) ->
    ('k, 'acc, 'cmp) t)
    Base.Map.With_comparator.t

val of_list_with_key_reduce : 
  ('k,
    'cmp,
    'v list ->
    get_key:('v -> 'k) ->
    f:('v -> 'v -> 'v) ->
    ('k, 'v, 'cmp) t)
    Base.Map.With_comparator.t

val of_iteri : 
  ('k,
    'cmp,
    iteri:(f:(key:'k -> data:'v -> unit) -> unit) ->
    [ `Ok of ('k, 'v, 'cmp) t | `Duplicate_key of 'k ])
    Base.Map.With_comparator.t

val of_iteri_exn : 
  ('k, 'cmp, iteri:(f:(key:'k -> data:'v -> unit) -> unit) -> ('k, 'v, 'cmp) t)
    Base.Map.With_comparator.t

val of_tree : 
  ('k, 'cmp, ('k, 'v, 'cmp) Tree.t -> ('k, 'v, 'cmp) t)
    Base.Map.With_comparator.t

val of_hashtbl_exn : 
  ('k, 'cmp, ('k, 'v) Hashtbl.t -> ('k, 'v, 'cmp) t) Base.Map.With_comparator.t

val of_key_set : ('k, 'cmp) Base.Set.t -> f:('k -> 'v) -> ('k, 'v, 'cmp) t

Never requires a comparator because it can get one from the input Set.t.

val quickcheck_generator : 
  ('k,
    'cmp,
    'k Quickcheck.Generator.t ->
    'v Quickcheck.Generator.t ->
    ('k, 'v, 'cmp) t Quickcheck.Generator.t)
    Base.Map.With_comparator.t