Module `Map.Poly`Source

A polymorphic Map.

Sourcetype ('key, +'value) t = ('key, 'value, Comparator.Poly.comparator_witness) t

type ('key, +'value) tree =
  ('key, 'value, Comparator.Poly.comparator_witness) Using_comparator.Tree.t

Sourcetype comparator_witness = Comparator.Poly.comparator_witness

Sourceval empty : ('k, _) t

Sourceval singleton : 'k -> 'v -> ('k, 'v) t

Source

val map_keys : 
  ('k1, 'v) t ->
  f:('k1 -> 'k2) ->
  [ `Ok of ('k2, 'v) t | `Duplicate_key of 'k2 ]

Sourceval map_keys_exn : ('k1, 'v) t -> f:('k1 -> 'k2) -> ('k2, 'v) t

Sourceval transpose_keys : ('k1, ('k2, 'a) t) t -> ('k2, ('k1, 'a) t) t

Sourceval of_sorted_array : ('k * 'v) array -> ('k, 'v) t Or_error.t

Sourceval of_sorted_array_unchecked : ('k * 'v) array -> ('k, 'v) t

Source

val of_increasing_iterator_unchecked : 
  len:int ->
  f:(int -> 'k * 'v) ->
  ('k, 'v) t

Sourceval of_alist : ('k * 'v) list -> [ `Ok of ('k, 'v) t | `Duplicate_key of 'k ]

Sourceval of_alist_or_error : ('k * 'v) list -> ('k, 'v) t Or_error.t

Sourceval of_alist_exn : ('k * 'v) list -> ('k, 'v) t

Sourceval of_alist_multi : ('k * 'v) list -> ('k, 'v list) t

Source

val of_alist_fold : 
  ('k * 'v1) list ->
  init:'v2 ->
  f:('v2 -> 'v1 -> 'v2) ->
  ('k, 'v2) t

Sourceval of_alist_reduce : ('k * 'v) list -> f:('v -> 'v -> 'v) -> ('k, 'v) t

Sourceval of_increasing_sequence : ('k * 'v) Sequence.t -> ('k, 'v) t Or_error.t

Source

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

Sourceval of_sequence_or_error : ('k * 'v) Sequence.t -> ('k, 'v) t Or_error.t

Sourceval of_sequence_exn : ('k * 'v) Sequence.t -> ('k, 'v) t

Sourceval of_sequence_multi : ('k * 'v) Sequence.t -> ('k, 'v list) t

Source

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

Source

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

Source

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

Source

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

Sourceval of_list_with_key_exn : 'v list -> get_key:('v -> 'k) -> ('k, 'v) t

Sourceval of_list_with_key_multi : 'v list -> get_key:('v -> 'k) -> ('k, 'v list) t

Source

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

Sourceval of_iteri_exn : iteri:(f:(key:'k -> data:'v -> unit) -> unit) -> ('k, 'v) t

Sourceval of_tree : ('k, 'v) tree -> ('k, 'v) t

Sourceval invariants : ('k, 'v) t -> bool

Sourceval is_empty : (_, _) t -> bool

Sourceval length : (_, _) t -> int

Sourceval add : ('k, 'v) t -> key:'k -> data:'v -> [ `Ok of ('k, 'v) t | `Duplicate ]

Sourceval add_exn : ('k, 'v) t -> key:'k -> data:'v -> ('k, 'v) t

Sourceval set : ('k, 'v) t -> key:'k -> data:'v -> ('k, 'v) t

Sourceval add_multi : ('k, 'v list) t -> key:'k -> data:'v -> ('k, 'v list) t

Sourceval remove_multi : ('k, 'v list) t -> 'k -> ('k, 'v list) t

Sourceval find_multi : ('k, 'v list) t -> 'k -> 'v list

Sourceval change : ('k, 'v) t -> 'k -> f:('v option -> 'v option) -> ('k, 'v) t

Sourceval update : ('k, 'v) t -> 'k -> f:('v option -> 'v) -> ('k, 'v) t

Sourceval find : ('k, 'v) t -> 'k -> 'v option

Sourceval find_exn : ('k, 'v) t -> 'k -> 'v

Sourceval remove : ('k, 'v) t -> 'k -> ('k, 'v) t

Sourceval mem : ('k, _) t -> 'k -> bool

Sourceval iter_keys : ('k, _) t -> f:('k -> unit) -> unit

Sourceval iter : (_, 'v) t -> f:('v -> unit) -> unit

Sourceval iteri : ('k, 'v) t -> f:(key:'k -> data:'v -> unit) -> unit

Source

val iteri_until : 
  ('k, 'v) t ->
  f:(key:'k -> data:'v -> Continue_or_stop.t) ->
  Finished_or_unfinished.t

Source

val iter2 : 
  ('k, 'v1) t ->
  ('k, 'v2) t ->
  f:
    (key:'k ->
      data:[ `Left of 'v1 | `Right of 'v2 | `Both of 'v1 * 'v2 ] ->
      unit) ->
  unit

Sourceval map : ('k, 'v1) t -> f:('v1 -> 'v2) -> ('k, 'v2) t

Sourceval mapi : ('k, 'v1) t -> f:(key:'k -> data:'v1 -> 'v2) -> ('k, 'v2) t

Source

val fold : 
  ('k, 'v) t ->
  init:'acc ->
  f:(key:'k -> data:'v -> 'acc -> 'acc) ->
  'acc

Source

val fold_until : 
  ('k, 'v) 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) t ->
  init:'acc ->
  f:(key:'k -> data:'v -> 'acc -> 'acc) ->
  'acc

Source

val fold2 : 
  ('k, 'v1) t ->
  ('k, 'v2) t ->
  init:'acc ->
  f:
    (key:'k ->
      data:[ `Left of 'v1 | `Right of 'v2 | `Both of 'v1 * 'v2 ] ->
      'acc ->
      'acc) ->
  'acc

Sourceval filter_keys : ('k, 'v) t -> f:('k -> bool) -> ('k, 'v) t

Sourceval filter : ('k, 'v) t -> f:('v -> bool) -> ('k, 'v) t

Sourceval filteri : ('k, 'v) t -> f:(key:'k -> data:'v -> bool) -> ('k, 'v) t

Sourceval filter_map : ('k, 'v1) t -> f:('v1 -> 'v2 option) -> ('k, 'v2) t

Source

val filter_mapi : 
  ('k, 'v1) t ->
  f:(key:'k -> data:'v1 -> 'v2 option) ->
  ('k, 'v2) t

Source

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

Source

val partition_map : 
  ('k, 'v1) t ->
  f:('v1 -> ('v2, 'v3) Either.t) ->
  ('k, 'v2) t * ('k, 'v3) t

Source

val partitioni_tf : 
  ('k, 'v) t ->
  f:(key:'k -> data:'v -> bool) ->
  ('k, 'v) t * ('k, 'v) t

Sourceval partition_tf : ('k, 'v) t -> f:('v -> bool) -> ('k, 'v) t * ('k, 'v) t

Sourceval combine_errors : ('k, 'v Or_error.t) t -> ('k, 'v) t Or_error.t

Sourceval compare_direct : ('v -> 'v -> int) -> ('k, 'v) t -> ('k, 'v) t -> int

Sourceval equal : ('v -> 'v -> bool) -> ('k, 'v) t -> ('k, 'v) t -> bool

Sourceval keys : ('k, _) t -> 'k list

Sourceval data : (_, 'v) t -> 'v list

Source

val to_alist : 
  ?key_order:[ `Increasing | `Decreasing ] ->
  ('k, 'v) t ->
  ('k * 'v) list

Source

val merge : 
  ('k, 'v1) t ->
  ('k, 'v2) t ->
  f:
    (key:'k ->
      [ `Left of 'v1 | `Right of 'v2 | `Both of 'v1 * 'v2 ] ->
      'v3 option) ->
  ('k, 'v3) t

Source

val merge_skewed : 
  ('k, 'v) t ->
  ('k, 'v) t ->
  combine:(key:'k -> 'v -> 'v -> 'v) ->
  ('k, 'v) t

Source

val symmetric_diff : 
  ('k, 'v) t ->
  ('k, 'v) t ->
  data_equal:('v -> 'v -> bool) ->
  ('k * [ `Left of 'v | `Right of 'v | `Unequal of 'v * 'v ]) Sequence.t

Source

val fold_symmetric_diff : 
  ('k, 'v) t ->
  ('k, 'v) 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) t -> ('k * 'v) option

Sourceval min_elt_exn : ('k, 'v) t -> 'k * 'v

Sourceval max_elt : ('k, 'v) t -> ('k * 'v) option

Sourceval max_elt_exn : ('k, 'v) t -> 'k * 'v

Sourceval for_all : ('k, 'v) t -> f:('v -> bool) -> bool

Sourceval for_alli : ('k, 'v) t -> f:(key:'k -> data:'v -> bool) -> bool

Sourceval exists : ('k, 'v) t -> f:('v -> bool) -> bool

Sourceval existsi : ('k, 'v) t -> f:(key:'k -> data:'v -> bool) -> bool

Sourceval count : ('k, 'v) t -> f:('v -> bool) -> int

Sourceval counti : ('k, 'v) t -> f:(key:'k -> data:'v -> bool) -> int

Sourceval split : ('k, 'v) t -> 'k -> ('k, 'v) t * ('k * 'v) option * ('k, 'v) t

Sourceval split_le_gt : ('k, 'v) t -> 'k -> ('k, 'v) t * ('k, 'v) t

Sourceval split_lt_ge : ('k, 'v) t -> 'k -> ('k, 'v) t * ('k, 'v) t

Source

val append : 
  lower_part:('k, 'v) t ->
  upper_part:('k, 'v) t ->
  [ `Ok of ('k, 'v) t | `Overlapping_key_ranges ]

Source

val subrange : 
  ('k, 'v) t ->
  lower_bound:'k Maybe_bound.t ->
  upper_bound:'k Maybe_bound.t ->
  ('k, 'v) t

Source

val fold_range_inclusive : 
  ('k, 'v) t ->
  min:'k ->
  max:'k ->
  init:'acc ->
  f:(key:'k -> data:'v -> 'acc -> 'acc) ->
  'acc

Sourceval range_to_alist : ('k, 'v) t -> min:'k -> max:'k -> ('k * 'v) list

Source

val closest_key : 
  ('k, 'v) t ->
  [ `Greater_or_equal_to | `Greater_than | `Less_or_equal_to | `Less_than ] ->
  'k ->
  ('k * 'v) option

Sourceval nth : ('k, 'v) t -> int -> ('k * 'v) option

Sourceval nth_exn : ('k, 'v) t -> int -> 'k * 'v

Sourceval rank : ('k, _) t -> 'k -> int option

Sourceval to_tree : ('k, 'v) t -> ('k, 'v) tree

Source

val to_sequence : 
  ?order:[ `Increasing_key | `Decreasing_key ] ->
  ?keys_greater_or_equal_to:'k ->
  ?keys_less_or_equal_to:'k ->
  ('k, 'v) t ->
  ('k * 'v) Sequence.t

Source

val binary_search : 
  ('k, 'v) t ->
  compare:(key:'k -> data:'v -> 'key -> int) ->
  Binary_searchable.Which_target_by_key.t ->
  'key ->
  ('k * 'v) option

Source

val binary_search_segmented : 
  ('k, 'v) t ->
  segment_of:(key:'k -> data:'v -> [ `Left | `Right ]) ->
  Binary_searchable.Which_target_by_segment.t ->
  ('k * 'v) option

Source

val binary_search_subrange : 
  ('k, 'v) t ->
  compare:(key:'k -> data:'v -> 'bound -> int) ->
  lower_bound:'bound Maybe_bound.t ->
  upper_bound:'bound Maybe_bound.t ->
  ('k, 'v) t

Source

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

package base

Module Map.PolySource

Module `Map.Poly`Source