package core-and-more

  1. Overview
  2. Docs
Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source

Module ResultDict.CompareDictSource

Sourcetype key = F.Arg.t
Sourceval compare_key : key -> key -> Ppx_deriving_runtime.int
Sourceval hash_fold_key : Ppx_hash_lib.Std.Hash.state -> key -> Ppx_hash_lib.Std.Hash.state
Sourceval hash_key : key -> Ppx_hash_lib.Std.Hash.hash_value
Sourcetype value = F.Result.t
Sourceval compare_value : value -> value -> Ppx_deriving_runtime.int
Sourceval hash_fold_value : Ppx_hash_lib.Std.Hash.state -> value -> Ppx_hash_lib.Std.Hash.state
Sourceval hash_value : value -> Ppx_hash_lib.Std.Hash.hash_value
Sourcetype pair = key * value
Sourceval compare_pair : pair -> pair -> Ppx_deriving_runtime.int
Sourceval hash_fold_pair : Ppx_hash_lib.Std.Hash.state -> pair -> Ppx_hash_lib.Std.Hash.state
Sourceval hash_pair : pair -> Ppx_hash_lib.Std.Hash.hash_value
Sourcetype t =
  1. | Leaf
  2. | Two of t * pair * t
  3. | Three of t * pair * t * pair * t
Sourceval hash_fold_t : Ppx_hash_lib.Std.Hash.state -> t -> Ppx_hash_lib.Std.Hash.state
Sourceval hash : t -> Ppx_hash_lib.Std.Hash.hash_value
Sourcetype kvp_list = (F.Arg.t * F.Result.t) list
Sourcetype kicked =
  1. | Up of t * pair * t
  2. | Done of t
Sourcetype hole =
  1. | Hole of pair option * t
  2. | Absorbed of pair option * t
Sourcetype direction2 =
  1. | Left2
  2. | Right2
Sourcetype direction3 =
  1. | Left3
  2. | Mid3
  3. | Right3
Sourceval empty : t
Sourceval fold : (key -> value -> 'a -> 'a) -> 'a -> t -> 'a
Sourceval map_values : f:(value -> value) -> t -> t
Sourceval insert_upward_two : pair -> t -> t -> pair -> t -> kicked
Sourceval insert_upward_three : pair -> t -> t -> pair -> pair -> t -> t -> kicked
Sourceval insert_downward : (value -> value -> value) -> t -> key -> value -> kicked * bool
Sourceval insert_downward_two : (value -> value -> value) -> pair -> pair -> t -> t -> kicked * bool
Sourceval insert_downward_three : (value -> value -> value) -> pair -> pair -> pair -> t -> t -> t -> kicked * bool
Sourceval insert_or_combine : combiner:(value -> value -> value) -> t -> key -> value -> t * bool
Sourceval insert : t -> key -> value -> t
Sourceval insert_and_new : t -> key -> value -> t * bool
Sourceval remove_upward_two : pair -> pair option -> t -> t -> direction2 -> hole
Sourceval remove_upward_three : pair -> pair -> pair option -> t -> t -> t -> direction3 -> hole
Sourceval remove_downward : (value -> value option) -> t -> key -> hole
Sourceval remove_downward_two : (value -> value option) -> key -> pair -> t -> t -> hole
Sourceval remove_downward_three : (value -> value option) -> key -> pair -> pair -> t -> t -> t -> hole
Sourceval remove_min : t -> hole
Sourceval remove_or_update_and_retrieve_old : updater:(value -> value option) -> t -> key -> value option * t
Sourceval remove_or_update_and_retrieve_old_exn : updater:(value -> value option) -> t -> key -> value * t
Sourceval remove_or_update : updater:(value -> value option) -> t -> key -> t
Sourceval remove : t -> key -> t
Sourceval update : updater:(value -> value) -> t -> key -> t
Sourceval lookup : t -> key -> value option
Sourceval lookup_default : default:value -> t -> key -> value
Sourceval lookup_exn : t -> key -> value
Sourceval member : t -> key -> bool
Sourceval choose : t -> (key * value * t) option
Sourceval from_kvp_list : (key * value) list -> t
Sourceval singleton : key -> value -> t
Sourceval is_empty : t -> bool
Sourceval as_kvp_list : t -> (key * value) list
Sourceval key_list : t -> key list
Sourceval value_list : t -> value list
Sourceval compare : t -> t -> int
Sourceval equal : t -> t -> bool
Sourceval merge : combiner:(value -> value -> 'a) -> only_d1_fn:(value -> 'a) -> only_d2_fn:(value -> 'a) -> t -> t -> (key * 'a) list
Sourceval merge_to_dict : ?only_d1_fn:(value -> value) -> ?only_d2_fn:(value -> value) -> combiner:(value -> value -> value) -> t -> t -> t
Sourceval max_key : t -> key option
Sourceval max_key_exn : t -> key
Sourceval size : t -> int
Sourceval first : f:(key -> value -> bool) -> t -> (key * value) option
Sourceval first_exn : f:(key -> value -> bool) -> t -> key * value
Sourceval exists : f:(key -> value -> bool) -> t -> bool
Sourceval for_all : f:(key -> value -> bool) -> t -> bool
OCaml

Innovation. Community. Security.