Module `Using_comparator.Tree`Source

Sourcetype (+'k, +'v, 'cmp) t

val sexp_of_t : 
  ('k -> Sexplib0.Sexp.t) ->
  ('v -> Sexplib0.Sexp.t) ->
  ('cmp -> Sexplib0.Sexp.t) ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  Sexplib0.Sexp.t

Source

val t_of_sexp_direct : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  (Base.Sexp.t -> 'k) ->
  (Base.Sexp.t -> 'v) ->
  Base.Sexp.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

include Base.Dictionary_immutable.Creators
  with type 'key key := 'key
   and type ('key, 'data, 'cmp) t :=
         ('key, 'data, 'cmp) Base.Map.Using_comparator.Tree.t
   and type ('fn, 'key, _, 'cmp) creator :=
         comparator:('key, 'cmp) Base.Comparator.t ->
         'fn

Source

val empty : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, _, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val singleton : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  'k ->
  'v ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

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

Source

val map_keys_exn : 
  comparator:('k2, 'cmp2) Base.Comparator.t ->
  ('k1, 'v, 'cmp1) Base.Map.Using_comparator.Tree.t ->
  f:('k1 -> 'k2) ->
  ('k2, 'v, 'cmp2) Base.Map.Using_comparator.Tree.t

Source

val transpose_keys : 
  comparator:('k1, 'cmp1) Base.Comparator.t ->
  comparator:('k2, 'cmp2) Base.Comparator.t ->
  ('k1, ('k2, 'a, 'cmp2) Base.Map.Using_comparator.Tree.t, 'cmp1)
    Base.Map.Using_comparator.Tree.t ->
  ('k2, ('k1, 'a, 'cmp1) Base.Map.Using_comparator.Tree.t, 'cmp2)
    Base.Map.Using_comparator.Tree.t

Source

val of_sorted_array : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k * 'v) array ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t Base.Or_error.t

Source

val of_sorted_array_unchecked : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k * 'v) array ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

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

Source

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

Source

val of_alist_or_error : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k * 'v) list ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t Base.Or_error.t

Source

val of_alist_exn : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k * 'v) list ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val of_alist_multi : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k * 'v) list ->
  ('k, 'v list, 'cmp) Base.Map.Using_comparator.Tree.t

Source

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

Source

val of_alist_reduce : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k * 'v) list ->
  f:('v -> 'v -> 'v) ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val of_increasing_sequence : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k * 'v) Base.Sequence.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t Base.Or_error.t

Source

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

Source

val of_sequence_or_error : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k * 'v) Base.Sequence.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t Base.Or_error.t

Source

val of_sequence_exn : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k * 'v) Base.Sequence.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val of_sequence_multi : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k * 'v) Base.Sequence.t ->
  ('k, 'v list, 'cmp) Base.Map.Using_comparator.Tree.t

Source

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

Source

val of_sequence_reduce : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k * 'v) Base.Sequence.t ->
  f:('v -> 'v -> 'v) ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

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

Source

val of_list_with_key_or_error : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  'v list ->
  get_key:('v -> 'k) ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t Base.Or_error.t

Source

val of_list_with_key_exn : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  'v list ->
  get_key:('v -> 'k) ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val of_list_with_key_multi : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  'v list ->
  get_key:('v -> 'k) ->
  ('k, 'v list, 'cmp) Base.Map.Using_comparator.Tree.t

Source

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

Source

val of_list_with_key_reduce : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  'v list ->
  get_key:('v -> 'k) ->
  f:('v -> 'v -> 'v) ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

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

Source

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

Source

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

Source

val invariants : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  bool

Sourceval is_empty : (_, _, _) Base.Map.Using_comparator.Tree.t -> bool

Sourceval length : (_, _, _) Base.Map.Using_comparator.Tree.t -> int

Source

val add : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  key:'k ->
  data:'v ->
  [ `Ok of ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t | `Duplicate ]

Source

val add_exn : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  key:'k ->
  data:'v ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val set : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  key:'k ->
  data:'v ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val add_multi : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v list, 'cmp) Base.Map.Using_comparator.Tree.t ->
  key:'k ->
  data:'v ->
  ('k, 'v list, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val remove_multi : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v list, 'cmp) Base.Map.Using_comparator.Tree.t ->
  'k ->
  ('k, 'v list, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val find_multi : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v list, 'cmp) Base.Map.Using_comparator.Tree.t ->
  'k ->
  'v list

Source

val change : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  'k ->
  f:('v option -> 'v option) ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val update : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  'k ->
  f:('v option -> 'v) ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val find : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  'k ->
  'v option

Source

val find_exn : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  'k ->
  'v

Source

val remove : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  'k ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val mem : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, _, 'cmp) Base.Map.Using_comparator.Tree.t ->
  'k ->
  bool

Source

val iter_keys : 
  ('k, _, _) Base.Map.Using_comparator.Tree.t ->
  f:('k -> unit) ->
  unit

Source

val iter : 
  (_, 'v, _) Base.Map.Using_comparator.Tree.t ->
  f:('v -> unit) ->
  unit

Source

val iteri : 
  ('k, 'v, _) Base.Map.Using_comparator.Tree.t ->
  f:(key:'k -> data:'v -> unit) ->
  unit

Source

val iteri_until : 
  ('k, 'v, _) Base.Map.Using_comparator.Tree.t ->
  f:(key:'k -> data:'v -> Base.Map.Continue_or_stop.t) ->
  Base.Map.Finished_or_unfinished.t

Source

val iter2 : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v1, 'cmp) Base.Map.Using_comparator.Tree.t ->
  ('k, 'v2, 'cmp) Base.Map.Using_comparator.Tree.t ->
  f:
    (key:'k ->
      data:[ `Left of 'v1 | `Right of 'v2 | `Both of 'v1 * 'v2 ] ->
      unit) ->
  unit

Source

val map : 
  ('k, 'v1, 'cmp) Base.Map.Using_comparator.Tree.t ->
  f:('v1 -> 'v2) ->
  ('k, 'v2, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val mapi : 
  ('k, 'v1, 'cmp) Base.Map.Using_comparator.Tree.t ->
  f:(key:'k -> data:'v1 -> 'v2) ->
  ('k, 'v2, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val fold : 
  ('k, 'v, _) Base.Map.Using_comparator.Tree.t ->
  init:'acc ->
  f:(key:'k -> data:'v -> 'acc -> 'acc) ->
  'acc

Source

val fold_until : 
  ('k, 'v, _) Base.Map.Using_comparator.Tree.t ->
  init:'acc ->
  f:(key:'k -> data:'v -> 'acc -> ('acc, 'final) Container.Continue_or_stop.t) ->
  finish:('acc -> 'final) ->
  'final

Source

val fold_right : 
  ('k, 'v, _) Base.Map.Using_comparator.Tree.t ->
  init:'acc ->
  f:(key:'k -> data:'v -> 'acc -> 'acc) ->
  'acc

Source

val fold2 : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v1, 'cmp) Base.Map.Using_comparator.Tree.t ->
  ('k, 'v2, 'cmp) Base.Map.Using_comparator.Tree.t ->
  init:'acc ->
  f:
    (key:'k ->
      data:[ `Left of 'v1 | `Right of 'v2 | `Both of 'v1 * 'v2 ] ->
      'acc ->
      'acc) ->
  'acc

Source

val filter_keys : 
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  f:('k -> bool) ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val filter : 
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  f:('v -> bool) ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val filteri : 
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  f:(key:'k -> data:'v -> bool) ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val filter_map : 
  ('k, 'v1, 'cmp) Base.Map.Using_comparator.Tree.t ->
  f:('v1 -> 'v2 option) ->
  ('k, 'v2, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val filter_mapi : 
  ('k, 'v1, 'cmp) Base.Map.Using_comparator.Tree.t ->
  f:(key:'k -> data:'v1 -> 'v2 option) ->
  ('k, 'v2, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val partition_mapi : 
  ('k, 'v1, 'cmp) Base.Map.Using_comparator.Tree.t ->
  f:(key:'k -> data:'v1 -> ('v2, 'v3) Base.Either.t) ->
  ('k, 'v2, 'cmp) Base.Map.Using_comparator.Tree.t
  * ('k, 'v3, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val partition_map : 
  ('k, 'v1, 'cmp) Base.Map.Using_comparator.Tree.t ->
  f:('v1 -> ('v2, 'v3) Base.Either.t) ->
  ('k, 'v2, 'cmp) Base.Map.Using_comparator.Tree.t
  * ('k, 'v3, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val partitioni_tf : 
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  f:(key:'k -> data:'v -> bool) ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t
  * ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val partition_tf : 
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  f:('v -> bool) ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t
  * ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val combine_errors : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v Base.Or_error.t, 'cmp) Base.Map.Using_comparator.Tree.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t Base.Or_error.t

Source

val unzip : 
  ('k, 'v1 * 'v2, 'cmp) Base.Map.Using_comparator.Tree.t ->
  ('k, 'v1, 'cmp) Base.Map.Using_comparator.Tree.t
  * ('k, 'v2, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val compare_direct : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('v -> 'v -> int) ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  int

Source

val equal : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('v -> 'v -> bool) ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  bool

Sourceval keys : ('k, _, _) Base.Map.Using_comparator.Tree.t -> 'k list

Sourceval data : (_, 'v, _) Base.Map.Using_comparator.Tree.t -> 'v list

Source

val to_alist : 
  ?key_order:[ `Increasing | `Decreasing ] ->
  ('k, 'v, _) Base.Map.Using_comparator.Tree.t ->
  ('k * 'v) list

Source

val merge : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v1, 'cmp) Base.Map.Using_comparator.Tree.t ->
  ('k, 'v2, 'cmp) Base.Map.Using_comparator.Tree.t ->
  f:
    (key:'k ->
      [ `Left of 'v1 | `Right of 'v2 | `Both of 'v1 * 'v2 ] ->
      'v3 option) ->
  ('k, 'v3, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val merge_disjoint_exn : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val merge_skewed : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  combine:(key:'k -> 'v -> 'v -> 'v) ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val symmetric_diff : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  data_equal:('v -> 'v -> bool) ->
  ('k * [ `Left of 'v | `Right of 'v | `Unequal of 'v * 'v ]) Base.Sequence.t

Source

val fold_symmetric_diff : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  data_equal:('v -> 'v -> bool) ->
  init:'acc ->
  f:
    ('acc ->
      ('k * [ `Left of 'v | `Right of 'v | `Unequal of 'v * 'v ]) ->
      'acc) ->
  'acc

Sourceval min_elt : ('k, 'v, _) Base.Map.Using_comparator.Tree.t -> ('k * 'v) option

Sourceval min_elt_exn : ('k, 'v, _) Base.Map.Using_comparator.Tree.t -> 'k * 'v

Sourceval max_elt : ('k, 'v, _) Base.Map.Using_comparator.Tree.t -> ('k * 'v) option

Sourceval max_elt_exn : ('k, 'v, _) Base.Map.Using_comparator.Tree.t -> 'k * 'v

Source

val for_all : 
  ('k, 'v, _) Base.Map.Using_comparator.Tree.t ->
  f:('v -> bool) ->
  bool

Source

val for_alli : 
  ('k, 'v, _) Base.Map.Using_comparator.Tree.t ->
  f:(key:'k -> data:'v -> bool) ->
  bool

Source

val exists : 
  ('k, 'v, _) Base.Map.Using_comparator.Tree.t ->
  f:('v -> bool) ->
  bool

Source

val existsi : 
  ('k, 'v, _) Base.Map.Using_comparator.Tree.t ->
  f:(key:'k -> data:'v -> bool) ->
  bool

Source

val count : 
  ('k, 'v, _) Base.Map.Using_comparator.Tree.t ->
  f:('v -> bool) ->
  int

Source

val counti : 
  ('k, 'v, _) Base.Map.Using_comparator.Tree.t ->
  f:(key:'k -> data:'v -> bool) ->
  int

Source

val sum : 
  (module Base.Container.Summable with type t = 'a) ->
  ('k, 'v, _) Base.Map.Using_comparator.Tree.t ->
  f:('v -> 'a) ->
  'a

Source

val sumi : 
  (module Base.Container.Summable with type t = 'a) ->
  ('k, 'v, _) Base.Map.Using_comparator.Tree.t ->
  f:(key:'k -> data:'v -> 'a) ->
  'a

Source

val split : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  'k ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t
  * ('k * 'v) option
  * ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val split_le_gt : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  'k ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t
  * ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val split_lt_ge : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  'k ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t
  * ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val append : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  lower_part:('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  upper_part:('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  [ `Ok of ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t
  | `Overlapping_key_ranges ]

Source

val subrange : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  lower_bound:'k Base.Maybe_bound.t ->
  upper_bound:'k Base.Maybe_bound.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

val fold_range_inclusive : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  min:'k ->
  max:'k ->
  init:'acc ->
  f:(key:'k -> data:'v -> 'acc -> 'acc) ->
  'acc

Source

val range_to_alist : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  min:'k ->
  max:'k ->
  ('k * 'v) list

Source

val closest_key : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  [ `Greater_or_equal_to | `Greater_than | `Less_or_equal_to | `Less_than ] ->
  'k ->
  ('k * 'v) option

Source

val nth : 
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  int ->
  ('k * 'v) option

Sourceval nth_exn : ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t -> int -> 'k * 'v

Source

val rank : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, _, 'cmp) Base.Map.Using_comparator.Tree.t ->
  'k ->
  int option

Source

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

Source

val to_sequence : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ?order:[ `Increasing_key | `Decreasing_key ] ->
  ?keys_greater_or_equal_to:'k ->
  ?keys_less_or_equal_to:'k ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  ('k * 'v) Base.Sequence.t

Source

val binary_search : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  compare:(key:'k -> data:'v -> 'key -> int) ->
  Base.Binary_searchable.Which_target_by_key.t ->
  'key ->
  ('k * 'v) option

Source

val binary_search_segmented : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  segment_of:(key:'k -> data:'v -> [ `Left | `Right ]) ->
  Base.Binary_searchable.Which_target_by_segment.t ->
  ('k * 'v) option

Source

val binary_search_subrange : 
  comparator:('k, 'cmp) Base.Comparator.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t ->
  compare:(key:'k -> data:'v -> 'bound -> int) ->
  lower_bound:'bound Base.Maybe_bound.t ->
  upper_bound:'bound Base.Maybe_bound.t ->
  ('k, 'v, 'cmp) Base.Map.Using_comparator.Tree.t

Source

module Make_applicative_traversals
  (A : Base.Applicative.Lazy_applicative) : 
  sig ... end

Source

val empty_without_value_restriction : 
  (_, _, _) Base.Map.Using_comparator.Tree.t

Sourcemodule Build_increasing : sig ... end

Build_increasing can be used to construct a map incrementally from a sequence that is known to be increasing.

Module Using_comparator.TreeSource

Module `Using_comparator.Tree`Source